Achieving $\tilde{O}(1/\epsilon)$ Sample Complexity for Constrained Markov Decision Process

$Achieving $\tilde{O}(1/\epsilon)$ Sample Complexity for Constrained Markov Decision Process$

Achieving $\tilde{O}(1/\epsilon)$ Sample Complexity for Constrained Markov Decision Process

Item #:: 079017-2499
UPC:

Download PDF

Details

DOI: https://doi.org/10.52202/079017-2499
Author(s): Jiashuo Jiang, Yinyu Ye
Pages: 78679-78714 (36 pages)
Format: PDF Paper Download
Conference: Advances in Neural Information Processing Systems 37
Date/Location: Held 10-15 December 2024, Vancouver, Canada.
Series: Advances in Neural Information Processing Systems 37
Publisher: Neural Information Processing Systems Foundation, Inc. (NeurIPS)

Description

Members/Attendees

Tab 4

Details
Description
Members/Attendees
Tab 4

DOI: https://doi.org/10.52202/079017-2499
Author(s): Jiashuo Jiang, Yinyu Ye
Pages: 78679-78714 (36 pages)
Format: PDF Paper Download
Conference: Advances in Neural Information Processing Systems 37
Date/Location: Held 10-15 December 2024, Vancouver, Canada.
Series: Advances in Neural Information Processing Systems 37
Publisher: Neural Information Processing Systems Foundation, Inc. (NeurIPS)