Sciweavers

264 search results - page 4 / 53
» Learning Linearly Separable Languages
Sort
View
ICALP
2001
Springer
13 years 10 months ago
Separating Quantum and Classical Learning
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
Rocco A. Servedio
CORR
2008
Springer
100views Education» more  CORR 2008»
13 years 5 months ago
Learning Isometric Separation Maps
Maximum Variance Unfolding (MVU) and its variants have been very successful in embedding data-manifolds in lower dimensionality spaces, often revealing the true intrinsic dimensio...
Nikolaos Vasiloglou, Alexander G. Gray, David V. A...
ICML
2006
IEEE
14 years 6 months ago
Agnostic active learning
We state and analyze the first active learning algorithm which works in the presence of arbitrary forms of noise. The algorithm, A2 (for Agnostic Active), relies only upon the ass...
Maria-Florina Balcan, Alina Beygelzimer, John Lang...
COLT
2007
Springer
13 years 12 months ago
Margin Based Active Learning
We present a framework for margin based active learning of linear separators. We instantiate it for a few important cases, some of which have been previously considered in the lite...
Maria-Florina Balcan, Andrei Z. Broder, Tong Zhang
DSP
2007
13 years 5 months ago
Blind separation of nonlinear mixtures by variational Bayesian learning
Blind separation of sources from nonlinear mixtures is a challenging and often ill-posed problem. We present three methods for solving this problem: an improved nonlinear factor a...
Antti Honkela, Harri Valpola, Alexander Ilin, Juha...