Microsoft Research India, Bengaluru, KA, India; Google Research India, Bengaluru, KA, India; Microsoft Quantum and Microsoft Research, Redmond, WA, USA; Vector Institute, Toronto, ON, Canada
Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif
Convex optimization;Oracle complexity;Lower bounds;Acceleration
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness