Sciweavers

360 search results - page 11 / 72
» Learning Evaluation Functions for Large Acyclic Domains
Sort
View
JMLR
2010
113views more  JMLR 2010»
13 years 3 months ago
Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
Kaname Kojima, Eric Perrier, Seiya Imoto, Satoru M...
ICML
2007
IEEE
14 years 9 months ago
Learning state-action basis functions for hierarchical MDPs
This paper introduces a new approach to actionvalue function approximation by learning basis functions from a spectral decomposition of the state-action manifold. This paper exten...
Sarah Osentoski, Sridhar Mahadevan
ICML
2006
IEEE
14 years 9 months ago
On a theory of learning with similarity functions
Kernel functions have become an extremely popular tool in machine learning, with an attractive theory as well. This theory views a kernel as implicitly mapping data points into a ...
Maria-Florina Balcan, Avrim Blum
ML
2008
ACM
110views Machine Learning» more  ML 2008»
13 years 7 months ago
A theory of learning with similarity functions
Kernel functions have become an extremely popular tool in machine learning, with an attractive theory as well. This theory views a kernel as implicitly mapping data points into a ...
Maria-Florina Balcan, Avrim Blum, Nathan Srebro
ICML
2008
IEEE
14 years 9 months ago
A worst-case comparison between temporal difference and residual gradient with linear function approximation
Residual gradient (RG) was proposed as an alternative to TD(0) for policy evaluation when function approximation is used, but there exists little formal analysis comparing them ex...
Lihong Li