Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits
Thang Duong, Zhi Wang, Chicheng Zhang
Established a regret guarantee for sequential representation transfer without the standard task-diversity assumption, showing that this assumption is not necessary for the guarantee.
I proposed the exponential-algorithm approach after earlier proof attempts based on Davis-Kahan could not remove task diversity. BOSS learns and transfers a low-rank representation across tasks under an ellipsoid action-set assumption. Its computational cost motivates our follow-up work on efficient methods.
BibTeX
@article{duong2024beyond,
title = {Beyond task diversity: provable representation transfer for sequential multitask linear bandits},
author = {Duong, Thang and Wang, Zhi and Zhang, Chicheng},
journal = {Advances in Neural Information Processing Systems},
volume = {37},
pages = {37791--37822},
year = {2024}
}