Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Sketching Datasets for Large-Scale Learning (long version)

Abstract : This article considers "sketched learning," or "compressive learning," an approach to large-scale machine learning where datasets are massively compressed before learning (e.g., clustering, classification, or regression) is performed. In particular, a "sketch" is first constructed by computing carefully chosen nonlinear random features (e.g., random Fourier features) and averaging them over the whole dataset. Parameters are then learned from the sketch, without access to the original dataset. This article surveys the current state-of-the-art in sketched learning, including the main concepts and algorithms, their connections with established signal-processing methods, existing theoretical guarantees-on both information preservation and privacy preservation, and important open problems.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas
Contributor : Rémi Gribonval <>
Submitted on : Tuesday, August 4, 2020 - 9:34:09 PM
Last modification on : Thursday, September 24, 2020 - 8:44:02 AM


Files produced by the author(s)


  • HAL Id : hal-02909766, version 1
  • ARXIV : 2008.01839


Rémi Gribonval, Antoine Chatalic, Nicolas Keriven, Vincent Schellekens, Laurent Jacques, et al.. Sketching Datasets for Large-Scale Learning (long version). 2020. ⟨hal-02909766⟩



Record views


Files downloads