Image de couverture de livre

Online (Non-)Convex Learning via Tempered Optimism

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Haddouche, Maxime, Wintenberger, Olivier, Guedj, Benjamin
Format:	Preprint
Publié:	2023
Sujets:	Machine Learning Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double Optimism
par: Patitucci, Francisco, et autres
Publié: (2025)

Online Non-Stationary Stochastic Quasar-Convex Optimization
par: Pun, Yuen-Man, et autres
Publié: (2024)

Federated Learning with Nonvacuous Generalisation Bounds
par: Jobic, Pierre, et autres
Publié: (2023)

Optimism as Risk-Seeking in Multi-Agent Reinforcement Learning
par: Zhang, Runyu, et autres
Publié: (2025)

Improved Regret Bound for Safe Reinforcement Learning via Tighter Cost Pessimism and Reward Optimism
par: Yu, Kihyun, et autres
Publié: (2024)

A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization
par: Meng, Qing-xin, et autres
Publié: (2025)

Learning-Augmented Decentralized Online Convex Optimization in Networks
par: Li, Pengfei, et autres
Publié: (2023)

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
par: Jia, Tingkai, et autres
Publié: (2026)

Implicit Riemannian Optimism with Applications to Min-Max Problems
par: Roux, Christophe, et autres
Publié: (2025)

Projection-free Online Learning over Strongly Convex Sets
par: Wan, Yuanyu, et autres
Publié: (2020)

Online Convex Optimization with Unbounded Memory
par: Kumar, Raunak, et autres
Publié: (2022)

Unconstrained Robust Online Convex Optimization
par: Zhang, Jiujia, et autres
Publié: (2025)

Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints
par: Sarkar, Dhruv, et autres
Publié: (2025)

Online Submodular Maximization via Online Convex Optimization
par: Salem, Tareq Si, et autres
Publié: (2023)

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
par: Barakat, Anas, et autres
Publié: (2026)

Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets
par: Lu, Yiyang, et autres
Publié: (2026)

Online Newton Method for Bandit Convex Optimisation
par: Fokkema, Hidde, et autres
Publié: (2024)

Online Convex Optimization with Memory and Limited Predictions
par: Wang, Zhengmiao, et autres
Publié: (2024)

Online Convex Optimization with a Separation Oracle
par: Mhammedi, Zakaria
Publié: (2024)

Provable Reduction in Communication Rounds for Non-Smooth Convex Federated Learning
par: Palenzuela, Karlo, et autres
Publié: (2025)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
par: Sinha, Abhishek, et autres
Publié: (2023)

Constrained Online Convex Optimization with Polyak Feasibility Steps
par: Hutchinson, Spencer, et autres
Publié: (2025)

Safe Online Convex Optimization with Multi-Point Feedback
par: Hutchinson, Spencer, et autres
Publié: (2024)

Small Gradient Norm Regret for Online Convex Optimization
par: Gao, Wenzhi, et autres
Publié: (2026)

Distributed Online Convex Optimization with Nonseparable Costs and Constraints
par: Pan, Zhaoye, et autres
Publié: (2026)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
par: Sinha, Abhishek, et autres
Publié: (2024)

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
par: Lekeufack, Jordan, et autres
Publié: (2024)

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization
par: Hihat, Massil, et autres
Publié: (2023)

LyAm: Robust Non-Convex Optimization for Stable Learning in Noisy Environments
par: Mirzabeigi, Elmira, et autres
Publié: (2025)

Compressed Proximal Federated Learning for Non-Convex Composite Optimization on Heterogeneous Data
par: Qiu, Pu, et autres
Publié: (2026)

Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
par: Sachs, Sarah, et autres
Publié: (2023)

Projection-Free Online Convex Optimization with Time-Varying Constraints
par: Garber, Dan, et autres
Publié: (2024)

Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints
par: Hutchinson, Spencer, et autres
Publié: (2024)

Universal Online Convex Optimization with $1$ Projection per Round
par: Yang, Wenhao, et autres
Publié: (2024)

Universal Online Convex Optimization Meets Second-order Bounds
par: Zhang, Lijun, et autres
Publié: (2021)

Optimal Transport with Tempered Exponential Measures
par: Amid, Ehsan, et autres
Publié: (2023)

Tighter Generalisation Bounds via Interpolation
par: Viallard, Paul, et autres
Publié: (2024)

Distributed Online Private Learning of Convex Nondecomposable Objectives
par: Cheng, Huqiang, et autres
Publié: (2022)

Faster Rates for No-Regret Learning in General Games via Cautious Optimism
par: Soleymani, Ashkan, et autres
Publié: (2025)

Optimistic Online Non-stochastic Control via FTRL
par: Mhaisen, Naram, et autres
Publié: (2024)