:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Zhu, Bryan, Chen, Ziang
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control Machine Learning
Online Access:	https://arxiv.org/abs/2602.00437
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Theoretical and Empirical Study on the Convergence of Adam with an "Exact" Constant Step Size in Non-Convex Settings
by: Mazumder, Alokendu, et al.
Published: (2023)

Specifying and Solving Robust Empirical Risk Minimization Problems Using CVXPY
by: Luxenberg, Eric, et al.
Published: (2023)

Using Taylor-Approximated Gradients to Improve the Frank-Wolfe Method for Empirical Risk Minimization
by: Xiong, Zikai, et al.
Published: (2022)

Empirical Risk Minimization with Shuffled SGD: A Primal-Dual Perspective and Improved Bounds
by: Cai, Xufeng, et al.
Published: (2023)

A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization
by: Dagréou, Mathieu, et al.
Published: (2023)

Muon Converges under Heavy-Tailed Noise: Nonconvex Hölder-Smooth Empirical Risk Minimization
by: Iiduka, Hideaki
Published: (2026)

Compressed Proximal Federated Learning for Non-Convex Composite Optimization on Heterogeneous Data
by: Qiu, Pu, et al.
Published: (2026)

Convergence Analysis of the Wasserstein Proximal Algorithm beyond Geodesic Convexity
by: Zhu, Shuailong, et al.
Published: (2025)

Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance
by: Fazla, Arda, et al.
Published: (2026)

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
by: Huang, Minhui, et al.
Published: (2021)

Clipped Gradient Methods for Nonsmooth Convex Optimization under Heavy-Tailed Noise: A Refined Analysis
by: Liu, Zijian
Published: (2025)

A Randomized Linearly Convergent Frank-Wolfe-type Method for Smooth Convex Minimization over the Spectrahedron
by: Garber, Dan
Published: (2025)

Are Convex Optimization Curves Convex?
by: Barzilai, Guy, et al.
Published: (2025)

SOREL: A Stochastic Algorithm for Spectral Risks Minimization
by: Ge, Yuze, et al.
Published: (2024)

Parametric Nonconvex Optimization via Convex Surrogates
by: Wang, Renzi, et al.
Published: (2026)

Expressive Power of Graph Neural Networks for (Mixed-Integer) Quadratic Programs
by: Chen, Ziang, et al.
Published: (2024)

Rethinking the Capacity of Graph Neural Networks for Branching Strategy
by: Chen, Ziang, et al.
Published: (2024)

Online (Non-)Convex Learning via Tempered Optimism
by: Haddouche, Maxime, et al.
Published: (2023)

Stochastic Weakly Convex Optimization Under Heavy-Tailed Noises
by: Zhu, Tianxi, et al.
Published: (2025)

Solving Sparse \& High-Dimensional-Output Regression via Compression
by: Li, Renyuan, et al.
Published: (2024)

RedEx: Beyond Fixed Representation Methods via Convex Optimization
by: Daniely, Amit, et al.
Published: (2024)

An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling
by: Yang, Linxin, et al.
Published: (2024)

Bandit Convex Optimisation
by: Lattimore, Tor
Published: (2024)

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints
by: Dahal, Hari, et al.
Published: (2023)

Global Optimization via Softmin Energy Minimization
by: Agazzi, Andrea, et al.
Published: (2025)

Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints
by: Hutchinson, Spencer, et al.
Published: (2024)

Inclusive KL Minimization: A Wasserstein-Fisher-Rao Gradient Flow Perspective
by: Zhu, Jia-Jie
Published: (2024)

Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems
by: Zhang, Huaqing, et al.
Published: (2024)

Scalable Min-Max Optimization via Primal-Dual Exact Pareto Optimization
by: Park, Sangwoo, et al.
Published: (2025)

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
by: Jia, Tingkai, et al.
Published: (2026)

Natural Geometry of Robust Data Attribution: From Convex Models to Deep Networks
by: Li, Shihao, et al.
Published: (2025)

Sharpness-Aware Minimization Can Hallucinate Minimizers
by: Park, Chanwoong, et al.
Published: (2025)

Stochastic Difference-of-Convex Optimization with Momentum
by: Chayti, El Mahdi, et al.
Published: (2025)

The Price of Adaptivity in Stochastic Convex Optimization
by: Carmon, Yair, et al.
Published: (2024)

Online Convex Optimization with Unbounded Memory
by: Kumar, Raunak, et al.
Published: (2022)

Astral Space: Convex Analysis at Infinity
by: Dudík, Miroslav, et al.
Published: (2022)

Smooth Quasar-Convex Optimization with Constraints
by: Martínez-Rubio, David
Published: (2025)

Unconstrained Robust Online Convex Optimization
by: Zhang, Jiujia, et al.
Published: (2025)

Adversarial Training of Two-Layer Polynomial and ReLU Activation Networks via Convex Optimization
by: Kuelbs, Daniel, et al.
Published: (2024)

A Distance Metric for Mixed Integer Programming Instances
by: Maudet, Gwen, et al.
Published: (2025)