Auditing Near-Optimal Policies Can Be Exponentially Hard: Conditional Query Lower Bounds via Occupancy Rashomon Capacity
[Submitted on 29 May 2026]
·
2026-06-02
·
via cs.LG updates on arXiv.org
arXiv:2606.00414v1 Announce Type: new Abstract: When many reinforcement-learning policies achieve near-optima…
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。