Compressive Statistical Learning with Random Feature Moments - CentraleSupélec Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2017

Compressive Statistical Learning with Random Feature Moments

Résumé

We describe a general framework –compressive statistical learning– for resource-efficient large-scale learning: the training collection is compressed in one pass into a low-dimensional sketch (a vector of random empirical generalized moments) that captures the information relevant to the considered learning task. A near-minimizer of the risk is computed from the sketch through the solution of a nonlinear least squares problem. We investigate sufficient sketch sizes to control the generalization error of this procedure. The framework is illustrated on compressive clustering, compressive Gaussian mixture Modeling with fixed known variance, and compressive PCA.
Fichier principal
Vignette du fichier
Compressive_learning_preprint.pdf (886.5 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01544609 , version 1 (21-06-2017)
hal-01544609 , version 2 (06-12-2017)
hal-01544609 , version 3 (16-04-2020)
hal-01544609 , version 4 (23-03-2021)
hal-01544609 , version 5 (21-06-2021)

Identifiants

Citer

Rémi Gribonval, Gilles Blanchard, Nicolas Keriven, Yann Traonmilin. Compressive Statistical Learning with Random Feature Moments. 2017. ⟨hal-01544609v1⟩
1268 Consultations
1152 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More