298 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Université de LilleFR364 papers
- Centre National de la Recherche ScientifiqueFR257 papers
- École Centrale de LilleFR212 papers
- Centre de Recherche en InformatiqueFR203 papers
- Université Paris-SaclayFR74 papers
- Institut d'Astrophysique SpatialeFR64 papers
- Sorbonne UniversitéFR59 papers
- Institut de Recherche en Astrophysique et PlanétologieFR58 papers
- Université Paris CitéFR57 papers
- Université Paris Sciences et LettresFR53 papers
- Ludwig-Maximilians-Universität MünchenDE52 papers
- CEA Paris-SaclayFR51 papers
4 papers · 2 filters
Towards Instance-Optimality in Online PAC Reinforcement Learning
Aymen Al-Marjani, Andrea Tirinzoni, Emilie Kaufmann
Several recent works have proposed instance-dependent upper bounds on the number of episodes needed to identify, with probability , an -optimal policy in finite-h…
Signal reconstruction using determinantal sampling
Ayoub Belhadji, Rémi Bardenet, Pierre Chainais
We study the approximation of a square-integrable function from a finite number of evaluations on a random set of nodes according to a well-chosen distribution. This is particularl…
CRIMED: Lower and Upper Bounds on Regret for Bandits with Unbounded Stochastic Corruption
Shubhada Agrawal, Timothée Mathieu, Debabrota Basu +1
We investigate the regret-minimisation problem in a multi-armed bandit setting with arbitrary corruptions. Similar to the classical setup, the agent receives rewards generated inde…
Concentrated Differential Privacy for Bandits
Achraf Azize, Debabrota Basu
Bandits serve as the theoretical foundation of sequential learning and an algorithmic foundation of modern recommender systems. However, recommender systems often rely on user-sens…