Optimization
Robust Bayesian Satisficing
Distributional shifts pose a significant challenge to achieving robustness in contemporary machine learning.
Randomized algorithms and PAC bounds for inverse reinforcement learning in continuous spaces
We further discuss the sample complexity for a desired approximation accuracy.
