Compressive Statistical Learning with Random Feature Moments

Abstract : 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.
Complete list of metadatas

Cited literature [79 references]  Display  Hide  Download

https://hal.inria.fr/hal-01544609
Contributor : Rémi Gribonval <>
Submitted on : Wednesday, June 21, 2017 - 7:40:50 PM
Last modification on : Friday, September 13, 2019 - 9:50:02 AM
Long-term archiving on : Sunday, December 17, 2017 - 7:41:04 PM

Files

Compressive_learning_preprint....
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01544609, version 1
  • ARXIV : 1706.07180

Citation

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

Share

Metrics

Record views

592

Files downloads

129