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. 2201.05101
  4. Cited By
Statistically Optimal First Order Algorithms: A Proof via
  Orthogonalization

Statistically Optimal First Order Algorithms: A Proof via Orthogonalization

13 January 2022
Andrea Montanari
Yuchen Wu
ArXivPDFHTML

Papers citing "Statistically Optimal First Order Algorithms: A Proof via Orthogonalization"

4 / 4 papers shown
Title
Equivalence of Approximate Message Passing and Low-Degree Polynomials in
  Rank-One Matrix Estimation
Equivalence of Approximate Message Passing and Low-Degree Polynomials in Rank-One Matrix Estimation
Andrea Montanari
Alexander S. Wein
22
25
0
14 Dec 2022
Lower Bounds for the Convergence of Tensor Power Iteration on Random Overcomplete Models
Lower Bounds for the Convergence of Tensor Power Iteration on Random Overcomplete Models
Yuchen Wu
Kangjie Zhou
29
6
0
07 Nov 2022
Rigorous dynamical mean field theory for stochastic gradient descent
  methods
Rigorous dynamical mean field theory for stochastic gradient descent methods
Cédric Gerbelot
Emanuele Troiani
Francesca Mignacco
Florent Krzakala
Lenka Zdeborova
40
26
0
12 Oct 2022
Sudakov-Fernique post-AMP, and a new proof of the local convexity of the
  TAP free energy
Sudakov-Fernique post-AMP, and a new proof of the local convexity of the TAP free energy
Michael Celentano
48
20
0
19 Aug 2022
1