Sciweavers

3050 search results - page 239 / 610
» On-line Algorithms in Machine Learning
Sort
View
ICML
2010
IEEE
15 years 5 months ago
Bottom-Up Learning of Markov Network Structure
The structure of a Markov network is typically learned using top-down search. At each step, the search specializes a feature by conjoining it to the variable or feature that most ...
Jesse Davis, Pedro Domingos
ICML
2010
IEEE
15 years 5 months ago
Learning Programs: A Hierarchical Bayesian Approach
We are interested in learning programs for multiple related tasks given only a few training examples per task. Since the program for a single task is underdetermined by its data, ...
Percy Liang, Michael I. Jordan, Dan Klein
ML
2008
ACM
152views Machine Learning» more  ML 2008»
15 years 4 months ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...
COGSCI
2002
99views more  COGSCI 2002»
15 years 4 months ago
Learning words from sights and sounds: a computational model
This paper presents an implemented computational model of word acquisition which learns directly from raw multimodal sensory input. Set in an information theoretic framework, the ...
Deb Roy, Alex Pentland
NIPS
2000
15 years 5 months ago
From Margin to Sparsity
We present an improvement of Noviko 's perceptron convergence theorem. Reinterpreting this mistakebound as a margindependent sparsity guarantee allows us to give a PAC{style ...
Thore Graepel, Ralf Herbrich, Robert C. Williamson