English
Related papers

Related papers: Information Losses in Neural Classifiers from Samp…

200 papers

The goal of lossy data compression is to reduce the storage cost of a data set $X$ while retaining as much information as possible about something ($Y$) that you care about. For example, what aspects of an image $X$ contain the most…

Machine Learning · Computer Science 2020-01-16 Max Tegmark , Tailin Wu

Understanding and controlling the informational complexity of neural networks is a central challenge in machine learning, with implications for generalization, optimization, and model capacity. While most approaches rely on entropy-based…

Class incremental learning consists in training discriminative models to classify an increasing number of classes over time. However, doing so using only the newly added class data leads to the known problem of catastrophic forgetting of…

Machine Learning · Computer Science 2024-05-15 Quentin Ferdinand , Gilles Le Chenadec , Benoit Clement , Panagiotis Papadakis , Quentin Oliveau

Imitation learning holds the promise of equipping robots with versatile skills by learning from expert demonstrations. However, policies trained on finite datasets often struggle to generalize beyond the training distribution. In this work,…

Machine Learning · Computer Science 2025-04-28 Yixiao Wang

Meta-learning automatically infers an inductive bias by observing data from a number of related tasks. The inductive bias is encoded by hyperparameters that determine aspects of the model class or training algorithm, such as initialization…

Machine Learning · Computer Science 2020-11-10 Sharu Theresa Jose , Osvaldo Simeone , Giuseppe Durisi

Dimensionality reduction, a form of compression, can simplify representations of information to increase efficiency and reveal general patterns. Yet, this simplification also forfeits information, thereby reducing representational capacity.…

Compressing giant neural networks has gained much attention for their extensive applications on edge devices such as cellphones. During the compressing process, one of the most important procedures is to retrain the pre-trained models using…

Machine Learning · Computer Science 2019-12-23 Yehui Tang , Shan You , Chang Xu , Boxin Shi , Chao Xu

Exponential models of distributions are widely used in machine learning for classiffication and modelling. It is well known that they can be interpreted as maximum entropy models under empirical expectation constraints. In this work, we…

Machine Learning · Computer Science 2012-07-19 Amir Globerson , Naftali Tishby

This article studies the achievable guarantees on the error rates of certain learning algorithms, with particular focus on refining logarithmic factors. Many of the results are based on a general technique for obtaining bounds on the error…

Machine Learning · Computer Science 2016-09-13 Steve Hanneke

Over the last few years, machine learning unlocked previously infeasible features for compression, such as providing guarantees for users' privacy or tailoring compression to specific data statistics (e.g., satellite images or audio…

Information Theory · Computer Science 2026-03-25 Gergely Flamich

This paper is dedicated to an efficient compression of weights and optimizer states (called checkpoints) obtained at different stages during a neural network training process. First, we propose a prediction-based compression approach, where…

Machine Learning · Computer Science 2025-06-16 Yuriy Kim , Evgeny Belyaev

Plasticity, the ability of a neural network to quickly change its predictions in response to new information, is essential for the adaptability and robustness of deep reinforcement learning systems. Deep neural networks are known to lose…

Machine Learning · Computer Science 2023-11-28 Clare Lyle , Zeyu Zheng , Evgenii Nikishin , Bernardo Avila Pires , Razvan Pascanu , Will Dabney

The deployment of Large Language Models (LLMs) in long-context scenarios is hindered by computational inefficiency and significant information redundancy. Although recent advancements have widely adopted context compression to address these…

Computation and Language · Computer Science 2026-02-03 Kangtao Lv , Jiwei Tang , Langming Liu , Haibin Chen , Weidong Zhang , Shilei Liu , Yongwei Wang , Yujin Yuan , Wenbo Su , Bo Zheng

For a language model (LM) to faithfully model human language, it must compress vast, potentially infinite information into relatively few dimensions. We propose analyzing compression in (pre-trained) LMs from two points of view: geometric…

Computation and Language · Computer Science 2023-11-10 Emily Cheng , Corentin Kervadec , Marco Baroni

The problem of statistical learning is to construct an accurate predictor of a random variable as a function of a correlated random variable on the basis of an i.i.d. training sample from their joint distribution. Allowable predictors are…

Information Theory · Computer Science 2009-04-30 Maxim Raginsky

Classification margins are commonly used to estimate the generalization ability of machine learning models. We present an empirical study of these margins in artificial neural networks. A global estimate of margin size is usually used in…

Machine Learning · Computer Science 2023-02-15 Marthinus W. Theunissen , Coenraad Mouton , Marelie H. Davel

Analyses of transformer-based models have shown that they encode a variety of linguistic information from their textual input. While these analyses have shed a light on the relation between linguistic information on one side, and internal…

Computation and Language · Computer Science 2024-07-26 Vivi Nastase , Paola Merlo

Deep learning has transformed computer vision, natural language processing, and speech recognition\cite{badrinarayanan2017segnet, dong2016image, ren2017faster, ji20133d}. However, two critical questions remain obscure: (1) why do deep…

Machine Learning · Statistics 2018-10-03 Jingwei Zhang , Tongliang Liu , Dacheng Tao

Neural-network-based compressors have proven to be remarkably effective at compressing sources, such as images, that are nominally high-dimensional but presumed to be concentrated on a low-dimensional manifold. We consider a continuous-time…

Information Theory · Computer Science 2020-11-11 Aaron B. Wagner , Johannes Ballé

Current discrete randomness and information conservation inequalities are over total recursive functions, i.e. restricted to deterministic processing. This restriction implies that an algorithm can break algorithmic randomness conservation…

Computational Complexity · Computer Science 2013-10-15 Samuel Epstein