51 citations
- Afterschool AllianceUS2 papers
- Meta (Israel)IL2 papers
- Adobe Systems (United States)US1 paper
- Centre de Recherche en InformatiqueFR1 paper
- Centre de Recherche en Informatique, Signal et Automatique de LilleFR1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Czech Technical University in PragueCZ1 paper
- École Normale Supérieure Paris-SaclayFR1 paper
- École Normale Supérieure - PSLFR1 paper
- École Polytechnique Fédérale de LausanneCH1 paper
- Google (United Kingdom)GB1 paper
- Google (United States)US1 paper
4 papers · 1 filter
On two ways to use determinantal point processes for Monte Carlo integration
Guillaume Gautier, Rémi Bardenet, Michal Valko
The standard Monte Carlo estimator of relies on independent samples from and has variance of order . Replacing the samples with…
Planning in entropy-regularized Markov decision processes and games
Jean-Bastien Grill, Omar Darwiche Domingues, Pierre Ménard +2
We propose SmoothCruiser, a new planning algorithm for estimating the value function in entropy-regularized Markov decision processes and two-player games, given a generative model…
Budgeted Online Influence Maximization
Pierre Perrault, Jennifer Healey, Zheng Wen +1
We introduce a new budgeted framework for online influence maximization, considering the total cost of an advertising campaign instead of the common cardinality constraint on a cho…
Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model
Jean Tarbouriech, Matteo Pirotta, Michal Valko +1
We study the sample complexity of learning an -optimal policy in the Stochastic Shortest Path (SSP) problem. We first derive sample complexity bounds when the learner has acces…