Online Lazy Gradient Descent is Universal on Strongly Convex Domains

Neural Information Processing Systems 

We study Online Lazy Gradient Descent for optimisation on a strongly convex domain.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found