RepUCB: Representation Learning-Based UCB for Heterogeneous Multi-Task Linear Bandits

arXiv:2604.00531v2 Announce Type: replace Abstract: Multi-task representation learning exploits the shared structure among related tasks by learning a common latent representation, thereby improving sample efficiency. This paper introduces a novel approach to multi-task representation learning in heterogeneous linear bandits. We consider $T$ concurrent heterogeneous linear bandit tasks, each with feature dimension $d$, whose reward parameters share a common latent representation of dimension $r \ll \min\{d, T\}$, capturing the underlying task relatedness. We propose RepUCB, a novel Upper Confidence Bound (UCB) algorithm that leverages shared low-rank representations to enhance learning in a sample-efficient manner. Our algorithm first collects data through an exploration phase, estimates the shared representation, and then performs UCB-based learning on our proposed confidence set. We provide theoretical guarantees for the confidence set and prove that the unknown reward parameters lie within the confidence set with high probability. We derive cumulative regret bound and show that the proposed approach achieves $\widetilde{O}(\sqrt{drNT})$, a significant improvement over solving the $T$ tasks independently, resulting in a regret of $\widetilde{O}(dT\sqrt{N})$. We performed numerical simulations to validate the performance of our algorithm for different problem sizes and compared with baseline algorithms.

Abstract:Multi-task representation learning exploits the shared structure among related tasks by learning a common latent representation, thereby improving sample efficiency. This paper introduces a novel approach to multi-task representation learning in heterogeneous linear bandits. We consider $T$ concurrent heterogeneous linear bandit tasks, each with feature dimension $d$, whose reward parameters share a common latent representation of dimension $r \ll \min\{d, T\}$, capturing the underlying task relatedness. We propose RepUCB, a novel Upper Confidence Bound (UCB) algorithm that leverages shared low-rank representations to enhance learning in a sample-efficient manner. Our algorithm first collects data through an exploration phase, estimates the shared representation, and then performs UCB-based learning on our proposed confidence set. We provide theoretical guarantees for the confidence set and prove that the unknown reward parameters lie within the confidence set with high probability. We derive cumulative regret bound and show that the proposed approach achieves $\widetilde{O}(\sqrt{drNT})$, a significant improvement over solving the $T$ tasks independently, resulting in a regret of $\widetilde{O}(dT\sqrt{N})$. We performed numerical simulations to validate the performance of our algorithm for different problem sizes and compared with baseline algorithms.

Machine Learning (cs.LG)

arXiv:2604.00531 [cs.LG]

(or arXiv:2604.00531v2 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2604.00531 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

analiza aiqbench

RepUCB: Representation Learning-Based UCB for Heterogeneous Multi-Task Linear Bandits

Subiecte conexe