Skip to yearly menu bar Skip to main content


Poster Thu, Dec 10, 2026 • 8:30 AM – 11:30 AM AEDT Hall C1 #A1313

On the Complexity of Offline Reinforcement Learning with Q*-Approximation and Partial Coverage

Haolin Liu ⋅ Braham Snyder ⋅ Chen-Yu Wei

Abstract

Log in and register to view live content