Sciweavers

3837 search results - page 72 / 768
» Learning Approximate Consistencies
Sort
View
COLT
2010
Springer
14 years 12 months ago
Sparse Recovery in Convex Hulls of Infinite Dictionaries
Let S be an arbitrary measurable space, T R and (X, Y ) be a random couple in S
Vladimir Koltchinskii, Stas Minsker
99
Voted
ICML
2006
IEEE
16 years 2 months ago
Clustering documents with an exponential-family approximation of the Dirichlet compound multinomial distribution
The Dirichlet compound multinomial (DCM) distribution, also called the multivariate Polya distribution, is a model for text documents that takes into account burstiness: the fact ...
Charles Elkan
JCP
2007
143views more  JCP 2007»
15 years 1 months ago
Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
Nicolas Chapados, Yoshua Bengio
EMNLP
2010
14 years 12 months ago
Turbo Parsers: Dependency Parsing by Approximate Variational Inference
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
André F. T. Martins, Noah A. Smith, Eric P....
IJCAI
2003
15 years 3 months ago
Finite Domain Constraint Solver Learning
paper, we present an abstract framework for learning a finite domain constraint solver modeled by a set of operators enforcing a consistency. The behavior of the consistency to be...
Arnaud Lallouet, Thi-Bich-Hanh Dao, Andrei Legtche...