|
Poster
|
Wed 12:45 |
Finite-Sample Regret Bound for Distributionally Robust Offline Tabular Reinforcement Learning Zhengqing Zhou · Qinxun Bai · Zhengyuan Zhou · Linhai Qiu · Jose Blanchet · Peter Glynn |
|
|
Oral
|
Wed 9:00 |
The Sample Complexity of Level Set Approximation Francois Bachoc · Tommaso Cesari · Sébastien Gerchinovitz |
|
|
Poster
|
Tue 14:00 |
Sample Elicitation Jiaheng Wei · Zuyue Fu · Yang Liu · Xingyu Li · Zhuoran Yang · Zhaoran Wang |
|
|
Poster
|
Wed 12:45 |
Toward a General Theory of Online Selective Sampling: Trading Off Mistakes and Queries Steve Hanneke · Liu Yang |
|
|
Poster
|
Thu 7:30 |
Context-Specific Likelihood Weighting Nitesh Kumar · Ondřej Kuželka |
|
|
Poster
|
Wed 6:00 |
Sequential Random Sampling Revisited: Hidden Shuffle Method Michael Shekelyan · Graham Cormode |
|
|
Poster
|
Tue 14:00 |
TenIPS: Inverse Propensity Sampling for Tensor Completion Chengrun Yang · Lijun Ding · Ziyang Wu · Madeleine Udell |
|
|
Poster
|
Tue 14:00 |
Differentially Private Weighted Sampling Edith Cohen · Ofir Geri · Tamas Sarlos · Uri Stemmer |
|
|
Poster
|
Tue 14:00 |
Sample Complexity Bounds for Two Timescale Value-based Reinforcement Learning Algorithms Tengyu Xu · Yingbin Liang |
|
|
Poster
|
Tue 14:00 |
Convergence of Gaussian-smoothed optimal transport distance with sub-gamma distributions and dependent samples Yixing Zhang · Xiuyuan Cheng · Galen Reeves |
|
|
Poster
|
Wed 6:00 |
The Sample Complexity of Level Set Approximation Francois Bachoc · Tommaso Cesari · Sébastien Gerchinovitz |
|
|
Oral Session
|
Tue 11:30 |
Sampling Methods |