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. 2206.04921
  4. Cited By
Offline Stochastic Shortest Path: Learning, Evaluation and Towards
  Optimality

Offline Stochastic Shortest Path: Learning, Evaluation and Towards Optimality

10 June 2022
Ming Yin
Wenjing Chen
Mengdi Wang
Yu-Xiang Wang
    OffRL
ArXivPDFHTML

Papers citing "Offline Stochastic Shortest Path: Learning, Evaluation and Towards Optimality"

5 / 5 papers shown
Title
First-Order Regret in Reinforcement Learning with Linear Function
  Approximation: A Robust Estimation Approach
First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach
Andrew Wagenmaker
Yifang Chen
Max Simchowitz
S. Du
Kevin G. Jamieson
71
36
0
07 Dec 2021
Learning Stochastic Shortest Path with Linear Function Approximation
Learning Stochastic Shortest Path with Linear Function Approximation
Steffen Czolbe
Jiafan He
Adrian V. Dalca
Quanquan Gu
22
30
0
25 Oct 2021
Pessimistic Model-based Offline Reinforcement Learning under Partial
  Coverage
Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage
Masatoshi Uehara
Wen Sun
OffRL
91
144
0
13 Jul 2021
Regret Bounds for Stochastic Shortest Path Problems with Linear Function
  Approximation
Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation
Daniel Vial
Advait Parulekar
Sanjay Shakkottai
R. Srikant
21
15
0
04 May 2021
Double Reinforcement Learning for Efficient Off-Policy Evaluation in
  Markov Decision Processes
Double Reinforcement Learning for Efficient Off-Policy Evaluation in Markov Decision Processes
Nathan Kallus
Masatoshi Uehara
OffRL
29
180
0
22 Aug 2019
1