EUVIMEDEUVIMED entdecken
Crossref

Compressive statistical learning with random feature moments

Rémi Gribonval, Gilles Blanchard, Nicolas Keriven, Yann Traonmilin

Mathematical Statistics and Learning · 2021

DOI: 10.4171/msl/20 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematical Statistics and Learning, 2021. Verfasst von Rémi Gribonval und 3 weiteren Autor:innen. Die Arbeit wurde bisher 16-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 PCA, compressive clustering, and compressive Gaussian mixture Modeling with fixed known variance. The latter two are further developed in a companion paper.

Zitieren

APA

Gribonval, R., Blanchard, G., Keriven, N., & Traonmilin, Y. (2021). Compressive statistical learning with random feature moments. Mathematical Statistics and Learning. https://doi.org/10.4171/msl/20

Vancouver

Gribonval R, Blanchard G, Keriven N, Traonmilin Y. Compressive statistical learning with random feature moments. Mathematical Statistics and Learning. 2021. doi:10.4171/msl/20

BibTeX
@article{Gribonval2021,
  author = {Gribonval, Rémi and Blanchard, Gilles and Keriven, Nicolas and Traonmilin, Yann},
  title = {Compressive statistical learning with random feature moments},
  journal = {Mathematical Statistics and Learning},
  year = {2021},
  doi = {10.4171/msl/20}
}
Kostenlos starten →