paper-with-me

Papers

The Pick-to-Learn Algorithm: Empowering Compression for Tight Generalization Bounds and Improved Post-training Performance

2023-09-21 · NeurIPS 2023 11

Generalization bounds are valuable both for theory and applications. On the one hand, they shed light on the mechanisms that underpin the learning processes; on the other, they certify how well a learned model performs against unseen inputs. In this work we build upon a recent breakthrough in compression theory to develop a new framework yielding tight generalization bounds of wide practical applicability. The core idea is to embed any given learning algorithm into a suitably-constructed meta-algorithm (here called Pick-to-Learn, P2L) in order to instill desirable compression properties. When applied to the MNIST classification dataset and to a synthetic regression problem, P2L not only attains generalization bounds that compare favorably with the state of the art (test-set and PAC-Bayes bounds), but it also learns models with better post-training performance.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Sample Compression Unleashed: New Generalization Bounds for Real Valued Losses

2024-09-26 · Mathieu Bazinet, Valentina Zantedeschi, Pascal Germain

The sample compression theory provides generalization guarantees for predictors that can be fully defined using a subset of the training dataset and a (short) message string, generally defined as a binary sequence. Previ…

Generalization Boundsvalid

BPE Gets Picky: Efficient Vocabulary Refinement During Tokenizer Training

2024-09-06 · Pavel Chizhov, Catherine Arnett, Elizaveta Korotkova, Ivan P. Yamshchikov

Language models can largely benefit from efficient tokenization. However, they still mostly utilize the classical BPE algorithm, a simple and reliable method. This has been shown to cause such issues as under-trained tok…

Text Compression

Sample Compression for Continual Learning

2025-03-13 · Jacob Comeau, Mathieu Bazinet, Pascal Germain, Cem Subakan

Continual learning algorithms aim to learn from a sequence of tasks, making the training distribution non-stationary. The majority of existing continual learning approaches in the literature rely on heuristics and do not…

Continual Learning

3D Compression Using Neural Fields

2023-11-21 · Janis Postels, Yannick Strümpler, Klara Reichard, Luc van Gool 외

Neural Fields (NFs) have gained momentum as a tool for compressing various data modalities - e.g. images and videos. This work leverages previous advances and proposes a novel NF-based compression algorithm for 3D data. …

Attribute

L-GreCo: Layerwise-Adaptive Gradient Compression for Efficient and Accurate Deep Learning

2022-10-31 · Mohammadreza Alimohammadi, Ilia Markov, Elias Frantar, Dan Alistarh

Data-parallel distributed training of deep neural networks (DNN) has gained very widespread adoption, but can still experience communication bottlenecks. To address this issue, entire families of compression mechanisms h…

image-classificationImage ClassificationLanguage ModelingLanguage Modelling+1