Goto

Collaborating Authors

 sample complexity







The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model Laixi Shi Caltech Gen Li

Neural Information Processing Systems

In this paper, we are particularly interested in understanding whether, and how, the choice of distributional robustness bears statistical implications in learning the desired policy, by studying the sample complexity in the widely-used generative model (Kearns and Singh, 1999).


Debiasing Conditional Stochastic Optimization Lie He

Neural Information Processing Systems

The sample-averaged gradient of the CSO objective is biased due to its nested structure, and therefore requires a high sample complexity for convergence. We introduce a general stochastic extrapolation technique that effectively reduces the bias.