Sciweavers

82 search results - page 13 / 17
» On Exact Learning from Random Walk
Sort
View
ICML
2004
IEEE
16 years 2 months ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh
ALT
2006
Springer
15 years 10 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 7 months ago
Learning noise
In this paper we propose a genetic programming approach to learning stochastic models with unsymmetrical noise distributions. Most learning algorithms try to learn from noisy data...
Michael D. Schmidt, Hod Lipson
NAACL
2010
14 years 11 months ago
Hitting the Right Paraphrases in Good Time
We present a random-walk-based approach to learning paraphrases from bilingual parallel corpora. The corpora are represented as a graph in which a node corresponds to a phrase, an...
Stanley Kok, Chris Brockett
DCOSS
2006
Springer
15 years 5 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama