Local Minimax Complexity of Stochastic Convex Optimization

sabyasachi chatterjee, John C. Duchi, John Lafferty, Yuancheng Zhu

Neural Information Processing Systems 

Our main result gives function-specific lower and upper bounds on the number of stochastic subgradient evaluations needed to optimize either the function or its "hardest local alternative" to a given numerical precision.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found