aiqbench analysis
This research challenges the strict interpretation of the data processing inequality by demonstrating that low-level preprocessing, such as denoising and encoding, can improve classification accuracy in practical deep learning scenarios with finite training samples. The study provides a theoretical framework supported by empirical evidence showing how these pre-classification tasks yield tangible gains across varying noise levels and class distributions. For practitioners, this offers actionable insights into optimizing model performance through strategic signal enhancement before high-level decision-making stages.
Does the Data Processing Inequality Reflect Practice? On the Utility of Low-Level Tasks
arXiv:2512.21315v2 Announce Type: replace Abstract: The data processing inequality is an information-theoretic principle stating that the information content of a signal cannot be increased by processing the observations. In particular, it suggests that there is no benefit in enhancing the signal or encoding it before addressing a classification problem. This assertion can be proven to be true for the case of the optimal Bayes classifier. However, in practice, it is common to perform "low-level" tasks before "high-level" downstream tasks despite the overwhelming capabilities of modern deep neural networks. In this paper, we aim to understand when and why low-level processing can be beneficial for classification. We present a comprehensive theoretical study of a binary classification setup, where we consider a classifier that is tightly connected to the optimal Bayes classifier and converges to it as the number of training samples increases. We prove that for any finite number of training samples, there exists a pre-classification processing that improves the classification accuracy. We also explore the effect of class separation, training set size, and class balance on the relative gain from this procedure. We support our theory with an empirical investigation of the theoretical setup. Finally, we conduct an empirical study where we investigate the effect of denoising and encoding on the performance of practical deep classifiers on benchmark datasets. Specifically, we vary the size and class distribution of the training set, and the noise level, and demonstrate trends that are consistent with our theoretical results.
Title:Does the Data Processing Inequality Reflect Practice? On the Utility of Low-Level Tasks
Abstract:The data processing inequality is an information-theoretic principle stating that the information content of a signal cannot be increased by processing the observations. In particular, it suggests that there is no benefit in enhancing the signal or encoding it before addressing a classification problem. This assertion can be proven to be true for the case of the optimal Bayes classifier. However, in practice, it is common to perform "low-level" tasks before "high-level" downstream tasks despite the overwhelming capabilities of modern deep neural networks. In this paper, we aim to understand when and why low-level processing can be beneficial for classification. We present a comprehensive theoretical study of a binary classification setup, where we consider a classifier that is tightly connected to the optimal Bayes classifier and converges to it as the number of training samples increases. We prove that for any finite number of training samples, there exists a pre-classification processing that improves the classification accuracy. We also explore the effect of class separation, training set size, and class balance on the relative gain from this procedure. We support our theory with an empirical investigation of the theoretical setup. Finally, we conduct an empirical study where we investigate the effect of denoising and encoding on the performance of practical deep classifiers on benchmark datasets. Specifically, we vary the size and class distribution of the training set, and the noise level, and demonstrate trends that are consistent with our theoretical results.
ICLR 2026 (camera-ready). Code is available at: this https URL
Machine Learning (cs.LG); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (stat.ML)
arXiv:2512.21315 [cs.LG]
(or arXiv:2512.21315v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2512.21315 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 364 words
Related coverage

Researchers Find Quantum Data Loss Inequality Has Limits
Quantum Zeitgeist · Aug 18, 2026
Counterexamples to the Tensorization Property of Strong Data Processing Inequalities for Quantum Divergences
arXiv · Oct 30, 2026
Comparing Corrupted Constrained Learning Problems
arXiv · Aug 27, 2026
The Impossibility Triangle of Long-Context Modeling
arXiv · Aug 7, 2026