ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2004.01025
  4. Cited By
Mirrorless Mirror Descent: A Natural Derivation of Mirror Descent
v1v2v3 (latest)

Mirrorless Mirror Descent: A Natural Derivation of Mirror Descent

International Conference on Artificial Intelligence and Statistics (AISTATS), 2020
2 April 2020
Suriya Gunasekar
Blake E. Woodworth
Nathan Srebro
    MDE
ArXiv (abs)PDFHTML

Papers citing "Mirrorless Mirror Descent: A Natural Derivation of Mirror Descent"

20 / 20 papers shown
Mirror Descent Using the Tempesta Generalized Multi-parametric Logarithms
Mirror Descent Using the Tempesta Generalized Multi-parametric Logarithms
Andrzej Cichocki
236
3
0
08 Jun 2025
Mirror Descent and Novel Exponentiated Gradient Algorithms Using Trace-Form Entropies and Deformed Logarithms
Mirror Descent and Novel Exponentiated Gradient Algorithms Using Trace-Form Entropies and Deformed Logarithms
Andrzej Cichocki
Toshihisa Tanaka
Frank Nielsen
S. Cruces
474
2
0
11 Mar 2025
Early-Stopped Mirror Descent for Linear Regression over Convex Bodies
Early-Stopped Mirror Descent for Linear Regression over Convex Bodies
Tobias Wegel
Gil Kur
Patrick Rebeschini
336
0
0
05 Mar 2025
A Mirror Descent Perspective of Smoothed Sign Descent
A Mirror Descent Perspective of Smoothed Sign DescentConference on Uncertainty in Artificial Intelligence (UAI), 2024
Shuyang Wang
Diego Klabjan
386
2
0
18 Oct 2024
Get rich quick: exact solutions reveal how unbalanced initializations
  promote rapid feature learning
Get rich quick: exact solutions reveal how unbalanced initializations promote rapid feature learningNeural Information Processing Systems (NeurIPS), 2024
D. Kunin
Allan Raventós
Clémentine Dominé
Feng Chen
David Klindt
Andrew M. Saxe
Surya Ganguli
MLT
384
34
0
10 Jun 2024
A Challenge in Reweighting Data with Bilevel Optimization
A Challenge in Reweighting Data with Bilevel Optimization
Anastasia Ivanova
Pierre Ablin
318
1
0
26 Oct 2023
Local Convergence of Gradient Methods for Min-Max Games: Partial
  Curvature Generically Suffices
Local Convergence of Gradient Methods for Min-Max Games: Partial Curvature Generically Suffices
Guillaume Wang
Lénaïc Chizat
360
0
0
26 May 2023
Stochastic Approximation Beyond Gradient for Signal Processing and
  Machine Learning
Stochastic Approximation Beyond Gradient for Signal Processing and Machine LearningIEEE Transactions on Signal Processing (IEEE TSP), 2023
Hadrien Hendrikx
G. Fort
Eric Moulines
Hoi-To Wai
344
22
0
22 Feb 2023
Iterative regularization in classification via hinge loss diagonal
  descent
Iterative regularization in classification via hinge loss diagonal descentInverse Problems (IP), 2022
Vassilis Apidopoulos
T. Poggio
Lorenzo Rosasco
S. Villa
282
2
0
24 Dec 2022
Information Geometry of Dynamics on Graphs and Hypergraphs
Information Geometry of Dynamics on Graphs and HypergraphsInformation Geometry (IG), 2022
Tetsuya J. Kobayashi
Dimitri Loutchko
A. Kamimura
Shuhei A. Horiguchi
Yuki Sughiyama
AI4CE
334
17
0
26 Nov 2022
From Gradient Flow on Population Loss to Learning with Stochastic
  Gradient Descent
From Gradient Flow on Population Loss to Learning with Stochastic Gradient DescentNeural Information Processing Systems (NeurIPS), 2022
Satyen Kale
Jason D. Lee
Chris De Sa
Ayush Sekhari
Karthik Sridharan
220
5
0
13 Oct 2022
Conformal Mirror Descent with Logarithmic Divergences
Conformal Mirror Descent with Logarithmic DivergencesInformation Geometry (IG), 2022
Amanjit Kainth
Ting-Kam Leonard Wong
Frank Rudzicz
215
5
0
07 Sep 2022
Implicit Bias of Gradient Descent on Reparametrized Models: On
  Equivalence to Mirror Descent
Implicit Bias of Gradient Descent on Reparametrized Models: On Equivalence to Mirror DescentNeural Information Processing Systems (NeurIPS), 2022
Zhiyuan Li
Tianhao Wang
Jason D. Lee
Sanjeev Arora
368
37
0
08 Jul 2022
Non-convex online learning via algorithmic equivalence
Non-convex online learning via algorithmic equivalenceNeural Information Processing Systems (NeurIPS), 2022
Udaya Ghai
Zhou Lu
Elad Hazan
294
14
0
30 May 2022
Smooth over-parameterized solvers for non-smooth structured optimization
Smooth over-parameterized solvers for non-smooth structured optimizationMathematical programming (Math. Program.), 2022
C. Poon
Gabriel Peyré
333
23
0
03 May 2022
More is Less: Inducing Sparsity via Overparameterization
More is Less: Inducing Sparsity via OverparameterizationInformation and Inference A Journal of the IMA (JIII), 2021
H. Chou
J. Maly
Holger Rauhut
575
31
0
21 Dec 2021
Approximate Newton policy gradient algorithms
Approximate Newton policy gradient algorithms
Haoya Li
Samarth Gupta
Hsiangfu Yu
Lexing Ying
Inderjit Dhillon
483
4
0
05 Oct 2021
Finite Sample Analysis of Two-Time-Scale Natural Actor-Critic Algorithm
Finite Sample Analysis of Two-Time-Scale Natural Actor-Critic AlgorithmIEEE Transactions on Automatic Control (IEEE TAC), 2021
S. Khodadadian
Thinh T. Doan
Justin Romberg
S. T. Maguluri
383
51
0
26 Jan 2021
Efficient constrained sampling via the mirror-Langevin algorithm
Efficient constrained sampling via the mirror-Langevin algorithmNeural Information Processing Systems (NeurIPS), 2020
Kwangjun Ahn
Sinho Chewi
443
64
0
30 Oct 2020
The role of optimization geometry in single neuron learning
The role of optimization geometry in single neuron learning
Nicholas M. Boffi
Stephen Tu
Jean-Jacques E. Slotine
218
1
0
15 Jun 2020
1
Page 1 of 1