Toggle Poster Visibility
Oral
Thu Jul 22 09:00 AM -- 09:20 AM (KST)
Exponential Lower Bounds for Batch Reinforcement Learning: Batch RL can be Exponentially Harder than Online RL
[ Paper ]
Spotlight
Thu Jul 22 09:20 AM -- 09:25 AM (KST)
Provably Efficient Reinforcement Learning for Discounted MDPs with Feature Mapping
[ Paper ]
Spotlight
Thu Jul 22 09:25 AM -- 09:30 AM (KST)
Confidence-Budget Matching for Sequential Budgeted Learning
[ Paper ]
Spotlight
Thu Jul 22 09:30 AM -- 09:35 AM (KST)
Sample Efficient Reinforcement Learning In Continuous State Spaces: A Perspective Beyond Linearity
[ Paper ]
Spotlight
Thu Jul 22 09:35 AM -- 09:40 AM (KST)
Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient
[ Paper ]
Spotlight
Thu Jul 22 09:40 AM -- 09:45 AM (KST)
Robust Policy Gradient against Strong Data Corruption
[ Paper ]
Spotlight
Thu Jul 22 09:45 AM -- 09:50 AM (KST)
Logarithmic Regret for Reinforcement Learning with Linear Function Approximation
[ Paper ]
Successful Page Load