Title: No-Regret Learning and The Power of Optimism

Abstract: In this talk, we will be delving into the underlying math from my recent paper Near-Optimal No-Regret Learning in General Games, establishing a polylogarithmic regret bound for learners playing in a general game.  We will be exploring proof techniques from the various pieces of the paper.  The goal will be to communicate the deeper intuition behind the result and demonstrate the power of optimism!