50 citations · 50 across the 2 of their papers we have counts for
2 papers
math.OC2021
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness
Ankit Garg, Robin Kothari, Praneeth Netrapalli +1
We study the complexity of optimizing highly smooth convex functions. For a positive integer , we want to find an -approximate minimum of a convex function , given oracle…
cs.LG2014★ 50 cited
On Communication Cost of Distributed Statistical Estimation and Dimensionality
Ankit Garg, Tengyu Ma, Huy L. Nguyen
We explore the connection between dimensionality and communication cost in distributed learning problems. Specifically we study the problem of estimating the mean of an unk…