Sciweavers

3502 search results - page 217 / 701
» From Machine Learning to Machine Reasoning
Sort
View
ICML
1995
IEEE
16 years 7 months ago
Stable Function Approximation in Dynamic Programming
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
Geoffrey J. Gordon
NIPS
2007
15 years 8 months ago
A Risk Minimization Principle for a Class of Parzen Estimators
This paper1 explores the use of a Maximal Average Margin (MAM) optimality principle for the design of learning algorithms. It is shown that the application of this risk minimizati...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
COLT
2003
Springer
15 years 11 months ago
Learning Random Log-Depth Decision Trees under the Uniform Distribution
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...
Jeffrey C. Jackson, Rocco A. Servedio
ICML
2008
IEEE
16 years 7 months ago
Efficiently learning linear-linear exponential family predictive representations of state
Exponential Family PSR (EFPSR) models capture stochastic dynamical systems by representing state as the parameters of an exponential family distribution over a shortterm window of...
David Wingate, Satinder P. Singh
ICML
2000
IEEE
15 years 11 months ago
A Bayesian Framework for Reinforcement Learning
The reinforcement learning problem can be decomposed into two parallel types of inference: (i) estimating the parameters of a model for the underlying process; (ii) determining be...
Malcolm J. A. Strens