18 citations · 35 across the 33 of their papers we have counts for
3 papers · 2 filters
Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit
Julien Zhou, Pierre Gaillard, Thibaud Rahier +1
We address the online unconstrained submodular maximization problem (Online USM), in a setting with stochastic bandit feedback. In this framework, a decision-maker receives noisy r…
Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits
Julien Zhou, Pierre Gaillard, Thibaud Rahier +2
We address the problem of stochastic combinatorial semi-bandits, where a player selects among P actions from the power set of a set containing d base items. Adaptivity to the probl…
Position: Bayesian Deep Learning is Needed in the Age of Large-Scale AI
Theodore Papamarkou, Maria Skoularidou, Konstantina Palla +22
In the current landscape of deep learning research, there is a predominant emphasis on achieving high predictive accuracy in supervised tasks involving large image and language dat…