← Search

Leonardo Cella

7 accepted papers

2023

Multi-task Representation Learning with Stochastic Linear Bandits

AISTATS 2023poster

We study the problem of transfer-learning in the setting of stochastic linear contextual bandit tasks. We consider that a low dimensional linear representation is shared across the tasks, and study the benefit of learning the tasks jointly. Following recent results to design Lasso stochastic bandit…

Cited by 28Source ↗PDF ↗Scholar ↗
2022

Group Meritocratic Fairness in Linear Contextual Bandits

NeurIPS 2022accept

We study the linear contextual bandit problem where an agent has to select one candidate from a pool and each candidate belongs to a sensitive group. In this setting, candidates' rewards may not be directly comparable between groups, for example when the agent is an employer hiring candidates from d…