Explore advanced concepts in convex optimization with Sebastien Bubeck from Microsoft Research in this comprehensive lecture. Delve into topics such as gradient oracles, the minimax principle and theorem, random oracles, and intuition behind antisymmetric lower bounds. Learn about general algorithms, inequalities, gradient queries, and efficient algorithms in the field of convex optimization. Gain valuable insights from this in-depth presentation, suitable for those with a strong background in optimization and mathematical analysis.
Overview
Syllabus
Intro
Gradient Oracle
Minimax Principle
Minimax Theorem
Random Oracle
Intuition
Antisymmetric
Lower Bounds
General Algorithm
Inequality
Gradient Queries
Efficient Algorithms
Taught by
Paul G. Allen School
Related Courses
-
Introductory Lectures on First-Order Convex Optimization - Lecture 1
-
Convex Optimization IV - Sebastien Bubeck, Microsoft Research
-
Optimization Crash Course
-
Private Convex Optimization via Exponential Mechanism - Differential Privacy for Machine Learning
-
Large Scale Machine Learning and Convex Optimization - Lecture 3
