activity
20172026
most citedA Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players

31 citations · 88 across the 18 of their papers we have counts for

collaborators

21 papers

cs.LG2026

Approximating Optimal Policies in Heterogeneous Asynchronous Multi-player Bandits

Sacha Arroues-Paykin, Etienne Boursier, Vianney Perchet

Motivated by applications to cognitive radio networks, multi-player multi-armed bandits (MMAB) have attracted considerable attention in recent years. The asynchronous variant, in w…

stat.ML2026

Statistical Benefits of Fine-Tuning from Pretrained Initialization in Diagonal Linear Networks

Alexandre Declèves, Etienne Boursier, Nicolas Flammarion

Adapting pretrained models to downstream tasks with limited data has become a central paradigm in modern deep learning. Yet, despite its widespread practical success, how fine-tuni…

stat.ML2026

Two-Timescale Fine-tuning Provably Learns New Features for Two-Layer ReLU Networks

Etienne Boursier, Nicolas Flammarion

Fine-tuning pre-trained models on specialized tasks with scarce data is central to modern deep learning. Despite its empirical success, theoretical understanding of fine-tuning rem…

cs.LG2024

Simplicity bias and optimization threshold in two-layer ReLU networks

Etienne Boursier, Nicolas Flammarion

Understanding generalization of overparametrized neural networks remains a fundamental challenge in machine learning. Most of the literature mostly studies generalization from an i…

cs.LG2024

Early alignment in two-layer networks training is a two-edged sword

Etienne Boursier, Nicolas Flammarion

Training neural networks with first order optimisation methods is at the core of the empirical success of deep learning. The scale of initialisation is a crucial factor, as small i…

cs.LG2023

Constant or logarithmic regret in asynchronous multiplayer bandits

Hugo Richard, Etienne Boursier, Vianney Perchet

Multiplayer bandits have recently been extensively studied because of their application to cognitive radio networks. While the literature mostly considers synchronous players, radi…

stat.ML2023★ 1 cited

Penalising the biases in norm regularisation enforces sparsity

Etienne Boursier, Nicolas Flammarion

Controlling the parameters' norm often yields good generalisation when training neural networks. Beyond simple intuitions, the relation between regularising parameters' norm and ob…

cs.LG2023★ 1 cited

First-order ANIL provably learns representations despite overparametrization

Oğuz Kaan Yüksel, Etienne Boursier, Nicolas Flammarion

Due to its empirical success in few-shot classification and reinforcement learning, meta-learning has recently received significant interest. Meta-learning methods leverage data fr…

stat.ML2022★ 3 cited

A survey on multi-player bandits

Etienne Boursier, Vianney Perchet

Due mostly to its application to cognitive radio networks, multiplayer bandits gained a lot of interest in the last decade. A considerable progress has been made on its theoretical…

stat.ML2022★ 2 cited

Gradient flow dynamics of shallow ReLU networks for square loss and orthogonal inputs

Etienne Boursier, Loucas Pillaud-Vivien, Nicolas Flammarion

The training of neural networks by gradient descent methods is a cornerstone of the deep learning revolution. Yet, despite some recent progress, a complete theory explaining its su…

stat.ML2022★ 1 cited

Trace norm regularization for multi-task learning with scarce data

Etienne Boursier, Mikhail Konobeev, Nicolas Flammarion

Multi-task learning leverages structural similarities between multiple tasks to learn despite very few samples. Motivated by the recent success of neural networks applied to data-s…

stat.ML2021★ 6 cited

Decentralized Learning in Online Queuing Systems

Flore Sentenac, Etienne Boursier, Vianney Perchet

Motivated by packet routing in computer networks, online queuing systems are composed of queues receiving packets at different rates. Repeatedly, they send packets to servers, each…

stat.ML2021

Making the most of your day: online learning for optimal allocation of time

Etienne Boursier, Tristan Garrec, Vianney Perchet +1

We study online learning for optimal allocation when the resource to be allocated is time. %Examples of possible applications include job scheduling for a computing server, a drive…

math.OC2020

Social Learning in Non-Stationary Environments

Etienne Boursier, Vianney Perchet, Marco Scarsini

Potential buyers of a product or service, before making their decisions, tend to read reviews written by previous consumers. We consider Bayesian consumers with heterogeneous prefe…

stat.ML2020★ 7 cited

Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits

Pierre Perrault, Etienne Boursier, Vianney Perchet +1

We investigate stochastic combinatorial multi-armed bandit with semi-bandit feedback (CMAB). In CMAB, the question of the existence of an efficient policy with an optimal asymptoti…

cs.LG2020★ 11 cited

Selfish Robustness and Equilibria in Multi-Player Bandits

Etienne Boursier, Vianney Perchet

Motivated by cognitive radios, stochastic multi-player multi-armed bandits gained a lot of interest recently. In this class of problems, several players simultaneously pull arms an…

stat.ML2019★ 2 cited

Utility/Privacy Trade-off through the lens of Optimal Transport

Etienne Boursier, Vianney Perchet

Strategic information is valuable either by remaining private (for instance if it is sensitive) or, on the other hand, by being used publicly to increase some utility. These two ob…

stat.ML2019★ 31 cited

A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players

Etienne Boursier, Emilie Kaufmann, Abbas Mehrabian +1

We study a multiplayer stochastic multi-armed bandit problem in which players cannot communicate, and if two or more players pull the same arm, a collision occurs and the involved…

cs.LG2018★ 15 cited

SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits

Etienne Boursier, Vianney Perchet

Motivated by cognitive radio networks, we consider the stochastic multiplayer multi-armed bandit problem, where several players pull arms simultaneously and collisions occur if one…

cs.DB2018★ 4 cited

Plato: Approximate Analytics over Compressed Time Series with Tight Deterministic Error Guarantees

Chunbin Lin, Etienne Boursier, Yannis Papakonstantinou

Plato provides fast approximate analytics on time series, by precomputing and storing compressed time series. Plato's key novelty is the delivery of tight deterministic error guara…

cs.DB2017★ 4 cited

Efficient Approximate Query Answering over Sensor Data with Deterministic Error Guarantees

Jaqueline Brito, Korhan Demirkaya, Boursier Etienne +3

With the recent proliferation of sensor data, there is an increasing need for the efficient evaluation of analytical queries over multiple sensor datasets. The magnitude of such da…