:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Olanubi, Valentine, Agar, Phineas, Ames, Brendan
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control Machine Learning
Online Access:	https://arxiv.org/abs/2601.03946
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Deflation-Free Optimal Scoring
by: Afroz, Sharmin, et al.
Published: (2026)

Provable Reduction in Communication Rounds for Non-Smooth Convex Federated Learning
by: Palenzuela, Karlo, et al.
Published: (2025)

LSTM-Based Forecasting and Analysis of EV Charging Demand in a Dense Urban Campus
by: Ressler, Zak, et al.
Published: (2025)

Hidden Convexity of Fair PCA and Fast Solver via Eigenvalue Optimization
by: Shen, Junhui, et al.
Published: (2025)

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

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
by: Barakat, Anas, et al.
Published: (2026)

Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization
by: Borodich, Ekaterina, et al.
Published: (2025)

Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization
by: Jiang, Ruichen, et al.
Published: (2024)

Finding Maximum Determinant Principal Submatrices via Hadamard Bounds and Projection Methods
by: Hu, Hao, et al.
Published: (2025)

Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness
by: Smith, Chandler, et al.
Published: (2025)

Generative Neural Operators of Log-Complexity Can Simultaneously Solve Infinitely Many Convex Programs
by: Kratsios, Anastasis, et al.
Published: (2025)

Disciplined Geodesically Convex Programming
by: Cheng, Andrew, et al.
Published: (2024)

The Computational Complexity of Finding Stationary Points in Non-Convex Optimization
by: Hollender, Alexandros, et al.
Published: (2023)

Solving Dense Linear Systems Faster Than via Preconditioning
by: Dereziński, Michał, et al.
Published: (2023)

Provably Faster Algorithms for Bilevel Optimization via Without-Replacement Sampling
by: Li, Junyi, et al.
Published: (2024)

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

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

A Provably-Correct and Robust Convex Model for Smooth Separable NMF
by: Pan, Junjun, et al.
Published: (2025)

Provably Convergent Federated Trilevel Learning
by: Jiao, Yang, et al.
Published: (2023)

Provably Efficient Exploration in Policy Optimization
by: Cai, Qi, et al.
Published: (2019)

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

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

Muon is Provably Faster with Momentum Variance Reduction
by: Qian, Xun, et al.
Published: (2025)

MGDA Converges under Generalized Smoothness, Provably
by: Zhang, Qi, et al.
Published: (2024)

Provable Mixed-Noise Learning with Flow-Matching
by: Hagemann, Paul, et al.
Published: (2025)

DiscoverDCP: A Data-Driven Approach for Construction of Disciplined Convex Programs via Symbolic Regression
by: Myhre, Sveinung
Published: (2025)

Mathematical Programming Algorithms for Convex Hull Approximation with a Hyperplane Budget
by: Barbato, Michele, et al.
Published: (2024)

On the Provable Suboptimality of Momentum SGD in Nonstationary Stochastic Optimization
by: Sahu, Sharan, et al.
Published: (2026)

Provable Adaptivity of Adam under Non-uniform Smoothness
by: Wang, Bohan, et al.
Published: (2022)

SpectraLDS: Provable Distillation for Linear Dynamical Systems
by: Shah, Devan, et al.
Published: (2025)

Stochastic Compositional Minimax Optimization with Provable Convergence Guarantees
by: Deng, Yuyang, et al.
Published: (2024)

Provably data-driven projection method for quadratic programming
by: Nguyen, Anh Tuan, et al.
Published: (2025)

Provable Exactness for Asymmetric Low-Rank SDP Learning
by: Hu, Enliang
Published: (2018)

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

Provably Faster Gradient Descent via Long Steps
by: Grimmer, Benjamin
Published: (2023)

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

Provably-Stable Neural Network-Based Control of Nonlinear Systems
by: Li, Anran, et al.
Published: (2025)

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

Online Convex Optimization with a Separation Oracle
by: Mhammedi, Zakaria
Published: (2024)

On The Concurrence of Layer-wise Preconditioning Methods and Provable Feature Learning
by: Zhang, Thomas T., et al.
Published: (2025)