Sciweavers

509 search results - page 39 / 102
» Using Learning for Approximation in Stochastic Processes
Sort
View
KESAMSTA
2009
Springer
15 years 9 months ago
Relational Learning by Imitation
Abstract. Imitative learning can be considered an essential task of humans development. People use instructions and demonstrations provided by other human experts to acquire knowle...
Grazia Bombini, Nicola Di Mauro, Teresa Maria Alto...
UAI
2003
15 years 3 months ago
An Importance Sampling Algorithm Based on Evidence Pre-propagation
Precision achieved by stochastic sampling algorithms for Bayesian networks typically deteriorates in face of extremely unlikely evidence. To address this problem, we propose the E...
Changhe Yuan, Marek J. Druzdzel
AAAI
2006
15 years 3 months ago
Learning Basis Functions in Hybrid Domains
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
SARA
2005
Springer
15 years 8 months ago
Feature-Discovering Approximate Value Iteration Methods
Sets of features in Markov decision processes can play a critical role ximately representing value and in abstracting the state space. Selection of features is crucial to the succe...
Jia-Hong Wu, Robert Givan
AIPS
2003
15 years 3 months ago
Recommendation as a Stochastic Sequential Decision Problem
Recommender systems — systems that suggest to users in e-commerce sites items that might interest them — adopt a static view of the recommendation process and treat it as a pr...
Ronen I. Brafman, David Heckerman, Guy Shani