Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation

4 May 2021

Papers citing "Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation"

4 / 4 papers shown

Title
Multi-Agent Congestion Cost Minimization With Linear Function Approximations Prashant Trivedi N. Hemachandra 22 0 0 26 Jan 2023
Learning Stochastic Shortest Path with Linear Function Approximation Steffen Czolbe Jiafan He Adrian V. Dalca Quanquan Gu 22 30 0 25 Oct 2021
Provably Efficient Reinforcement Learning with Linear Function Approximation Under Adaptivity Constraints Chi Jin Zhuoran Yang Zhaoran Wang OffRL 107 166 0 06 Jan 2021
Optimism in Reinforcement Learning with Generalized Linear Function Approximation Yining Wang Ruosong Wang S. Du A. Krishnamurthy 127 135 0 09 Dec 2019