Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for Smooth Minimax Games

by   Arun Sai Suggala, et al.

We consider the problem of online learning and its application to solving minimax games. For the online learning problem, Follow the Perturbed Leader (FTPL) is a widely studied algorithm which enjoys the optimal O(T^1/2) worst-case regret guarantee for both convex and nonconvex losses. In this work, we show that when the sequence of loss functions is predictable, a simple modification of FTPL which incorporates optimism can achieve better regret guarantees, while retaining the optimal worst-case regret guarantee for unpredictable sequences. A key challenge in obtaining these tighter regret bounds is the stochasticity and optimism in the algorithm, which requires different analysis techniques than those commonly used in the analysis of FTPL. The key ingredient we utilize in our analysis is the dual view of perturbation as regularization. While our algorithm has several applications, we consider the specific application of minimax games. For solving smooth convex-concave games, our algorithm only requires access to a linear optimization oracle. For Lipschitz and smooth nonconvex-nonconcave games, our algorithm requires access to an optimization oracle which computes the perturbed best response. In both these settings, our algorithm solves the game up to an accuracy of O(T^-1/2) using T calls to the optimization oracle. An important feature of our algorithm is that it is highly parallelizable and requires only O(T^1/2) iterations, with each iteration making O(T^1/2) parallel calls to the optimization oracle.



page 1

page 2

page 3

page 4


Online Non-Convex Learning: Following the Perturbed Leader is Optimal

We study the problem of online learning with non-convex losses, where th...

Near-optimal Oracle-efficient Algorithms for Stationary and Non-Stationary Stochastic Linear Bandits

We investigate the design of two algorithms that enjoy not only computat...

Learning in Non-convex Games with an Optimization Oracle

We consider adversarial online learning in a non-convex setting under th...

Near-Optimal No-Regret Learning for General Convex Games

A recent line of work has established uncoupled learning dynamics such t...

Faster Projection-free Online Learning

In many online learning problems the computational bottleneck for gradie...

Relax and Localize: From Value to Algorithms

We show a principled way of deriving online learning algorithms from a m...

An Efficient Algorithm for Cooperative Semi-Bandits

We consider the problem of asynchronous online combinatorial optimizatio...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.