8 citations · 16 across the 18 of their papers we have counts for
4 papers · 1 filter
Multiplicative Optimism for Constant Regret in Games
Ashkan Soleymani, Georgios Piliouras
We introduce Multiplicatively Optimistic Regret Matching (MORM), an uncoupled learning rule for finite general-sum games. Under simultaneous full-information self-play, every playe…
Exact-Form Regret for Gradient Descent, Mirror Descent and Follow-the-Regularized-Leader
Ashkan Soleymani, Gabriele Farina, Patrick Jaillet
Online gradient descent is usually studied through external regret, where the learner competes with fixed alternatives. Recent work shows that first-order methods control richer ac…
Efficient Learning and Symmetry Discovery under Exact Invariances
Ashkan Soleymani, Behrooz Tahmasebi, Patrick Jaillet +1
Learning with group invariances is central to many scientific and geometric learning problems, yet its computational foundations remain poorly understood. Even for classical superv…
Algorithmic Optimality Guarantees for Nonsmooth Output-Feedback Policy Search
Ashkan Soleymani, Patrick Jaillet
We study continuous-time full-order dynamic output-feedback policy search, a nonconvex and nonsmooth problem. Direct policy search is a central paradigm in reinforcement…