Sciweavers

3837 search results - page 81 / 768
» Learning Approximate Consistencies
Sort
View
ICML
2003
IEEE
16 years 4 months ago
Action Elimination and Stopping Conditions for Reinforcement Learning
We consider incorporating action elimination procedures in reinforcement learning algorithms. We suggest a framework that is based on learning an upper and a lower estimates of th...
Eyal Even-Dar, Shie Mannor, Yishay Mansour
POPL
2007
ACM
16 years 4 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
ML
2002
ACM
140views Machine Learning» more  ML 2002»
15 years 3 months ago
A Probabilistic Framework for SVM Regression and Error Bar Estimation
In this paper, we elaborate on the well-known relationship between Gaussian Processes (GP) and Support Vector Machines (SVM) under some convex assumptions for the loss functions. ...
Junbin Gao, Steve R. Gunn, Chris J. Harris, Martin...
ICONIP
2007
15 years 5 months ago
Natural Conjugate Gradient in Variational Inference
Variational methods for approximate inference in machine learning often adapt a parametric probability distribution to optimize a given objective function. This view is especially ...
Antti Honkela, Matti Tornio, Tapani Raiko, Juha Ka...
NIPS
2008
15 years 5 months ago
Regularized Policy Iteration
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
Amir Massoud Farahmand, Mohammad Ghavamzadeh, Csab...