Sciweavers

1343 search results - page 185 / 269
» Learning Weighted Automata
Sort
View
ICML
2006
IEEE
15 years 12 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty
ICML
2005
IEEE
15 years 12 months ago
Finite time bounds for sampling based fitted value iteration
In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...
Csaba Szepesvári, Rémi Munos
ICML
2004
IEEE
15 years 12 months ago
Boosting grammatical inference with confidence oracles
In this paper we focus on the adaptation of boosting to grammatical inference. We aim at improving the performances of state merging algorithms in the presence of noisy data by us...
Jean-Christophe Janodet, Richard Nock, Marc Sebban...
VLDB
2006
ACM
162views Database» more  VLDB 2006»
15 years 11 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
ALT
2006
Springer
15 years 8 months ago
Large-Margin Thresholded Ensembles for Ordinal Regression: Theory and Practice
Abstract. We propose a thresholded ensemble model for ordinal regression problems. The model consists of a weighted ensemble of confidence functions and an ordered vector of thres...
Hsuan-Tien Lin, Ling Li