Lecture
Minimax Optimization: Theory and Algorithms
Related lectures (36)
Primal-dual Optimization: Fundamentals
Explores primal-dual optimization, minimax problems, and gradient descent-ascent methods for optimization algorithms.
Primal-dual Optimization: Extra-Gradient Method
Explores the Extra-Gradient method for Primal-dual optimization, covering nonconvex-concave problems, convergence rates, and practical performance.
Primal-dual optimization: Theory and Computation
Explores primal-dual optimization, conjugation of functions, strong duality, and quadratic penalty methods in data mathematics.
Optimality of Convergence Rates: Accelerated Gradient Descent
Explores the optimality of convergence rates in convex optimization, focusing on accelerated gradient descent and adaptive methods.
Optimization Methods: Convergence and Trade-offs
Covers optimization methods, convergence guarantees, trade-offs, and variance reduction techniques in numerical optimization.
Gradient Descent Methods: Theory and Computation
Explores gradient descent methods for smooth convex and non-convex problems, covering iterative strategies, convergence rates, and challenges in optimization.
Optimization Duality: Theory and Algorithms
Explores optimization duality, weak and strong duality, practical optimization algorithms, and challenges in nonconvex-concave problems.
Proximal Operators: Optimization Methods
Explores proximal operators, subgradient methods, and composite minimization in optimization.
Optimality of Convergence Rates: Accelerated/Stochastic Gradient Descent
Covers the optimality of convergence rates in accelerated and stochastic gradient descent methods for non-convex optimization problems.
Adversarial Machine Learning: Fundamentals and Techniques
Explores adversarial machine learning, covering the generation of adversarial examples, robustness challenges, and techniques like Fast Gradient Sign Method.