Optimization Techniques: Convexity in Machine Learning

Related lectures (23)

Page 2 of 3

Explores optimization methods in machine learning, emphasizing gradients, costs, and computational efforts for efficient model training.

Discusses advanced optimization techniques, focusing on faster and projected gradient descent methods in machine learning.

Covers convex optimization problems and gradient-based algorithms to find the global minimum.

Explores stochastic optimization algorithms and methods for convex problems with smooth and nonsmooth risks.

Covers the properties and operations of convex functions.

Introduces optimization basics, covering logistic regression, derivatives, convex functions, gradient descent, and second-order methods.

Covers non-convex optimization techniques and their applications in machine learning.

Introduces convex optimization, focusing on the importance of convexity in algorithms and optimization problems.

Covers non-convex optimization, deep learning training problems, stochastic gradient descent, adaptive methods, and neural network architectures.

Explores the optimality of convergence rates in convex optimization, focusing on accelerated gradient descent and adaptive methods.