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
8 papers · 2 filters
Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridge
Reda Ouhamma, Odalric Maillard, Vianney Perchet
We consider the problem of online linear regression in the stochastic setting. We derive high probability regret bounds for online ridge regression and the forward algorithm. This…
Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits
Reda Ouhamma, Rémy Degenne, Pierre Gaillard +1
In the fixed budget thresholding bandit problem, an algorithm sequentially allocates a budgeted number of samples to different distributions. It then predicts whether the mean of e…
Nonparametric estimation of continuous DPPs with kernel methods
Michaël Fanuel, Rémi Bardenet
Determinantal Point Process (DPPs) are statistical models for repulsive point patterns. Both sampling and inference are tractable for DPPs, a rare feature among models with negativ…
There Is No Turning Back: A Self-Supervised Approach for Reversibility-Aware Reinforcement Learning
Nathan Grinsztajn, Johan Ferret, Olivier Pietquin +2
We propose to learn to distinguish reversible from irreversible actions for better informed decision-making in Reinforcement Learning (RL). From theoretical considerations, we show…
Don't Do What Doesn't Matter: Intrinsic Motivation with Action Usefulness
Mathieu Seurin, Florian Strub, Philippe Preux +1
Sparse rewards are double-edged training signals in reinforcement learning: easy to design but hard to optimize. Intrinsic motivation guidances have thus been developed toward alle…
Leverage Score Sampling for Complete Mode Coverage in Generative Adversarial Networks
Joachim Schreurs, Hannes De Meulemeester, Michaël Fanuel +2
Commonly, machine learning models minimize an empirical expectation. As a result, the trained models typically perform well for the majority of the data but the performance may det…
Offline Reinforcement Learning with Pseudometric Learning
Robert Dadashi, Shideh Rezaeifar, Nino Vieillard +3
Offline Reinforcement Learning methods seek to learn a policy from logged transitions of an environment, without any interaction. In the presence of function approximation, and und…
Adversarially Guided Actor-Critic
Yannis Flet-Berliac, Johan Ferret, Olivier Pietquin +2
Despite definite success in deep reinforcement learning problems, actor-critic algorithms are still confronted with sample inefficiency in complex environments, particularly in tas…