:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Xu, Yewei, Li, Qin
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Optimization and Control
Online Access:	https://arxiv.org/abs/2604.01606
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Forward-Euler time-discretization for Wasserstein gradient flows can be wrong
by: Xu, Yewei, et al.
Published: (2024)

Mirror and Preconditioned Gradient Descent in Wasserstein Space
by: Bonet, Clément, et al.
Published: (2024)

Differentially Private Random Block Coordinate Descent
by: Maranjyan, Artavazd, et al.
Published: (2024)

Random Function Descent
by: Benning, Felix, et al.
Published: (2023)

Sliced Wasserstein Steering between Gaussian Measures
by: Ito, Kaito, et al.
Published: (2026)

Forward Euler for Wasserstein Gradient Flows: Breakdown and Regularization
by: Xu, Yewei, et al.
Published: (2025)

Mirror Descent on Reproducing Kernel Banach Spaces
by: Kumar, Akash, et al.
Published: (2024)

Quantum Natural Stochastic Pairwise Coordinate Descent
by: Sohail, Mohammad Aamir, et al.
Published: (2024)

Stochastic Inverse Problem: stability, regularization and Wasserstein gradient flow
by: Li, Qin, et al.
Published: (2024)

Asynchronous Decentralized SGD under Non-Convexity: A Block-Coordinate Descent Framework
by: Zhou, Yijie, et al.
Published: (2025)

On the Convergence of Gradient Descent on Learning Transformers with Residual Connections
by: Qin, Zhen, et al.
Published: (2025)

Hamiltonian Descent Algorithms for Optimization: Accelerated Rates via Randomized Integration Time
by: Fu, Qiang, et al.
Published: (2025)

A Local Polyak-Lojasiewicz and Descent Lemma of Gradient Descent For Overparametrized Linear Models
by: Xu, Ziqing, et al.
Published: (2025)

Flowing Datasets with Wasserstein over Wasserstein Gradient Flows
by: Bonet, Clément, et al.
Published: (2025)

FastPart: Over-Parameterized Stochastic Gradient Descent for Sparse optimisation on Measures
by: De Castro, Yohann, et al.
Published: (2023)

Stochastic Adaptive Gradient Descent Without Descent
by: Aujol, Jean-François, et al.
Published: (2025)

Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spaces
by: Zhu, Linglingzhi, et al.
Published: (2024)

Learning Provably Improves the Convergence of Gradient Descent
by: Song, Qingyu, et al.
Published: (2025)

A Mirror Descent Perspective of Smoothed Sign Descent
by: Wang, Shuyang, et al.
Published: (2024)

Wasserstein Contraction of Coordinate Ascent Variational Inference
by: Caprio, Rocco, et al.
Published: (2026)

From Saddle Points Toward Global Minima: A Newton-Type Method on Wasserstein Space
by: Lascu, Razvan-Andrei, et al.
Published: (2026)

A New Convergence Analysis of Plug-and-Play Proximal Gradient Descent Under Prior Mismatch
by: Xu, Guixian, et al.
Published: (2026)

Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems
by: Tran-Dinh, Quoc, et al.
Published: (2023)

Convergence of Spectral Descent for Non-smooth Optimization
by: Yang, Yixuan, et al.
Published: (2026)

The Method of Infinite Descent
by: Batley, Reza T., et al.
Published: (2025)

Corner Gradient Descent
by: Yarotsky, Dmitry
Published: (2025)

Asynchronous Distributed Reinforcement Learning for LQR Control via Zeroth-Order Block Coordinate Descent
by: Jing, Gangshan, et al.
Published: (2021)

Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent
by: Liu, Zhiyu, et al.
Published: (2025)

Efficient Trajectory Inference in Wasserstein Space Using Consecutive Averaging
by: Banerjee, Amartya, et al.
Published: (2024)

A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints
by: Yuan, Ganzhao
Published: (2023)

On Generalization and Regularization via Wasserstein Distributionally Robust Optimization
by: Wu, Qinyu, et al.
Published: (2022)

Zeroth-Order Stochastic Mirror Descent Algorithms for Minimax Excess Risk Optimization
by: Gu, Zhihao, et al.
Published: (2024)

Convergence of Implicit Gradient Descent for Training Two-Layer Physics-Informed Neural Networks
by: Xu, Xianliang, et al.
Published: (2024)

Anytime Acceleration of Gradient Descent
by: Zhang, Zihan, et al.
Published: (2024)

On the Convergence of Policy Mirror Descent with Temporal Difference Evaluation
by: Liu, Jiacai, et al.
Published: (2025)

Mirror Descent on Riemannian Manifolds
by: Jiang, Jiaxin, et al.
Published: (2026)

Adaptive Conditional Gradient Descent
by: Khademi, Abbas, et al.
Published: (2025)

Parameter-free Mirror Descent
by: Jacobsen, Andrew, et al.
Published: (2022)

Faster Acceleration for Steepest Descent
by: Bai, Cedar Site, et al.
Published: (2024)

$k$-SVD with Gradient Descent
by: Jedra, Yassir, et al.
Published: (2025)