Minimum Description Length

Also known as MDL

Overview

MDL studies how to choose explanations that balance fit to observed data against the complexity of the model, using the idea that a good explanation can be encoded concisely. Common approaches include two-part codes, normalized maximum likelihood, prequential coding, and code-length penalties for tasks such as causal discovery, clustering, and symbolic regression. In machine learning, researchers also use compression to analyze generalization, reuse skills, and compare models across high-dimensional or misspecified settings. A central tension is that compression can favor models that generalize, but results depend on the code and optimization procedure, and excessive complexity penalties can lead to underfitting.

Latest papers

CardsList

17 papers2 papers in the last four weeks, against 2 the four weeks before. 0.0% of all new papers.

  1. Does Compression Imply Generalization? A Minimum Description Length Perspective

    Oct 15, 2026Lincen Yang, Jiayang Shi, Nan Pu +4Neural Network GeneralizationGeneralization Bounds

  2. An Introduction to Compression-Based Machine Learning

    Sep 18, 2026John Hurwitz, Edward Raff, Charles K. NicholasMinimum Description Length

  3. Stochastic complexity of vectors containing cluster structure

    Aug 31, 2026Daniel Nicorici, Olli Yli-Harja, Jaakko AstolaMinimum Description LengthClustering

  4. A Unified Descriptive-Complexity Framework for Model Selection under Correlated Designs

    Aug 27, 2026Yanhang Zhang, Wei Liu, Yuhong YangModel SelectionStatistical Learning Theory

  5. High-dimensional networks and mean squared error for possibly misspecified models

    Aug 13, 2026Lourens WaldorpModel SelectionMinimum Description Length

  6. FedSLIM: Privacy-Preserving Federated MDL-Based Descriptive Pattern Mining Across Data Silos

    Jul 25, 2026Samar Samir Khalil, Noha S. Tawfik, Marco SpruitMinimum Description LengthPrivacy-Preserving ML

  7. MDL Meets Latent Confounders: LNML-based Causal Discovery

    Jul 5, 2026Zhongyi Que, Shin Matsushima, Kenji YamanishiMinimum Description LengthCausal Discovery

  8. The Information-Theoretic Benefit of Shared Representations under Orthogonality Constraints

    Jun 14, 2026Thomas Dittrich, Oliver Potocki, Philipp GrohsShared Representation LearningRepresentation Learning

  9. What Fits (Into Few Tokens) Doesn't Overfit: Compression and Generalization in ML Research Agents

    Jun 9, 2026Martin Andres Bertran, Aaron Roth, Zhiwei Steven WuMinimum Description LengthBenchmark Contamination

  10. Prediction Under Imperfect Compression: A Theory of Approximate MDL

    Jun 3, 2026Qian Li, Xinyu Mao, Shang-Hua Teng +1Minimum Description LengthApproximation Algorithms

  11. Central Description Length (CDL) Clustering Validation Index

    Jun 2, 2026Mahdi Shamsi, Soosan BeheshtiMinimum Description LengthClustering

  12. Skill Reuse as Compression in Agentic RL

    May 29, 2026Zhikun Xu, Yu Feng, Jacob Dineen +3Agentic RLMinimum Description Length

  13. Guiding Multi-Objective Genetic Programming with Description Length Improves Symbolic Regression Solutions

    May 21, 2026Gabriel Kronberger, Fabricio Olivetti de Franca, Deaglan J. Bartlett +2Minimum Description LengthGenetic Programming

  14. Bivariate Causal Discovery Using Rate-Distortion MDL: An Information Dimension Approach

    Apr 7, 2026Tiago Brogueira, Mário A. T. FigueiredoCausal DiscoveryMinimum Description Length

  15. A Geometrically-Grounded Drive for MDL-Based Optimization in Deep Learning

    Mar 12, 2026Ming Lei, Shufan Wu, Christophe BaehrDeep Learning OptimizationMinimum Description Length