259 citations
- Centre de Recherche en Économie et StatistiqueFR18 papers
- Centre Inria de SaclayFR16 papers
- Centre National de la Recherche ScientifiqueFR14 papers
- Sorbonne UniversitéFR14 papers
- Laboratoire d'Informatique de GrenobleFR12 papers
- École Normale Supérieure Paris-SaclayFR11 papers
- ENSAE ParisFR11 papers
- École Nationale d'AdministrationSN9 papers
- Laboratoire d'Informatique, du Traitement de l'Information et des SystèmesFR8 papers
- École PolytechniqueFR7 papers
- Institut Systèmes Intelligents et de RobotiqueFR7 papers
- POLARIS: Évaluation et optimisation des performances des grandes infrastructuresFR6 papers
31 papers · 1 filter
Logarithmic Smoothing for Pessimistic Off-Policy Evaluation, Selection and Learning
Otmane Sakhi, Imad Aouali, Pierre Alquier +1
This work investigates the offline formulation of the contextual bandit problem, where the goal is to leverage past interactions collected under a behavior policy to evaluate, sele…
Prior-Dependent Allocations for Bayesian Fixed-Budget Best-Arm Identification in Structured Bandits
Nicolas Nguyen, Imad Aouali, András György +1
We study the problem of Bayesian fixed-budget best-arm identification (BAI) in structured bandits. We propose an algorithm that uses fixed allocations based on the prior informatio…
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…
Optimal 1-Wasserstein Distance for WGANs
Arthur Stéphanovitch, Ugo Tanielian, Benoît Cadre +2
The mathematical forces at work behind Generative Adversarial Networks raise challenging theoretical issues. Motivated by the important question of characterizing the geometrical p…
A Large Scale Benchmark for Individual Treatment Effect Prediction and Uplift Modeling
Eustache Diemert, Artem Betlei, Christophe Renaudin +3
Individual Treatment Effect (ITE) prediction is an important area of research in machine learning which aims at explaining and estimating the causal impact of an action at the gran…
Pure Exploration and Regret Minimization in Matching Bandits
Flore Sentenac, Jialin Yi, Clément Calauzènes +2
Finding an optimal matching in a weighted graph is a standard combinatorial problem. We consider its semi-bandit version where either a pair or a full matching is sampled sequentia…