Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
Luke S. Zettlemoyer, Hanna M. Pasula, Leslie Pack ...
In many practical reinforcement learning problems, the state space is too large to permit an exact representation of the value function, much less the time required to compute it. ...
Background: Modelling of time series data should not be an approximation of input data profiles, but rather be able to detect and evaluate dynamical changes in the time series dat...
Ryoko Morioka, Shigehiko Kanaya, Masami Y. Hirai, ...
It is widely accepted that the use of more compact representations than lookup tables is crucial to scaling reinforcement learning (RL) algorithms to real-world problems. Unfortun...
Satinder P. Singh, Tommi Jaakkola, Michael I. Jord...
We provide a general framework for learning precise, compact, and fast representations of the Bayesian predictive distribution for a model. This framework is based on minimizing t...