Sciweavers

683 search results - page 68 / 137
» Generalization Bounds for Learning Kernels
Sort
View
FOCS
2005
IEEE
15 years 9 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks
JMLR
2008
117views more  JMLR 2008»
15 years 3 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
JMLR
2010
125views more  JMLR 2010»
14 years 10 months ago
Regret Bounds for Gaussian Process Bandit Problems
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
Steffen Grünewälder, Jean-Yves Audibert,...
ICPR
2002
IEEE
15 years 8 months ago
Motion Prediction Using VC-Generalization Bounds
This paper describes a novel application of Statistical Learning Theory (SLT) for motion prediction. SLT provides analytical VC-generalization bounds for model selection; these bo...
Harry Wechsler, Zoran Duric, Fayin Li, Vladimir Ch...
IJCNN
2000
IEEE
15 years 8 months ago
VC Dimension Bounds for Product Unit Networks
A product unit is a formal neuron that multiplies its input values instead of summingthem. Furthermore, it has weights acting as exponents instead of being factors. We investigate...
Michael Schmitt