## 2 événements

• Mathématiques de l’apprentissage

### Lundi 1er avril 12:30-13:30 - Tommaso Cesari - University of Milan

Cooperative Online Learning : Keeping your Neighbors Updated

Résumé : We study an asynchronous online learning setting with a network of agents. At each time step, some of the agents are activated, requested to make a prediction, and pay the corresponding loss. The loss function is then revealed to these agents and also to their neighbors in the network. When activations are stochastic, we show that the regret achieved by a network of agents running the standard online Mirror Descent algorithm scales with the independence number of the network rather than with the number of agents. We also show a matching lower bound that holds for any given network. When the pattern of agent activations is arbitrary, the problem changes significantly : we prove a linear lower bound on the regret that holds for any online algorithm oblivious to the feedback source.

Lieu : Bâtiment 1R3, salle de conférence du premier étage (MIP)

• Séminaire d’Analyse Réelle

### Lundi 1er avril 14:00-15:00 - Yanqi Qiu

Séminaire d’Analyse Réelle