|
Spotlight
|
Wed 18:40
|
Finding the Stochastic Shortest Path with Low Regret: the Adversarial Cost and Unknown Transition Case
Liyu Chen · Haipeng Luo
|
|
|
Poster
|
Wed 21:00
|
Robust Policy Gradient against Strong Data Corruption
Xuezhou Zhang · Yiding Chen · Jerry Zhu · Wen Sun
|
|
|
Spotlight
|
Wed 5:20
|
Batch Value-function Approximation with Only Realizability
Tengyang Xie · Nan Jiang
|
|
|
Poster
|
Wed 9:00
|
Near Optimal Reward-Free Reinforcement Learning
Zhang Zihan · Simon Du · Xiangyang Ji
|
|
|
Poster
|
Wed 21:00
|
Finding the Stochastic Shortest Path with Low Regret: the Adversarial Cost and Unknown Transition Case
Liyu Chen · Haipeng Luo
|
|
|
Poster
|
Wed 9:00
|
Batch Value-function Approximation with Only Realizability
Tengyang Xie · Nan Jiang
|
|
|
Oral
|
Wed 5:00
|
Near Optimal Reward-Free Reinforcement Learning
Zhang Zihan · Simon Du · Xiangyang Ji
|
|
|
Spotlight
|
Wed 17:40
|
Robust Policy Gradient against Strong Data Corruption
Xuezhou Zhang · Yiding Chen · Jerry Zhu · Wen Sun
|
|
|
Poster
|
Wed 21:00
|
Online Learning in Unknown Markov Games
Yi Tian · Yuanhao Wang · Tiancheng Yu · Suvrit Sra
|
|
|
Spotlight
|
Wed 18:20
|
Online Learning in Unknown Markov Games
Yi Tian · Yuanhao Wang · Tiancheng Yu · Suvrit Sra
|
|
|
Poster
|
Wed 21:00
|
Task-Optimal Exploration in Linear Dynamical Systems
Andrew Wagenmaker · Max Simchowitz · Kevin Jamieson
|
|
|
Oral
|
Wed 18:00
|
Task-Optimal Exploration in Linear Dynamical Systems
Andrew Wagenmaker · Max Simchowitz · Kevin Jamieson
|
|
