172 citations · 206 across the 21 of their papers we have counts for
8 papers · 1 filter
Reconsidering Analytical Variational Bounds for Output Layers of Deep Networks
Otmane Sakhi, Stephen Bonner, David Rohde +1
The combination of the re-parameterization trick with the use of variational auto-encoders has caused a sensation in Bayesian deep learning, allowing the training of realistic gene…
Learning from Bandit Feedback: An Overview of the State-of-the-art
Olivier Jeunen, Dmytro Mykhaylov, David Rohde +3
In machine learning we often try to optimise a decision rule that would have worked well over a historical dataset; this is the so called empirical risk minimisation principle. In…
Relaxed Softmax for learning from Positive and Unlabeled data
Ugo Tanielian, Flavian Vasile
In recent years, the softmax model and its fast approximations have become the de-facto loss functions for deep neural networks when dealing with multi-class prediction. This loss…
Recommendation System-based Upper Confidence Bound for Online Advertising
Nhan Nguyen-Thanh, Dana Marinca, Kinda Khawam +5
In this paper, the method UCB-RS, which resorts to recommendation system (RS) for enhancing the upper-confidence bound algorithm UCB, is presented. The proposed method is used for…
On the Value of Bandit Feedback for Offline Recommender System Evaluation
Olivier Jeunen, David Rohde, Flavian Vasile
In academic literature, recommender systems are often evaluated on the task of next-item prediction. The procedure aims to give an answer to the question: "Given the natural sequen…
Distributionally Robust Counterfactual Risk Minimization
Louis Faury, Ugo Tanielian, Flavian Vasile +2
This manuscript introduces the idea of using Distributionally Robust Optimization (DRO) for the Counterfactual Risk Minimization (CRM) problem. Tapping into a rich existing literat…