Cover Image

A Homogenization Approach for Gradient-Dominated Stochastic Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tan, Jiyuan, Xue, Chenyu, Zhang, Chuwen, Deng, Qi, Ge, Dongdong, Ye, Yinyu
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Homogeneous Second-Order Descent Method for Nonconvex Optimization
by: Zhang, Chuwen, et al.
Published: (2022)

Trust Region Methods For Nonconvex Stochastic Optimization Beyond Lipschitz Smoothness
by: Xie, Chenghan, et al.
Published: (2023)

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)

Homogeneous Second-Order Descent Framework: A Fast Alternative to Newton-Type Methods
by: He, Chang, et al.
Published: (2023)

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

A Single-Loop Robust Policy Gradient Method for Robust Markov Decision Processes
by: Lin, Zhenwei, et al.
Published: (2024)

An Enhanced ADMM-based Interior Point Method for Linear and Conic Optimization
by: Deng, Qi, et al.
Published: (2022)

Beyond Nonconvexity: A Universal Trust-Region Method with New Analyses
by: Jiang, Yuntian, et al.
Published: (2023)

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)

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

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

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

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

Riemannian Stochastic Gradient Method for Nested Composition Optimization
by: Zhang, Dewei, et al.
Published: (2022)

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

cuPDLP-C: A Strengthened Implementation of cuPDLP for Linear Programming by C language
by: Lu, Haihao, et al.
Published: (2023)

On the Gradient Domination of the LQG Problem
by: Fallah, Kasra, et al.
Published: (2025)

Faster Gradient Methods for Highly-Smooth Stochastic Bilevel Optimization
by: Chen, Lesi, et al.
Published: (2025)

A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems
by: Curtis, Frank E., et al.
Published: (2023)

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

Accelerating Trust-Region Methods: An Attempt to Balance Global and Local Efficiency
by: Jiang, Yuntian, et al.
Published: (2025)

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

Rapid Overfitting of Multi-Pass Stochastic Gradient Descent in Stochastic Convex Optimization
by: Vansover-Hager, Shira, et al.
Published: (2025)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
by: Livni, Roi
Published: (2024)

Stochastic Non-Smooth Convex Optimization with Unbounded Gradients
by: Kovalev, Dmitry
Published: (2026)

Stochastic Constrained Decentralized Optimization for Machine Learning with Fewer Data Oracles: a Gradient Sliding Approach
by: Nguyen, Hoang Huy, et al.
Published: (2024)

Diffusion Model for Data-Driven Black-Box Optimization
by: Li, Zihao, et al.
Published: (2024)

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

Cardinal Optimizer (COPT) User Guide
by: Ge, Dongdong, et al.
Published: (2022)

Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
by: Chen, Lesi, et al.
Published: (2023)

Compressed Decentralized Momentum Stochastic Gradient Methods for Nonconvex Optimization
by: Liu, Wei, et al.
Published: (2025)

A Mean-Field Analysis of Neural Stochastic Gradient Descent-Ascent for Functional Minimax Optimization
by: Zhu, Yuchen, et al.
Published: (2024)

From Soliloquy to Agora: Memory-Enhanced LLM Agents with Decentralized Debate for Optimization Modeling
by: Lin, Jianghao, et al.
Published: (2026)

Large Stepsize Gradient Descent for Non-Homogeneous Two-Layer Networks: Margin Improvement and Fast Optimization
by: Cai, Yuhang, et al.
Published: (2024)

Restarted Primal-Dual Hybrid Conjugate Gradient Method for Large-Scale Quadratic Programming
by: Huang, Yicheng, et al.
Published: (2024)

Gradient-Free Approaches is a Key to an Efficient Interaction with Markovian Stochasticity
by: Prokhorov, Boris, et al.
Published: (2026)

A Low-Rank ADMM Splitting Approach for Semidefinite Programming
by: Han, Qiushi, et al.
Published: (2024)

Adaptive Gradient Normalization and Independent Sampling for (Stochastic) Generalized-Smooth Optimization
by: Yang, Yufeng, et al.
Published: (2024)