4 citations · 17 across the 9 of their papers we have counts for
Showing 2021 · cs.LGShow all
2 papers · 2 filters
cs.LG2021★ 1 cited
Improved Algorithms for Misspecified Linear Markov Decision Processes
Daniel Vial, Advait Parulekar, Sanjay Shakkottai +1
For the misspecified linear Markov decision process (MLMDP) model of Jin et al. [2020], we propose an algorithm with three desirable properties. (P1) Its regret after episodes…
cs.LG2021★ 4 cited
Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation
Daniel Vial, Advait Parulekar, Sanjay Shakkottai +1
We propose an algorithm that uses linear function approximation (LFA) for stochastic shortest path (SSP). Under minimal assumptions, it obtains sublinear regret, is computationally…