Princeton Prof Reviews MIT Nonconvex Optimization Paper: Prize Remains Open
HazanPrinceton · x · 2026-07-30
Princeton professor Elad Hazan reviewed a new MIT paper on nonconvex optimization. The paper proposes a black-box approach reducing nonconvex optimization to static regret minimization in online convex optimization (OCO).
Hazan noted that while it is a nice paper, it does not solve his open prize question regarding achieving an AdaGrad speedup in nonconvex optimization. The paper's bound is based on an "SGD rate + regret" approach, where a 2-expert Hedge already provides an SGD-safe guarantee on their surrogate. Thus, his prize remains unclaimed.
More from Research
- Behavioral Study: AI Agents Undermine Human Social Norms in Cooperation — steverathje2 · 2026-07-30
- Cracking a 6-Month Grad School Problem: GPT-5.6 Pro Proves Complex Math Inequality — thomasahle · 2026-07-30
- NBER Lecture: AI-Generated Data to Disrupt Empirical Economics — TaniaBabina · 2026-07-30
- LessWrong Deep Dive: Why Building AGI via RL & Search is Terrifying — DKokotajlo · 2026-07-30
- Wonder: Real-Time Camera-Controllable World Model at 16 FPS — qixing_huang · 2026-07-30
- Engineer Debunks Kimi K3 Memory Claims: Small State ≠ Flash Offload — AccBalanced · 2026-07-30