:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chu, Ya-Chi, Gao, Wenzhi, Ye, Yinyu, Udell, Madeleine
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Machine Learning
Online Access:	https://arxiv.org/abs/2502.11229
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Gradient Methods with Online Scaling Part II. Practical Aspects
by: Chu, Ya-Chi, et al.
Published: (2025)

Gradient Methods with Online Scaling
by: Gao, Wenzhi, et al.
Published: (2024)

Gradient Methods with Online Scaling Part I. Theoretical Foundations
by: Gao, Wenzhi, et al.
Published: (2025)

Small Gradient Norm Regret for Online Convex Optimization
by: Gao, Wenzhi, et al.
Published: (2026)

When Does Primal Interior Point Method Beat Primal-dual in Linear Optimization?
by: Gao, Wenzhi, et al.
Published: (2024)

Scalable Approximate Optimal Diagonal Preconditioning
by: Gao, Wenzhi, et al.
Published: (2023)

Wait-Less Offline Tuning and Re-solving for Online Decision Making
by: Sun, Jingruo, et al.
Published: (2024)

Beyond $\mathcal{O}(\sqrt{T})$ Regret: Decoupling Learning and Decision-making in Online Linear Programming
by: Gao, Wenzhi, et al.
Published: (2025)

Decoupling Learning and Decision-Making: Breaking the $\mathcal{O}(\sqrt{T})$ Barrier in Online Resource Allocation with First-Order Methods
by: Gao, Wenzhi, et al.
Published: (2024)

Natural Hypergradient Descent: Algorithm Design, Convergence Analysis, and Parallel Implementation
by: Kong, Deyi, et al.
Published: (2026)

Data-driven Mixed Integer Optimization through Probabilistic Multi-variable Branching
by: Chen, Yanguang, et al.
Published: (2023)

SketchySGD: Reliable Stochastic Optimization via Randomized Curvature Estimates
by: Frangella, Zachary, et al.
Published: (2022)

PROMISE: Preconditioned Stochastic Optimization Methods by Incorporating Scalable Curvature Estimates
by: Frangella, Zachary, et al.
Published: (2023)

Online Linear Programming with Batching
by: Xu, Haoran, et al.
Published: (2024)

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

Challenges in Training PINNs: A Loss Landscape Perspective
by: Rathore, Pratik, et al.
Published: (2024)

Solving Linear Programs with Fast Online Learning Algorithms
by: Gao, Wenzhi, et al.
Published: (2021)

Achieving Instance-dependent Sample Complexity for Constrained Markov Decision Process
by: Jiang, Jiashuo, et al.
Published: (2024)

Efficient Curvature-Aware Hypergradient Approximation for Bilevel Optimization
by: Dong, Youran, et al.
Published: (2025)

Understanding Fixed Predictions via Confined Regions
by: Lawless, Connor, et al.
Published: (2025)

Turbocharging Gaussian Process Inference with Approximate Sketch-and-Project
by: Rathore, Pratik, et al.
Published: (2025)

New Results on the Polyak Stepsize: Tight Convergence Analysis and Universal Function Classes
by: He, Chang, et al.
Published: (2025)

Online Learning-guided Learning Rate Adaptation via Gradient Alignment
by: Jiang, Ruichen, et al.
Published: (2025)

Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive Enhancements
by: Jalota, Devansh, et al.
Published: (2022)

Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity
by: Gao, Wenzhi, et al.
Published: (2024)

Multi-head Transformers Provably Learn Symbolic Multi-step Reasoning via Gradient Descent
by: Yang, Tong, et al.
Published: (2025)

Armijo Line-search Can Make (Stochastic) Gradient Descent Provably Faster
by: Vaswani, Sharan, et al.
Published: (2025)

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

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

Adaptively Robust LLM Inference Optimization under Prediction Uncertainty
by: Chen, Zixi, et al.
Published: (2025)

LLM Serving Optimization with Variable Prefill and Decode Lengths
by: Wang, Meixuan, et al.
Published: (2025)

Online Learning of Kalman Filtering: From Output to State Estimation
by: Ye, Lintao, et al.
Published: (2026)

Increasing Both Batch Size and Learning Rate Accelerates Stochastic Gradient Descent
by: Umeda, Hikaru, et al.
Published: (2024)

AutoGD: Automatic Learning Rate Selection for Gradient Descent
by: Surjanovic, Nikola, et al.
Published: (2025)

Algebraic characterization of equivalence between oracle-based iterative algorithms
by: Lessard, Laurent, et al.
Published: (2025)

Randomized Nyström Preconditioned Interior Point-Proximal Method of Multipliers
by: Chu, Ya-Chi, et al.
Published: (2024)

Open Problem: Anytime Convergence Rate of Gradient Descent
by: Kornowski, Guy, et al.
Published: (2024)

AutoSGD: Automatic Learning Rate Selection for Stochastic Gradient Descent
by: Surjanovic, Nikola, et al.
Published: (2025)

Agentic Transformers Provably Learn to Search via Reinforcement Learning
by: Yang, Tong, et al.
Published: (2026)

On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
by: Lin, Tianyi, et al.
Published: (2019)