Pareto optimal model selection in linear bandits

Y Zhu, R Nowak - International Conference on Artificial …, 2022 - proceedings.mlr.press
We study model selection in linear bandits, where the learner must adapt to the dimension
(denoted by $ d_\star $) of the smallest hypothesis class containing the true linear model …

Learning early exit for deep neural network inference on mobile devices through multi-armed bandits

W Ju, W Bao, D Yuan, L Ge… - 2021 IEEE/ACM 21st …, 2021 - ieeexplore.ieee.org
We present a novel learning framework that utilizes the early exit of Deep Neural Network
(DNN), a device-only solution that reduces the latency of inference by sacrificing a …

[PDF][PDF] Toward Optimal Solution for the Context-Attentive Bandit Problem.

D Bouneffouf, R Feraud, S Upadhyay, I Rish… - IJCAI, 2021 - ijcai.org
In various recommender system applications, from medical diagnosis to dialog systems, due
to observation costs only a small subset of a potentially large number of context variables …

Double-linear thompson sampling for context-attentive bandits

D Bouneffouf, R Féraud, S Upadhyay… - ICASSP 2021-2021 …, 2021 - ieeexplore.ieee.org
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 …

Dynamic path learning in decision trees using contextual bandits

W Ju, D Yuan, W Bao, L Ge, BB Zhou - World Wide Web, 2023 - Springer
We present a novel online decision-making solution, where the optimal path of a given
decision tree is dynamically found based on the contextual bandits analysis. At each round …

On the relevance of bandit algorithms in digital world

R Feraud - 2023 - hal.science
In the digital world, more and more autonomous agents make automatic decisions to
optimize a criterion by learning from their past decisions. Their rapid multiplication implies …