Anas Barakat
Anas Barakat
Home
Research
Talks
Teaching
CV
Contact
Light
Dark
Automatic
Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
Anas Barakat
,
Andreas Kontogiannis
,
Vasilis Pollatos
,
Ioannis Panageas
,
Antonios Varvitsiotis
May 2026
Arxiv
Type
Conference paper
Publication
Under review
Online Learning
Related
Convex Markov Games and Beyond: New Proof of Existence, Characterization and Learning Algorithms for Nash Equilibria
When and Why is Optimistic Multiplicative Weights Slow? The Geometry of Energy Dissipation
Online Multi-Agent Control with Adversarial Disturbances
Optimistic Online Learning in Symmetric Cone Games
Why Pass@k Optimization Can Degrade Pass@1: Prompt Interference in LLM Post-training
Cite
×