Compressive Meta-Learning
The rapid expansion in the size of new datasets has created a need for fast and efficient parameter-learning techniques.Compressive learning is a framework that enables efficient processing by using random, nonlinear features to project large-scale databases onto compact, information-preserving representations whose dimensionality is independent of the number of samples and can be easily stored, transferred, and processed.These database-level summaries are then used to decode parameters of interest from the underlying data distribution without requiring access to the original samples, offering an efficient and privacy-friendly learning framework.However, both the encoding and decoding techniques are typically randomized and data-independent, failing to exploit the underlying structure of the data.In this work, we propose a framework that meta-learns both the encoding and decoding stages of compressive learning methods by using neural networks that provide faster and more accurate systems than the current state-of-the-art approaches.To demonstrate the potential of the presented Compressive Meta-Learning framework, we explore multiple applications-including neural network-based compressive PCA, compressive ridge regression, compressive k-means, and autoencoders.
Authors
- Alexander G. Ioannidis (ORCID: https://orcid.org/0000-0002-4735-7803)
- Xavier Giró-i-Nieto (ORCID: https://orcid.org/0000-0002-9935-5332)
- David Bonet (ORCID: https://orcid.org/0000-0001-7493-2239)
- Daniel Mas Montserrat (ORCID: https://orcid.org/0000-0002-7946-7724)
- Maria Perera
Institutions
- University of California, Santa Cruz (US)
- Universitat Politècnica de Catalunya (ES)
- Stanford University (US)
Publication Details
- Published
- 2025-08-03
- DOI
- https://doi.org/10.1145/3711896.3736889
- Citations
- 1
- Primary Topic
- Domain Adaptation and Few-Shot Learning
- Type
- article
- Field-Weighted Citation Impact
- 2.48