Generalization error bounds in semi-supervised classification under the cluster assumption
Philippe Rigollet
Abstract
We consider semi-supervised classification when part of the available data is unlabeled. These unlabeled data can be useful for the classification problem when we make an assumption relating the behavior of the regression function to that of the marginal distribution. Seeger (2000) proposed the well-known "cluster assumption" as a reasonable one. We propose a mathematical formulation of this assumption and a method based on density level sets estimation that takes advantage of it to achieve fast rates of convergence both in the number of unlabeled examples and the number of labeled examples.
Create a lesson
Related papers
Minimax signal detection in regression under differential privacy
Elly K. H. Hung
A Tetration Distribution
Micah Thornton
Multi-modal Laplace-based sampling
Maxime Egéa, Hanyue Gu, Daniel Rudolf et al.
Studentized inference in randomized experiments when a few units dominate the outcome variation
Xinyuan Chen, Jonathan W. Kiesel, Jonathan R. Woody
Nonparametric Intensity Estimation for Covariate-Driven Poisson Processes Using Deep Learning
Atsutomo Yara, Yoshikazu Terada
Specification LASSO and a Flexible Characteristics-Based Asset Pricing Model
Chaohua Dong, Shuyi Ge, Shaoran Li et al.