First-Order Optimization and Online Learning Techniques in the Design of Fast Spectral Algorithms
summary
First-order iterative methods combine multiplicative weight updates and gradient descent (plus regularizers like entropy or sqrt(p)) to convert Laplacian-based graph tasks into cheap black‑box queries of value and gradient. Claims: non‑smooth needs Θ(1/ε^2) iterations, smooth gradient descent Θ(1/ε), and a primal‑dual blend (Nesterov) achieves Θ(1/√ε). Tools: smoothness/strong convexity, potential‑function regret analysis, regularization. Concrete outcomes: recovers matrix concentration proofs, yields BSS‑style linear sparsifiers via a special regularizer, and improves packing LPs from 1/ε^2 to 1/ε.
AI-written summary · about
chapters (25)
- 0:00Intro
- 1:02Applying the Laplacian Paradigm
- 3:34A Modern Design Toolkit
- 7:22Convex Optimization Setup: Analysis COMPUTATIONAL MODEL
- 8:23Convex Optimization Setup: Assumptions
- 12:28Outline
- 15:57Gradient Descent Step
- 17:19Example: Euclidean Gradient Descent
- 17:56Smooth Convex Optimization
- 20:04Gradient Descent Iteration
- 21:27Analysis of Gradient Descent
- 24:40Limitations of Gradient Descent
- 25:15Limitations : Conceptual Example
- 26:49Conceptual Example + Dual Averaging
- 27:37Non-Smooth Setup: Dual Approach
- 29:02Duality Gap for Dual Averaging
- 30:31Reduction to Online Linear Minimization
- 35:18Simplex Case: Learning with Experts
- 36:13Simplex Case: Multiplicative Weight Updates
- 44:55Regularization 101
- 49:42Regularized Update: Definition
- 51:54Completing the Analysis
- 52:16Follow the Regularized Leader
- 53:53Different Regularizers in Algorithm Design QUESTION
- 58:26Nesterov's Algorithm: Review
related talks
58mFirst-Order Stochastic Optimization
01h 18mOptimization I
29mImplicit Regularization in Nonconvex Statistical Estimation
01h 01mRobustness, Stochastics, Uncertainty 2
46mSmooth Nonconvex Min-Max Optimization
01h 07mOptimization Crash Course (continued)
01h 12mStochastic Second Order Optimization Methods II
01h 05mOptimization for Machine Learning I
