Poster · Atlanta

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

Name: On the Complexity of Offline Reinforcement Learning with Q*-Approximation and Partial Coverage
Start: 2026-12-09T16:30:00-05:00
End: 2026-12-09T19:30:00-05:00
Location: Hall C1, Georgia World Congress Center

When: Wed 9 Dec 2026, 16:30–19:30 EST
Where: Hall C1, Georgia World Congress Center
Session: Atlanta Poster Session 2
Authors: Haolin Liu, Braham Snyder, Chen-Yu Wei
Organisations: University of Virginia, UVA
QRS classification: Reinforcement learning, Learning theory

Open in schedule Official page