[Submitted on 12 Feb 2026 ( v1 ), last revised 18 Nov 2026 (this version, v3)] Title:On the Complexity of Offline Reinforcement Learning with Q*-Approximation and Partial Coverage View a PDF of the paper titled On the Complexity of Offline Reinforcement Learning with Q*-Approximation and Partial Coverage, by Haolin Liu and 2 other authors View PDF Abstract:We study offline reinforcement learning under $Q^\star$-approximation and partial coverage, a setting that motivates practical algorithms...
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile