Sciweavers

59 search results - page 5 / 12
» Minimax Bounds for Active Learning
Sort
View
ICML
2008
IEEE
16 years 14 days ago
On multi-view active learning and the combination with semi-supervised learning
Multi-view learning has become a hot topic during the past few years. In this paper, we first characterize the sample complexity of multi-view active learning. Under the expansion...
Wei Wang, Zhi-Hua Zhou
JMLR
2008
117views more  JMLR 2008»
14 years 11 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
105
Voted
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 3 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
CVPR
2008
IEEE
16 years 1 months ago
A hierarchical and contextual model for aerial image understanding
In this paper we present a novel method for parsing aerial images with a hierarchical and contextual model learned in a statistical framework. We learn hierarchies at the scene an...
Jake Porway, Kristy Wang, Benjamin Yao, Song Chun ...
88
Voted
COLT
1994
Springer
15 years 3 months ago
Lower Bounds on the VC-Dimension of Smoothly Parametrized Function Classes
We examine the relationship between the VCdimension and the number of parameters of a smoothly parametrized function class. We show that the VC-dimension of such a function class ...
Wee Sun Lee, Peter L. Bartlett, Robert C. Williams...