

















Abstract:We propose SmoothCruiser, a new planning algorithm for estimating the value function in entropy-regularized Markov decision processes and two-player games, given a generative model of the environment. SmoothCruiser makes use of the smoothness of the Bellman operator promoted by the regularization to achieve problem-independent sample complexity of order O~(1/epsilon^4) for a desired accuracy epsilon, whereas for non-regularized settings there are no known algorithms with guaranteed polynomial sample complexity in the worst case.
| Comments: | NeurIPS 2019 |
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2604.19695 [cs.LG] |
| (or arXiv:2604.19695v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2604.19695 arXiv-issued DOI via DataCite (pending registration) |
|
| Journal reference: | Advances in Neural Information Processing Systems 32 (NeurIPS 2019) |
From: Michal Valko [view email]
[v1]
Tue, 21 Apr 2026 17:17:33 UTC (96 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。