:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Barakat, Anas, Kontogiannis, Andreas, Pollatos, Vasilis, Panageas, Ioannis, Varvitsiotis, Antonios
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Machine Learning Optimization and Control
Accesso online:	https://arxiv.org/abs/2605.26373
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Bandit Convex Optimisation
di: Lattimore, Tor
Pubblicazione: (2024)

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

Robust Regret Optimal Control
di: Liu, Jietian, et al.
Pubblicazione: (2023)

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

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

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

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

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

A Primal-Dual Framework for Symmetric Cone Programming
di: Zheng, Jiaqi, et al.
Pubblicazione: (2024)