2 papers
cs.LG2023
Toward -recovery of Nonlinear Functions: A Polynomial Sample Complexity Bound for Gaussian Random Fields
Kefan Dong, Tengyu Ma
Many machine learning applications require learning a function with a small worst-case error over the entire input domain, that is, the -error, whereas most existing theo…
cs.LG2023
Model-based Offline Reinforcement Learning with Local Misspecification
Kefan Dong, Yannis Flet-Berliac, Allen Nie +1
We present a model-based offline reinforcement learning policy performance lower bound that explicitly captures dynamics model misspecification and distribution mismatch and we pro…