all AI news
Computationally Efficient PAC RL in POMDPs with Latent Determinism and Conditional Embeddings. (arXiv:2206.12081v1 [cs.LG])
June 27, 2022, 1:11 a.m. | Masatoshi Uehara, Ayush Sekhari, Jason D. Lee, Nathan Kallus, Wen Sun
stat.ML updates on arXiv.org arxiv.org
We study reinforcement learning with function approximation for large-scale
Partially Observable Markov Decision Processes (POMDPs) where the state space
and observation space are large or even continuous. Particularly, we consider
Hilbert space embeddings of POMDP where the feature of latent states and the
feature of observations admit a conditional Hilbert space embedding of the
observation emission process, and the latent state transition is deterministic.
Under the function approximation setup where the optimal latent state-action
$Q$-function is linear in the state …
More from arxiv.org / stat.ML updates on arXiv.org
Estimation Sample Complexity of a Class of Nonlinear Continuous-time Systems
2 days, 21 hours ago |
arxiv.org
Jobs in AI, ML, Big Data
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Program Control Data Analyst
@ Ford Motor Company | Mexico
Vice President, Business Intelligence / Data & Analytics
@ AlphaSense | Remote - United States