Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Daniel Vial, Advait Parulekar, Sanjay Shakkottai, R. Srikant 0001. Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation. In Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvári, Gang Niu 0001, Sivan Sabato, editors, International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA. Volume 162 of Proceedings of Machine Learning Research, pages 22203-22233, PMLR, 2022. [doi]

This author has not been identified. Look up 'Daniel Vial' in GoogleThis author has not been identified. Look up 'Advait Parulekar' in GoogleThis author has not been identified. Look up 'Sanjay Shakkottai' in GoogleThis author has not been identified. Look up 'R. Srikant 0001' in Google

runs on WebDSL