1414 search results - page 147 / 283 » Randomness and Universal Machines |
85
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
In apprenticeship learning, the goal is to learn a policy in a Markov decision process that is at least as good as a policy demonstrated by an expert. The difficulty arises in tha...
76
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
The dynamic hierarchical Dirichlet process (dHDP) is developed to model the timeevolving statistical properties of sequential data sets. The data collected at any time point are r...
104
click to vote
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
A number of supervised learning methods have been introduced in the last decade. Unfortunately, the last comprehensive empirical evaluation of supervised learning was the Statlog ...
94
Voted
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
117
click to vote
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...