Sciweavers

301 search results - page 9 / 61
» Approximate predictive state representations
Sort
View
DAGSTUHL
2007
15 years 1 months ago
Logical Particle Filtering
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 ...
94
Voted
ECAI
2008
Springer
15 years 1 months ago
Reinforcement Learning with the Use of Costly Features
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. ...
Robby Goetschalckx, Scott Sanner, Kurt Driessens
88
Voted
BMCBI
2007
173views more  BMCBI 2007»
14 years 12 months ago
Predicting state transitions in the transcriptome and metabolome using a linear dynamical system model
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, ...
NIPS
1994
15 years 1 months ago
Reinforcement Learning with Soft State Aggregation
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...
ICML
2005
IEEE
16 years 17 days ago
Compact approximations to Bayesian predictive distributions
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...
Edward Snelson, Zoubin Ghahramani