Sciweavers

801 search results - page 6 / 161
» Machine Learning with Data Dependent Hypothesis Classes
Sort
View
ICANN
2009
Springer
14 years 1 days ago
Learning SVMs from Sloppily Labeled Data
This paper proposes a modelling of Support Vector Machine (SVM) learning to address the problem of learning with sloppy labels. In binary classification, learning with sloppy labe...
Guillaume Stempfel, Liva Ralaivola
ICML
2010
IEEE
13 years 8 months ago
Interactive Submodular Set Cover
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
Andrew Guillory, Jeff Bilmes
FUIN
2008
76views more  FUIN 2008»
13 years 7 months ago
Prescribed Learning of Indexed Families
Abstract. This work extends studies of Angluin, Lange and Zeugmann on how learnability of a language class depends on the hypothesis space used by the learner. While previous studi...
Sanjay Jain, Frank Stephan, Nan Ye
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 7 months ago
PAC Learning Mixtures of Axis-Aligned Gaussians with No Separation Assumption
Abstract. We propose and analyze a new vantage point for the learning of mixtures of Gaussians: namely, the PAC-style model of learning probability distributions introduced by Kear...
Jon Feldman, Ryan O'Donnell, Rocco A. Servedio
EUROCOLT
1997
Springer
13 years 11 months ago
Ordinal Mind Change Complexity of Language Identification
The approach of ordinal mind change complexity, introduced by Freivalds and Smith, uses (notations for) constructive ordinals to bound the number of mind changes made by a learnin...
Andris Ambainis, Sanjay Jain, Arun Sharma