Cover Image

Single-loop Algorithms for Stochastic Non-convex Optimization with Weakly-Convex Constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yang, Ming, Li, Gang, Hu, Quanqi, Lin, Qihang, Yang, Tianbao
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Single-Loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions
by: Hu, Quanqi, et al.
Published: (2024)

Non-Smooth Weakly-Convex Finite-sum Coupled Compositional Optimization
by: Hu, Quanqi, et al.
Published: (2023)

Stochastic Momentum Methods for Non-smooth Non-Convex Finite-Sum Coupled Compositional Optimization
by: Chen, Xingyu, et al.
Published: (2025)

Provable Optimization for Adversarial Fair Self-supervised Contrastive Learning
by: Qi, Qi, et al.
Published: (2024)

Learning to Rank with Top-$K$ Fairness
by: Zhang, Boyang, et al.
Published: (2025)

A Near-Optimal Single-Loop Stochastic Algorithm for Convex Finite-Sum Coupled Compositional Optimization
by: Wang, Bokun, et al.
Published: (2023)

Multi-Output Distributional Fairness via Post-Processing
by: Li, Gang, et al.
Published: (2024)

DRPO: Efficient Reasoning via Decoupled Reward Policy Optimization
by: Li, Gang, et al.
Published: (2025)

Inexact Moreau Envelope Lagrangian Method for Non-Convex Constrained Optimization under Local Error Bound Conditions on Constraint Functions
by: Huang, Yankun, et al.
Published: (2025)

Deterministic and Stochastic Accelerated Gradient Method for Convex Semi-Infinite Optimization
by: Yao, Yao, et al.
Published: (2023)

DisCO: Reinforcing Large Reasoning Models with Discriminative Constrained Optimization
by: Li, Gang, et al.
Published: (2025)

A Note on Complexity for Two Classes of Structured Non-Smooth Non-Convex Compositional Optimization
by: Yao, Yao, et al.
Published: (2024)

Convergence Analysis of the PAGE Stochastic Algorithm for Weakly Convex Finite-Sum Optimization
by: Condat, Laurent, et al.
Published: (2025)

Enforcing Fair Predicted Scores on Intervals of Percentiles by Difference-of-Convex Constraints
by: He, Yutian, et al.
Published: (2025)

Online Non-convex Optimization with Long-term Non-convex Constraints
by: Pan, Shijie, et al.
Published: (2023)

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

Universal Online Convex Optimization Meets Second-order Bounds
by: Zhang, Lijun, et al.
Published: (2021)

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

Federated Distributionally Robust Optimization with Non-Convex Objectives: Algorithm and Analysis
by: Jiao, Yang, et al.
Published: (2023)

A Retention-Centric Framework for Continual Learning with Guaranteed Model Developmental Safety
by: Li, Gang, et al.
Published: (2024)

Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sarkar, Dhruv, et al.
Published: (2025)

Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sarkar, Dhruv, et al.
Published: (2025)

Stochastic Approximation Approaches to Group Distributionally Robust Optimization and Beyond
by: Zhang, Lijun, et al.
Published: (2023)

Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion
by: Cutkosky, Ashok, et al.
Published: (2023)

DRTriton: Large-Scale Synthetic Data Driven Reinforcement Learning for Triton Kernel Generation
by: Guo, Siqi, et al.
Published: (2026)

A Saddle Point Remedy: Power of Variable Elimination in Non-convex Optimization
by: Gan, Min, et al.
Published: (2025)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2023)

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
by: Lekeufack, Jordan, et al.
Published: (2024)

UAdam: Unified Adam-Type Algorithmic Framework for Non-Convex Stochastic Optimization
by: Jiang, Yiming, et al.
Published: (2023)

More Optimal Fractional-Order Stochastic Gradient Descent for Non-Convex Optimization Problems
by: Partohaghighi, Mohammad, et al.
Published: (2025)

Decentralized Non-convex Stochastic Optimization with Heterogeneous Variance
by: Chen, Hongxu, et al.
Published: (2026)

Non-convex Stochastic Composite Optimization with Polyak Momentum
by: Gao, Yuan, et al.
Published: (2024)

Memory-Efficient Continual Learning with CLIP Models
by: King, Ryan, et al.
Published: (2026)

Online Non-Stationary Stochastic Quasar-Convex Optimization
by: Pun, Yuen-Man, et al.
Published: (2024)

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

Large-Scale Non-convex Stochastic Constrained Distributionally Robust Optimization
by: Zhang, Qi, et al.
Published: (2024)

Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness
by: Crawshaw, Michael, et al.
Published: (2025)

Retraction-Free Decentralized Non-convex Optimization with Orthogonal Constraints
by: Sun, Youbang, et al.
Published: (2024)

Bayesian Optimization for Non-Convex Two-Stage Stochastic Optimization Problems
by: Buckingham, Jack M., et al.
Published: (2024)

Single Point-Based Distributed Zeroth-Order Optimization with a Non-Convex Stochastic Objective Function
by: Mhanna, Elissa, et al.
Published: (2024)