Cover Image

Long-time dynamics and universality of nonconvex gradient descent

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Han, Qiyang
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Information Theory Optimization and Control Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Gradient descent inference in empirical risk minimization
by: Han, Qiyang, et al.
Published: (2024)

Precise gradient descent training dynamics for finite-width multi-layer neural networks
by: Han, Qiyang, et al.
Published: (2025)

Optimal transport natural gradient for statistical manifolds with continuous sample space
by: Chen, Yifan, et al.
Published: (2018)

Convergence of flow-based generative models via proximal gradient descent in Wasserstein space
by: Cheng, Xiuyuan, et al.
Published: (2023)

Fast Spawn\&Prune (FS\&P): Global convergence of stochastic conic particle gradient descent via birth/death process
by: De Castro, Yohann, et al.
Published: (2026)

Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequality
by: Wibisono, Andre
Published: (2025)

High-probability sample complexities for policy evaluation with linear function approximation
by: Li, Gen, et al.
Published: (2023)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
by: Li, Gen, et al.
Published: (2021)

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
by: Li, Gen, et al.
Published: (2020)

Thompson sampling: Precise arm-pull dynamics and adaptive inference
by: Han, Qiyang
Published: (2026)

Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity
by: Stöger, Dominik, et al.
Published: (2024)

Ensemble-Conditional Gaussian Processes (Ens-CGP): Representation, Geometry, and Inference
by: Ravela, Sai, et al.
Published: (2026)

Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling
by: Vukovic, Manojlo, et al.
Published: (2026)

Quickest Change Detection with Confusing Change
by: Chen, Yu-Zhen Janice, et al.
Published: (2024)

The Local Landscape of Phase Retrieval Under Limited Samples
by: Liu, Kaizhao, et al.
Published: (2023)

Joint learning of a network of linear dynamical systems via total variation penalization
by: Donnat, Claire, et al.
Published: (2025)

Entrywise dynamics and universality of general first order methods
by: Han, Qiyang
Published: (2024)

Learning an Optimal Assortment Policy under Observational Data
by: Han, Yuxuan, et al.
Published: (2025)

Robust Assortment Optimization from Observational Data
by: Lu, Miao, et al.
Published: (2026)

Inferring Dynamic Networks from Marginals with Iterative Proportional Fitting
by: Chang, Serina, et al.
Published: (2024)

Continuous-time reinforcement learning: ellipticity enables model-free value function approximation
by: Mou, Wenlong
Published: (2026)

Sharp recovery and landscape guarantees for the nonconvex matrix LASSO
by: McRae, Andrew D., et al.
Published: (2026)

Learning linear dynamical systems under convex constraints
by: Tyagi, Hemant, et al.
Published: (2023)

Mean-field underdamped Langevin dynamics and its spacetime discretization
by: Fu, Qiang, et al.
Published: (2023)

Phase retrieval and matrix sensing via benign and overparametrized nonconvex optimization
by: McRae, Andrew D.
Published: (2025)

Phase retrieval via overparametrized nonconvex optimization: nonsmooth amplitude loss landscapes
by: McRae, Andrew D.
Published: (2025)

RandALO: Out-of-sample risk estimation in no time flat
by: Nobel, Parth, et al.
Published: (2024)

Statistical guarantees for continuous-time policy evaluation: blessing of ellipticity and new tradeoffs
by: Mou, Wenlong
Published: (2025)

Theory and applications of the Sum-Of-Squares technique
by: Bach, Francis, et al.
Published: (2023)

Uncertainty Quantification of Spectral Estimator and MLE for Orthogonal Group Synchronization
by: Zhong, Ziliang Samuel, et al.
Published: (2024)

On the Exactness of SDP Relaxation for Quadratic Assignment Problem
by: Ling, Shuyang
Published: (2024)

UCB algorithms for multi-armed bandits: Precise regret and adaptive inference
by: Han, Qiyang, et al.
Published: (2024)

Stochastic Optimization with Optimal Importance Sampling
by: Aolaritei, Liviu, et al.
Published: (2025)

A review of NMF, PLSA, LBA, EMA, and LCA with a focus on the identifiability issue
by: Qi, Qianqian, et al.
Published: (2025)

Error Analysis of Triangular Optimal Transport Maps for Filtering
by: Al-Jarrah, Mohammad, et al.
Published: (2025)

Online Inference of Constrained Optimization: Primal-Dual Optimality and Sequential Quadratic Programming
by: Gao, Yihang, et al.
Published: (2025)

Mixing Times and Privacy Analysis for the Projected Langevin Algorithm under a Modulus of Continuity
by: Bravo, Mario, et al.
Published: (2025)

Extreme mass distributions for quasi-copulas
by: Omladič, Matjaž, et al.
Published: (2025)

An Elementary Proof of the Near Optimality of LogSumExp Smoothing
by: Samakhoana, Thabo, et al.
Published: (2025)

Iteratively reweighted kernel machines efficiently learn sparse functions
by: Zhu, Libin, et al.
Published: (2025)