Generalized Optimistic Methods for Convex-Concave Saddle Point Problems

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (29)

Page 3 of 3

Optimization Techniques: Gradient Descent and Convex Functions

Provides an overview of optimization techniques, focusing on gradient descent and properties of convex functions in machine learning.

Convex Optimization: Convex Functions

Covers the concept of convex functions and their applications in optimization problems.

Stochastic Gradient Descent: Non-convex Optimization Techniques

Discusses Stochastic Gradient Descent and its application in non-convex optimization, focusing on convergence rates and challenges in machine learning.

Convex Sets: Mathematical Optimization

Introduces convex optimization, covering convex sets, solution concepts, and efficient numerical methods in mathematical optimization.

Convex Optimization: Sets and Functions

Introduces convex optimization through sets and functions, covering intersections, examples, operations, gradient, Hessian, and real-world applications.

Conjugate Duality: Envelope Representations and Subgradients

Explores envelope representations, subgradients, and the duality gap in convex optimization.

Linear Models and Overfitting

Explores linear models, overfitting, and the importance of feature expansion and adding more data to reduce overfitting.

Numerics: semester project

Covers the semester project on numerics, focusing on adaptive algorithms and multistep methods.

Optimization Basics: Norms, Convexity, Differentiability

Explores optimization basics such as norms, convexity, and differentiability, along with practical applications and convergence rates.