ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2002.00189
  4. Cited By
The Statistical Complexity of Early-Stopped Mirror Descent

The Statistical Complexity of Early-Stopped Mirror Descent

1 February 2020
Tomas Vaskevicius
Varun Kanade
Patrick Rebeschini
ArXivPDFHTML

Papers citing "The Statistical Complexity of Early-Stopped Mirror Descent"

4 / 4 papers shown
Title
Optimization Insights into Deep Diagonal Linear Networks
Optimization Insights into Deep Diagonal Linear Networks
Hippolyte Labarrière
C. Molinari
Lorenzo Rosasco
S. Villa
Cristian Vega
73
0
0
21 Dec 2024
Sobolev Acceleration and Statistical Optimality for Learning Elliptic
  Equations via Gradient Descent
Sobolev Acceleration and Statistical Optimality for Learning Elliptic Equations via Gradient Descent
Yiping Lu
Jose H. Blanchet
Lexing Ying
30
7
0
15 May 2022
Thinking Outside the Ball: Optimal Learning with Gradient Descent for
  Generalized Linear Stochastic Convex Optimization
Thinking Outside the Ball: Optimal Learning with Gradient Descent for Generalized Linear Stochastic Convex Optimization
I Zaghloul Amir
Roi Livni
Nathan Srebro
17
6
0
27 Feb 2022
Learning without Concentration
Learning without Concentration
S. Mendelson
80
333
0
01 Jan 2014
1