ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2203.15664
  4. Cited By
Nearly Minimax Algorithms for Linear Bandits with Shared Representation

Nearly Minimax Algorithms for Linear Bandits with Shared Representation

29 March 2022
Jiaqi Yang
Qi Lei
Jason D. Lee
S. Du
ArXivPDFHTML

Papers citing "Nearly Minimax Algorithms for Linear Bandits with Shared Representation"

6 / 6 papers shown
Title
Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits
Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits
Thang Duong
Zhi Wang
Chicheng Zhang
34
0
0
23 Jan 2025
Pretraining Decision Transformers with Reward Prediction for In-Context Multi-task Structured Bandit Learning
Pretraining Decision Transformers with Reward Prediction for In-Context Multi-task Structured Bandit Learning
Subhojyoti Mukherjee
Josiah P. Hanna
Qiaomin Xie
Robert Nowak
61
2
0
07 Jun 2024
Sharing Knowledge in Multi-Task Deep Reinforcement Learning
Sharing Knowledge in Multi-Task Deep Reinforcement Learning
Carlo DÉramo
Davide Tateo
Andrea Bonarini
Marcello Restelli
Jan Peters
48
121
0
17 Jan 2024
Multi-task Representation Learning for Pure Exploration in Linear
  Bandits
Multi-task Representation Learning for Pure Exploration in Linear Bandits
Yihan Du
Longbo Huang
Wen Sun
11
4
0
09 Feb 2023
Meta Representation Learning with Contextual Linear Bandits
Meta Representation Learning with Contextual Linear Bandits
Leonardo Cella
Karim Lounici
Massimiliano Pontil
13
5
0
30 May 2022
Provable Benefits of Representational Transfer in Reinforcement Learning
Provable Benefits of Representational Transfer in Reinforcement Learning
Alekh Agarwal
Yuda Song
Wen Sun
Kaiwen Wang
Mengdi Wang
Xuezhou Zhang
OffRL
16
33
0
29 May 2022
1