Copertina

Online Non-convex Optimization with Long-term Non-convex Constraints

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Pan, Shijie, Xu, Jianyu, Huang, Wenjie
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Optimization and Control Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

Random Scaling and Momentum for Non-smooth Non-convex Optimization
di: Zhang, Qinzi, et al.
Pubblicazione: (2024)

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

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

A Stochastic Quasi-Newton Method for Non-convex Optimization with Non-uniform Smoothness
di: Sun, Zhenyu, et al.
Pubblicazione: (2024)

Non-geodesically-convex optimization in the Wasserstein space
di: Luu, Hoang Phuc Hau, et al.
Pubblicazione: (2024)

Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees
di: Smith, Chandler, et al.
Pubblicazione: (2024)

Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance
di: Zhang, Qi, et al.
Pubblicazione: (2024)

Convergence of Adam for Non-convex Objectives: Relaxed Hyperparameters and Non-ergodic Case
di: He, Meixuan, et al.
Pubblicazione: (2023)

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

Non-convex entropic mean-field optimization via Best Response flow
di: Lascu, Razvan-Andrei, et al.
Pubblicazione: (2025)

Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints
di: Sarkar, Dhruv, et al.
Pubblicazione: (2025)

Convex and Non-convex Federated Learning with Stale Stochastic Gradients: Diminishing Step Size is All You Need
di: Zheng, Xinran, et al.
Pubblicazione: (2026)

Tightening convex relaxations of trained neural networks: a unified approach for convex and S-shaped activations
di: Carrasco, Pablo, et al.
Pubblicazione: (2024)

Online Optimization for Randomized Network Resource Allocation with Long-Term Constraints
di: Sid-Ali, Ahmed, et al.
Pubblicazione: (2023)

Distributed Online Convex Optimization with Nonseparable Costs and Constraints
di: Pan, Zhaoye, et al.
Pubblicazione: (2026)

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

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

Progressive Power Homotopy for Non-convex Optimization
di: Xu, Chen
Pubblicazione: (2026)

Nesterov acceleration in benignly non-convex landscapes
di: Gupta, Kanan, et al.
Pubblicazione: (2024)

Learning based convex approximation for constrained parametric optimization
di: Liu, Kang, et al.
Pubblicazione: (2025)

A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization
di: Meng, Qing-xin, et al.
Pubblicazione: (2025)

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

One-Point Residual Feedback Algorithms for Distributed Online Convex and Non-convex Optimization
di: Wang, Yaowen, et al.
Pubblicazione: (2025)

On Constraints in First-Order Optimization: A View from Non-Smooth Dynamical Systems
di: Muehlebach, Michael, et al.
Pubblicazione: (2021)

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

A simple and improved algorithm for noisy, convex, zeroth-order optimisation
di: Carpentier, Alexandra
Pubblicazione: (2024)

Reinforcement learning for adaptive interior point methods in convex quadratic programming
di: Bertoncini, Jeremy, et al.
Pubblicazione: (2025)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
di: Sinha, Abhishek, et al.
Pubblicazione: (2024)

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

Tight Long-Term Tail Decay of (Clipped) SGD in Non-Convex Optimization
di: Armacki, Aleksandar, et al.
Pubblicazione: (2026)

Beyond $\tilde{O}(\sqrt{T})$ Constraint Violation for Online Convex Optimization with Adversarial Constraints
di: Sinha, Abhishek, et al.
Pubblicazione: (2025)

Quantum Algorithms for Non-smooth Non-convex Optimization
di: Liu, Chengchang, et al.
Pubblicazione: (2024)

Convergence Analysis of EXTRA in Non-convex Distributed Optimization
di: Qin, Lei, et al.
Pubblicazione: (2025)

Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity
di: Stöger, Dominik, et al.
Pubblicazione: (2024)

A simple uniformly optimal method without line search for convex optimization
di: Li, Tianjiao, et al.
Pubblicazione: (2023)

Projection-Free Online Convex Optimization with Time-Varying Constraints
di: Garber, Dan, et al.
Pubblicazione: (2024)

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

Online Resource Allocation with Non-Stationary Customers
di: Zhang, Xiaoyue, et al.
Pubblicazione: (2024)