Fast rates for noisy clustering - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Fast rates for noisy clustering



The effect of errors in variables in empirical minimization is investigated. Given a loss $l$ and a set of decision rules $\mathcal{G}$, we prove a general upper bound for an empirical minimization based on a deconvolution kernel and a noisy sample $Z_i=X_i+\epsilon_i,i=1,\ldots,n$. We apply this general upper bound to give the rate of convergence for the expected excess risk in noisy clustering. A recent bound from \citet{levrard} proves that this rate is $\mathcal{O}(1/n)$ in the direct case, under Pollard's regularity assumptions. Here the effect of noisy measurements gives a rate of the form $\mathcal{O}(1/n^{\frac{\gamma}{\gamma+2\beta}})$, where $\gamma$ is the Hölder regularity of the density of $X$ whereas $\beta$ is the degree of illposedness.
Fichier principal
Vignette du fichier
noisyclustering.pdf (172.9 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00695258 , version 1 (07-05-2012)



Sébastien Loustau. Fast rates for noisy clustering. 2012. ⟨hal-00695258⟩
203 View
92 Download



Gmail Facebook Twitter LinkedIn More