Cover Image

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Barakat, Anas, Kontogiannis, Andreas, Pollatos, Vasilis, Panageas, Ioannis, Varvitsiotis, Antonios
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient Swap Regret Minimization in Combinatorial Bandits
by: Kontogiannis, Andreas, et al.
Published: (2026)

Convex Markov Games and Beyond: New Proof of Existence, Characterization and Learning Algorithms for Nash Equilibria
by: Barakat, Anas, et al.
Published: (2026)

Optimistic Online Learning in Symmetric Cone Games
by: Barakat, Anas, et al.
Published: (2025)

Online Multi-Agent Control with Adversarial Disturbances
by: Barakat, Anas, et al.
Published: (2025)

The Computational Complexity of Avoiding Strict Saddle Points in Constrained Optimization
by: Kontogiannis, Andreas, et al.
Published: (2026)

Non-Stationary Bandit Convex Optimization: An Optimal Algorithm with Two-Point Feedback
by: He, Chang, et al.
Published: (2025)

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
by: Ba, Wenjia, et al.
Published: (2021)

Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret
by: Hua, Youqing, et al.
Published: (2024)

The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization
by: Daskalakis, Constantinos, et al.
Published: (2018)

Efficient Kernelized Learning in Polyhedral Games Beyond Full-Information: From Colonel Blotto to Congestion Games
by: Kontogiannis, Andreas, et al.
Published: (2025)

First-order methods almost always avoid saddle points: the case of vanishing step-sizes
by: Panageas, Ioannis, et al.
Published: (2019)

Data-Scarce Identification of Game Dynamics via Sum-of-Squares Optimization
by: Sakos, Iosif, et al.
Published: (2023)

Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications
by: Liu, Zijian
Published: (2025)

Distributional Robustness in Output Feedback Regret-Optimal Control
by: Yan, Shuhao, et al.
Published: (2025)

Convergence of Regret Matching in Potential Games and Constrained Optimization
by: Anagnostides, Ioannis, et al.
Published: (2025)

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

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

Asymmetric Feedback Learning in Online Convex Games
by: Wang, Zifan, et al.
Published: (2023)

Improved Dynamic Regret of Distributed Online Multiple Frank-Wolfe Convex Optimization
by: Zhang, Wentao, et al.
Published: (2023)

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

Online Newton Method for Bandit Convex Optimisation
by: Fokkema, Hidde, et al.
Published: (2024)

An Online Algorithm for Solving Feedback Optimal Control Problems with Partial Observations
by: Liang, Siming, et al.
Published: (2024)

Certifying Concavity and Monotonicity in Games via Sum-of-Squares Hierarchies
by: Leon, Vincent, et al.
Published: (2025)

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
by: Daskalakis, Constantinos, et al.
Published: (2018)

Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
by: Tran-The, Hung, et al.
Published: (2022)

Adaptivity and Universality: Problem-dependent Universal Regret for Online Convex Optimization
by: Zhao, Peng, et al.
Published: (2025)

The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings
by: Hou, Jiaxin, et al.
Published: (2023)

Online Mixed Discrete and Continuous Optimization: Algorithms, Regret Analysis and Applications
by: Ye, Lintao, et al.
Published: (2023)

Hidden Convexity in Active Learning: A Convexified Online Input Design for ARX Systems
by: Chatzikiriakos, Nicolas, et al.
Published: (2025)

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

Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps
by: Zhang, Wentao, et al.
Published: (2025)

An Optimal Control Interpretation of Augmented Distributed Optimization Algorithms
by: Hallinan, Liam, et al.
Published: (2025)

Convex Co-Design of Control Barrier Function and Safe Feedback Controller Under Input Constraints
by: Wang, Han, et al.
Published: (2024)

Robust Regret Optimal Control
by: Liu, Jietian, et al.
Published: (2023)

Bandit Convex Optimisation
by: Lattimore, Tor
Published: (2024)

Optimal $\mathbb{H}_2$ Control with Passivity-Constrained Feedback: Convex Approach
by: Scruggs, J. T.
Published: (2025)

Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives
by: Sahinoglu, Emre, et al.
Published: (2025)

Safe Online Convex Optimization with Multi-Point Feedback
by: Hutchinson, Spencer, et al.
Published: (2024)

An Equivalence Between Static and Dynamic Regret Minimization
by: Jacobsen, Andrew, et al.
Published: (2024)

Optimal Voltage Control Using Online Exponential Barrier Method
by: Zhang, Peng, et al.
Published: (2025)