Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Jiayi Huang, Han Zhong 0001, Liwei Wang 0001, Lin Yang 0011. Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds. In Alice Oh, Tristan Naumann, Amir Globerson, Kate Saenko, Moritz Hardt, Sergey Levine, editors, Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023. 2023. [doi]

This author has not been identified. Look up 'Jiayi Huang' in GoogleThis author has not been identified. Look up 'Han Zhong 0001' in GoogleThis author has not been identified. Look up 'Liwei Wang 0001' in GoogleThis author has not been identified. Look up 'Lin Yang 0011' in Google

runs on WebDSL