← Search

Raphaël Féraud

4 accepted papers

2023

Question Answering System with Sparse and Noisy Feedback

ICASSP 2023accepted

The rise of personal assistants has made question answering a very popular mechanism for user-system interaction. In Question Answering System, implicit feedbacks can be easily observed (user clicking in the link given by the QA system), but they are noisy. However, receiving an explicit feedback on…

Cited by 0SourceScholar
2021

Double-Linear Thompson Sampling for Context-Attentive Bandits

ICASSP 2021accepted

In this paper, we analyze and extend an online learning frame-work known as Context-Attentive Bandit, motivated by various practical applications, from medical diagnosis to dialog systems, where due to observation costs only a small subset of a potentially large number of context variables can be ob…

Cited by 0SourceScholar
2021

Toward Skills Dialog Orchestration with Online Learning

ICASSP 2021accepted

Building multi-domain AI agents is a challenging task and an open problem in the area of AI. Within the domain of dialog, the ability to orchestrate multiple independently trained dialog agents, or skills, to create a unified system is of particular significance. In this work, we study the task of o…

Cited by 0SourceScholar
2016

Random Forest for the Contextual Bandit Problem

AISTATS 2016poster

To address the contextual bandit problem, we propose an online random forest algorithm. The analysis of the proposed algorithm is based on the sample complexity needed to find the optimal decision stump. Then, the decision stumps are recursively stacked in a random collection of decision trees, BAND…

Cited by 72SourcePDFScholar