2 citations · 3 across the 5 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
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.CC2021
One-way communication complexity and non-adaptive decision trees
Nikhil S. Mande, Swagato Sanyal, Suhail Sherif
We study the relationship between various one-way communication complexity measures of a composed function with the analogous decision tree complexity of the outer function. We con…