Sciweavers

1760 search results - page 107 / 352
» Learning from Partial Observations
Sort
View
EACL
2006
ACL Anthology
13 years 11 months ago
Generalized Hebbian Algorithm for Incremental Singular Value Decomposition in Natural Language Processing
An algorithm based on the Generalized Hebbian Algorithm is described that allows the singular value decomposition of a dataset to be learned based on single observation pairs pres...
Genevieve Gorrell
NIPS
1996
13 years 11 months ago
Continuous Sigmoidal Belief Networks Trained using Slice Sampling
Real-valued random hidden variables can be useful for modelling latent structure that explains correlations among observed variables. I propose a simple unit that adds zero-mean G...
Brendan J. Frey

Publication
154views
13 years 15 days ago
Preference elicitation and inverse reinforcement learning
We state the problem of inverse reinforcement learning in terms of preference elicitation, resulting in a principled (Bayesian) statistical formulation. This generalises previous w...
Constantin Rothkopf, Christos Dimitrakakis
CVPR
1997
IEEE
14 years 2 months ago
Learning Generic Prior Models for Visual Computation
This paper presents a novel theory for learning generic prior models from a set of observed natural images based on a minimax entropy theory that the authors studied in modeling t...
Song Chun Zhu, David Mumford
ICANN
2009
Springer
14 years 2 months ago
Efficient Uncertainty Propagation for Reinforcement Learning with Limited Data
In a typical reinforcement learning (RL) setting details of the environment are not given explicitly but have to be estimated from observations. Most RL approaches only optimize th...
Alexander Hans, Steffen Udluft