1 citations · 1 across the 4 of their papers we have counts for
4 papers
Incentivized Learning in Principal-Agent Bandit Games
Antoine Scheid, Daniil Tiapkin, Etienne Boursier +5
This work considers a repeated principal-agent bandit game, where the principal can only interact with her environment through the agent. The principal and the agent have misaligne…
Sharp Deviations Bounds for Dirichlet Weighted Sums with Application to analysis of Bayesian algorithms
Denis Belomestny, Pierre Menard, Alexey Naumov +2
In this work, we derive sharp non-asymptotic deviation bounds for weighted sums of Dirichlet random variables. These bounds are based on a novel integral representation of the dens…
Orthogonal Directions Constrained Gradient Method: from non-linear equality constraints to Stiefel manifold
Sholom Schechtman, Daniil Tiapkin, Michael Muehlebach +1
We consider the problem of minimizing a non-convex function over a smooth manifold . We propose a novel algorithm, the Orthogonal Directions Constrained Gradient Metho…
Fast Rates for Maximum Entropy Exploration
Daniil Tiapkin, Denis Belomestny, Daniele Calandriello +7
We address the challenge of exploration in reinforcement learning (RL) when the agent operates in an unknown environment with sparse or no rewards. In this work, we study the maxim…