{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/mdl","slug":"mdl","name":"MDL","full_name":"Minimum Description Length","full_name_withheld":false,"description_markdown":"**Minimum Description Length** provides a criterion for the selection of models, regardless of their complexity, without the restrictive assumption that the data form a sample from a 'true' distribution.\r\n\r\nExtracted from [scholarpedia](http://scholarpedia.org/article/Minimum_description_length)\r\n\r\n**Source**:\r\n\r\nPaper: [J. Rissanen (1978) Modeling by the shortest data description. Automatica 14, 465-471](https://doi.org/10.1016/0005-1098(78)90005-5)\r\n\r\nBook: [P. D. Grünwald (2007) The Minimum Description Length Principle, MIT Press, June 2007, 570 pages](https://ieeexplore.ieee.org/servlet/opac?bknumber=6267274)","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"AutoML","url":"/methods/category/automl","pwc_aliases":[]}],"n_papers_tagged":97,"archive_num_papers":97,"papers_newest_first":[{"paper":null,"slug":"bridging-predictive-coding-and-mdl-a-two-part","title":"Bridging Predictive Coding and MDL: A Two-Part Code Framework for Deep Learning","date":"2025-05-20","arxiv_id":"2505.14635","n_code_links":0,"syntology":null},{"paper":"/paper/a-minimum-description-length-approach-to","slug":"a-minimum-description-length-approach-to","title":"A Minimum Description Length Approach to Regularization in Neural Networks","date":"2025-05-19","arxiv_id":"2505.13398","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["taucompling/mdl-reg-approach"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"minimum-description-length-of-a-spectrum","title":"A Theory of Machine Understanding via the Minimum Description Length Principle","date":"2025-04-01","arxiv_id":"2504.00395","n_code_links":0,"syntology":null},{"paper":null,"slug":"materials-map-integrating-experimental-and","title":"A Materials Map Integrating Experimental and Computational Data via Graph-Based Machine Learning for Enhanced Materials Discovery","date":"2025-03-10","arxiv_id":"2503.07378","n_code_links":0,"syntology":null},{"paper":null,"slug":"comparative-analysis-of-mdl-vae-vs-standard","title":"Comparative Analysis of MDL-VAE vs. Standard VAE on 202 Years of Gynecological Data","date":"2025-02-25","arxiv_id":"2502.18412","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-calibration-in-multi-distribution-learning","title":"On Calibration in Multi-Distribution Learning","date":"2024-12-18","arxiv_id":"2412.14142","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-robust-clustering-framework-combining","title":"AdaptiveMDL-GenClust: A Robust Clustering Framework Integrating Normalized Mutual Information and Evolutionary Algorithms","date":"2024-11-26","arxiv_id":"2412.05305","n_code_links":0,"syntology":null},{"paper":null,"slug":"interpretability-as-compression-reconsidering","title":"Interpretability as Compression: Reconsidering SAE Explanations of Neural Activations with MDL-SAEs","date":"2024-10-15","arxiv_id":"2410.11179","n_code_links":0,"syntology":null},{"paper":null,"slug":"neural-networks-generalize-on-low-complexity","title":"Neural Networks Generalize on Low Complexity Data","date":"2024-09-19","arxiv_id":"2409.12446","n_code_links":0,"syntology":null},{"paper":null,"slug":"hierarchical-graph-pooling-based-on-minimum","title":"MDL-Pool: Adaptive Multilevel Graph Pooling Based on Minimum Description Length","date":"2024-09-16","arxiv_id":"2409.10263","n_code_links":0,"syntology":null},{"paper":null,"slug":"2408-02686","title":"A Systematic Review of Intermediate Fusion in Multimodal Deep Learning for Biomedical Applications","date":"2024-08-02","arxiv_id":"2408.02686","n_code_links":0,"syntology":null},{"paper":null,"slug":"coding-for-intelligence-from-the-perspective","title":"Coding for Intelligence from the Perspective of Category","date":"2024-07-01","arxiv_id":"2407.01017","n_code_links":0,"syntology":null},{"paper":null,"slug":"disentangled-representation-with-cross","title":"Crocodile: Cross Experts Covariance for Disentangled Learning in Multi-Domain Recommendation","date":"2024-05-21","arxiv_id":"2405.12706","n_code_links":0,"syntology":null},{"paper":"/paper/probabilistic-truly-unordered-rule-sets","slug":"probabilistic-truly-unordered-rule-sets","title":"Probabilistic Truly Unordered Rule Sets","date":"2024-01-18","arxiv_id":"2401.09918","n_code_links":1,"syntology":null},{"paper":null,"slug":"skin-cancer-diagnosis-using-nir-spectroscopy","title":"Skin cancer diagnosis using NIR spectroscopy data of skin lesions in vivo using machine learning algorithms","date":"2024-01-02","arxiv_id":"2401.01200","n_code_links":0,"syntology":null},{"paper":null,"slug":"distribution-dependent-rates-for-multi","title":"Distribution-Dependent Rates for Multi-Distribution Learning","date":"2023-12-20","arxiv_id":"2312.13130","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimal-multi-distribution-learning","title":"Optimal Multi-Distribution Learning","date":"2023-12-08","arxiv_id":"2312.05134","n_code_links":0,"syntology":null},{"paper":"/paper/exploring-the-hierarchical-structure-of-human","slug":"exploring-the-hierarchical-structure-of-human","title":"Exploring the hierarchical structure of human plans via program generation","date":"2023-11-30","arxiv_id":"2311.18644","n_code_links":2,"syntology":null},{"paper":null,"slug":"bridging-algorithmic-information-theory-and","title":"Bridging Algorithmic Information Theory and Machine Learning: A New Approach to Kernel Learning","date":"2023-11-21","arxiv_id":"2311.12624","n_code_links":0,"syntology":null},{"paper":null,"slug":"improved-mdl-estimators-using-fiber-bundle-of","title":"Improved MDL Estimators Using Fiber Bundle of Local Exponential Families for Non-exponential Families","date":"2023-11-07","arxiv_id":"2311.03852","n_code_links":0,"syntology":null},{"paper":null,"slug":"kg-mdl-mining-graph-patterns-in-knowledge","title":"KG-MDL: Mining Graph Patterns in Knowledge Graphs with the MDL Principle","date":"2023-09-22","arxiv_id":"2309.12908","n_code_links":0,"syntology":null},{"paper":null,"slug":"decoupled-training-return-of-frustratingly","title":"Decoupled Training: Return of Frustratingly Easy Multi-Domain Learning","date":"2023-09-19","arxiv_id":"2309.10302","n_code_links":0,"syntology":null},{"paper":null,"slug":"variational-density-propagation-continual","title":"Variational Density Propagation Continual Learning","date":"2023-08-22","arxiv_id":"2308.11801","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-scoping-review-on-multimodal-deep-learning","title":"A scoping review on multimodal deep learning in biomedical images and texts","date":"2023-07-14","arxiv_id":"2307.07362","n_code_links":0,"syntology":null},{"paper":"/paper/generating-parametric-brdfs-from-natural","slug":"generating-parametric-brdfs-from-natural","title":"Generating Parametric BRDFs from Natural Language Descriptions","date":"2023-06-19","arxiv_id":"2306.15679","n_code_links":1,"syntology":null},{"paper":null,"slug":"perturbation-based-two-stage-multi-domain","title":"Perturbation-Based Two-Stage Multi-Domain Active Learning","date":"2023-06-19","arxiv_id":"2306.10700","n_code_links":0,"syntology":null},{"paper":"/paper/the-whole-is-greater-than-the-sum-of-its-3","slug":"the-whole-is-greater-than-the-sum-of-its-3","title":"The Whole Is Greater than the Sum of Its Parts: Improving Music Source Separation by Bridging Network","date":"2023-05-13","arxiv_id":"2305.07855","n_code_links":1,"syntology":null},{"paper":null,"slug":"multi-domain-learning-from-insufficient","title":"Multi-Domain Learning From Insufficient Annotations","date":"2023-05-04","arxiv_id":"2305.02757","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-comprehensive-and-versatile-multimodal-deep","title":"A Comprehensive and Versatile Multimodal Deep Learning Approach for Predicting Diverse Properties of Advanced Materials","date":"2023-03-29","arxiv_id":"2303.16412","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-the-finer-things-bayesian-structure","title":"Learning the Finer Things: Bayesian Structure Learning at the Instantiation Level","date":"2023-03-08","arxiv_id":"2303.04339","n_code_links":0,"syntology":null},{"paper":null,"slug":"computing-formation-enthalpies-through-an","title":"Computing formation enthalpies through an explainable machine learning method: the case of Lanthanide Orthophosphates solid solutions","date":"2023-03-07","arxiv_id":"2303.03748","n_code_links":0,"syntology":null},{"paper":null,"slug":"evaluating-representations-with-readout-model","title":"Evaluating Representations with Readout Model Switching","date":"2023-02-19","arxiv_id":"2302.09579","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-and-fully-automated-histograms-for-large","title":"Fast and fully-automated histograms for large-scale data sets","date":"2022-12-27","arxiv_id":"2212.13524","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-timescale-event-detection-in","title":"Multi-timescale Event Detection in Nonintrusive Load Monitoring based on MDL Principle","date":"2022-11-19","arxiv_id":"2211.10721","n_code_links":0,"syntology":null},{"paper":null,"slug":"sequential-learning-of-neural-networks-for","title":"Sequential Learning Of Neural Networks for Prequential MDL","date":"2022-10-14","arxiv_id":"2210.07931","n_code_links":0,"syntology":null},{"paper":null,"slug":"minimum-description-length-control","title":"Minimum Description Length Control","date":"2022-07-17","arxiv_id":"2207.08258","n_code_links":0,"syntology":null},{"paper":null,"slug":"mask-guided-divergence-loss-improves-the","title":"Improving the Robustness and Generalization of Deep Neural Network with Confidence Threshold Reduction","date":"2022-06-02","arxiv_id":"2206.00913","n_code_links":0,"syntology":null},{"paper":null,"slug":"rotated-object-detection-via-scale-invariant","title":"Rotated Object Detection via Scale-invariant Mahalanobis Distance in Aerial Images","date":"2022-04-02","arxiv_id":"2204.00840","n_code_links":0,"syntology":null},{"paper":null,"slug":"extending-the-use-of-mdl-for-high-dimensional","title":"Extending the Use of MDL for High-Dimensional Problems: Variable Selection, Robust Fitting, and Additive Modeling","date":"2022-01-26","arxiv_id":"2201.11171","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-whole-and-the-parts-the-mdl-principle-and","title":"The whole and the parts: the MDL principle and the a-contrario framework","date":"2021-12-13","arxiv_id":"2112.06853","n_code_links":0,"syntology":null},{"paper":"/paper/first-steps-of-an-approach-to-the-arc","slug":"first-steps-of-an-approach-to-the-arc","title":"First Steps of an Approach to the ARC Challenge based on Descriptive Grid Models and the Minimum Description Length Principle","date":"2021-12-01","arxiv_id":"2112.00848","n_code_links":1,"syntology":null},{"paper":null,"slug":"rethinking-hard-parameter-sharing-in-multi","title":"Rethinking Hard-Parameter Sharing in Multi-Domain Learning","date":"2021-07-23","arxiv_id":"2107.11359","n_code_links":0,"syntology":null},{"paper":null,"slug":"prequential-mdl-for-causal-structure-learning","title":"Prequential MDL for Causal Structure Learning with Neural Networks","date":"2021-07-02","arxiv_id":"2107.05481","n_code_links":0,"syntology":null},{"paper":"/paper/multi-domain-active-learning-a-comparative","slug":"multi-domain-active-learning-a-comparative","title":"Multi-Domain Active Learning: Literature Review and Comparative Study","date":"2021-06-25","arxiv_id":"2106.13516","n_code_links":1,"syntology":null},{"paper":"/paper/robust-subgroup-discovery","slug":"robust-subgroup-discovery","title":"Robust subgroup discovery","date":"2021-03-25","arxiv_id":"2103.13686","n_code_links":2,"syntology":null},{"paper":null,"slug":"pac-learning-gains-of-turing-machines-over","title":"PAC-learning gains of Turing machines over circuits and neural networks","date":"2021-03-23","arxiv_id":"2103.12686","n_code_links":0,"syntology":null},{"paper":"/paper/rissanen-data-analysis-examining-dataset","slug":"rissanen-data-analysis-examining-dataset","title":"Rissanen Data Analysis: Examining Dataset Characteristics via Description Length","date":"2021-03-05","arxiv_id":"2103.03872","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["ethanjperez/rda"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":null,"slug":"multi-domain-learning-by-meta-learning-taking","title":"Multi-Domain Learning by Meta-Learning: Taking Optimal Steps in Multi-Domain Loss Landscapes by Inner-Loop Learning","date":"2021-02-25","arxiv_id":"2102.13147","n_code_links":0,"syntology":null},{"paper":"/paper/mapping-network-states-using-connectivity","slug":"mapping-network-states-using-connectivity","title":"Mapping Network States Using Connectivity Queries","date":"2020-12-07","arxiv_id":"2012.03413","n_code_links":1,"syntology":null},{"paper":null,"slug":"mint-mdl-based-approach-for-mining","title":"Mint: MDL-based approach for Mining INTeresting Numerical Pattern Sets","date":"2020-11-30","arxiv_id":"2011.14843","n_code_links":0,"syntology":null},{"paper":null,"slug":"detecting-hierarchical-changes-in-latent","title":"Detecting Hierarchical Changes in Latent Variable Models","date":"2020-11-18","arxiv_id":"2011.09465","n_code_links":0,"syntology":null},{"paper":null,"slug":"experimental-validation-of-mdl-emulation-and","title":"Experimental validation of MDL emulation and estimation techniques for SDM transmission systems","date":"2020-10-29","arxiv_id":"2010.15496","n_code_links":0,"syntology":null},{"paper":"/paper/all-for-one-and-one-for-all-improving-music","slug":"all-for-one-and-one-for-all-improving-music","title":"All for One and One for All: Improving Music Separation by Bridging Networks","date":"2020-10-08","arxiv_id":"2010.04228","n_code_links":5,"syntology":{"ran":8,"of":10,"n_ran_checked":8,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["asteroid-team/asteroid"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/more-diverse-means-better-multimodal-deep","slug":"more-diverse-means-better-multimodal-deep","title":"More Diverse Means Better: Multimodal Deep Learning Meets Remote Sensing Imagery Classification","date":"2020-08-12","arxiv_id":"2008.05457","n_code_links":1,"syntology":null},{"paper":null,"slug":"improving-performance-of-relation-extraction","title":"Improving Performance of Relation Extraction Algorithm via Leveled Adversarial PCNN and Database Expansion","date":"2020-07-29","arxiv_id":"2007.15084","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-minimum-description-length-principle-for","title":"The Minimum Description Length Principle for Pattern Mining: A Survey","date":"2020-07-28","arxiv_id":"2007.14009","n_code_links":0,"syntology":null},{"paper":null,"slug":"what-and-where-learn-to-plug-adapters-via-nas","title":"What and Where: Learn to Plug Adapters via NAS for Multi-Domain Learning","date":"2020-07-24","arxiv_id":"2007.12415","n_code_links":0,"syntology":null},{"paper":"/paper/discovering-outstanding-subgroup-lists-for","slug":"discovering-outstanding-subgroup-lists-for","title":"Discovering outstanding subgroup lists for numeric targets using MDL","date":"2020-06-16","arxiv_id":"2006.09186","n_code_links":3,"syntology":null},{"paper":"/paper/unsupervised-discretization-by-two","slug":"unsupervised-discretization-by-two","title":"Unsupervised Discretization by Two-dimensional MDL-based Histogram","date":"2020-06-02","arxiv_id":"2006.01893","n_code_links":1,"syntology":null},{"paper":"/paper/information-theoretic-probing-with-minimum","slug":"information-theoretic-probing-with-minimum","title":"Information-Theoretic Probing with Minimum Description Length","date":"2020-03-27","arxiv_id":"2003.12298","n_code_links":2,"syntology":{"ran":2,"of":5,"n_ran_checked":1,"n_instrument":1,"unverified":3,"pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["lena-voita/description-length-probing"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"unified-multi-domain-learning-and-data","title":"Unified Multi-Domain Learning and Data Imputation using Adversarial Autoencoder","date":"2020-03-15","arxiv_id":"2003.07779","n_code_links":0,"syntology":null},{"paper":"/paper/stance-detection-benchmark-how-robust-is-your","slug":"stance-detection-benchmark-how-robust-is-your","title":"Stance Detection Benchmark: How Robust Is Your Stance Detection?","date":"2020-01-06","arxiv_id":"2001.01565","n_code_links":1,"syntology":{"ran":9,"of":10,"n_ran_checked":9,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["UKPLab/mdl-stance-robustness"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"collaborative-generated-hashing-for-market","title":"Collaborative Generated Hashing for Market Analysis and Fast Cold-start Recommendation","date":"2020-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-a-robust-classifier-an-mdl-based","title":"Towards a Robust Classifier: An MDL-Based Method for Generating Adversarial Examples","date":"2019-12-11","arxiv_id":"1912.05945","n_code_links":0,"syntology":null},{"paper":null,"slug":"causal-inference-via-conditional-kolmogorov","title":"Causal Inference via Conditional Kolmogorov Complexity using MDL Binning","date":"2019-10-31","arxiv_id":"1911.00332","n_code_links":0,"syntology":null},{"paper":null,"slug":"descriptive-dimensionality-and-its","title":"Descriptive Dimensionality and Its Characterization of MDL-based Learning and Change Detection","date":"2019-10-25","arxiv_id":"1910.11540","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-mdl-based-classifier-for-transactional","title":"An MDL-Based Classifier for Transactional Datasets with Application in Malware Detection","date":"2019-10-09","arxiv_id":"1910.03751","n_code_links":0,"syntology":null},{"paper":null,"slug":"model-aided-deep-neural-network-for-source","title":"Model-aided Deep Neural Network for Source Number Detection","date":"2019-09-29","arxiv_id":"1909.13273","n_code_links":0,"syntology":null},{"paper":null,"slug":"minimum-description-length-revisited","title":"Minimum Description Length Revisited","date":"2019-08-21","arxiv_id":"1908.08484","n_code_links":0,"syntology":null},{"paper":"/paper/identifying-linear-models-in-multi-resolution","slug":"identifying-linear-models-in-multi-resolution","title":"Identifying Linear Models in Multi-Resolution Population Data using Minimum Description Length Principle to Predict Household Income","date":"2019-07-10","arxiv_id":"1907.05234","n_code_links":1,"syntology":null},{"paper":"/paper/sentence-length","slug":"sentence-length","title":"Sentence Length","date":"2019-05-22","arxiv_id":"1905.09139","n_code_links":1,"syntology":null},{"paper":null,"slug":"budget-aware-adapters-for-multi-domain","title":"Budget-Aware Adapters for Multi-Domain Learning","date":"2019-05-15","arxiv_id":"1905.06242","n_code_links":0,"syntology":null},{"paper":null,"slug":"summarizing-event-sequences-with-serial","title":"Summarizing Event Sequences with Serial Episodes: A Statistical Model and an Application","date":"2019-04-01","arxiv_id":"1904.00516","n_code_links":0,"syntology":null},{"paper":"/paper/multi-domain-adversarial-learning-1","slug":"multi-domain-adversarial-learning-1","title":"Multi-Domain Adversarial Learning","date":"2019-03-21","arxiv_id":"1903.09239","n_code_links":1,"syntology":null},{"paper":null,"slug":"differential-description-length-for","title":"Differential Description Length for Hyperparameter Selection in Machine Learning","date":"2019-02-13","arxiv_id":"1902.04699","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-long-and-the-short-of-it-summarising","title":"The Long and the Short of It: Summarising Event Sequences with Serial Episodes","date":"2019-02-07","arxiv_id":"1902.02834","n_code_links":0,"syntology":null},{"paper":null,"slug":"from-below-boolean-matrix-factorization","title":"From-Below Boolean Matrix Factorization Algorithm Based on MDL","date":"2019-01-28","arxiv_id":"1901.09567","n_code_links":0,"syntology":null},{"paper":null,"slug":"we-are-not-your-real-parents-telling-causal","title":"We Are Not Your Real Parents: Telling Causal from Confounded using MDL","date":"2019-01-21","arxiv_id":"1901.06950","n_code_links":0,"syntology":null},{"paper":null,"slug":"distributed-inference-for-linear-support","title":"Distributed Inference for Linear Support Vector Machine","date":"2018-11-29","arxiv_id":"1811.11922","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-tutorial-on-mdl-hypothesis-testing-for","title":"A tutorial on MDL hypothesis testing for graph analysis","date":"2018-10-31","arxiv_id":"1810.13163","n_code_links":0,"syntology":null},{"paper":null,"slug":"finite-sample-risk-bounds-for-maximum","title":"Finite-sample risk bounds for maximum likelihood estimation with arbitrary penalties","date":"2017-12-29","arxiv_id":"1712.10087","n_code_links":0,"syntology":null},{"paper":"/paper/aixijs-a-software-demo-for-general","slug":"aixijs-a-software-demo-for-general","title":"AIXIjs: A Software Demo for General Reinforcement Learning","date":"2017-05-22","arxiv_id":"1705.07615","n_code_links":1,"syntology":null},{"paper":"/paper/scalable-exact-parent-sets-identification-in","slug":"scalable-exact-parent-sets-identification-in","title":"Scalable Exact Parent Sets Identification in Bayesian Networks Learning with Apache Spark","date":"2017-05-18","arxiv_id":"1705.06390","n_code_links":1,"syntology":null},{"paper":null,"slug":"causal-inference-on-multivariate-and-mixed","title":"Causal Inference on Multivariate and Mixed-Type Data","date":"2017-02-21","arxiv_id":"1702.06385","n_code_links":0,"syntology":null},{"paper":null,"slug":"unifying-multi-domain-multi-task-learning","title":"Unifying Multi-Domain Multi-Task Learning: Tensor and Neural Network Perspectives","date":"2016-11-28","arxiv_id":"1611.09345","n_code_links":0,"syntology":null},{"paper":null,"slug":"minimum-description-length-principle-in","title":"Minimum Description Length Principle in Supervised Learning with Application to Lasso","date":"2016-07-11","arxiv_id":"1607.02914","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-rates-for-general-unbounded-loss","title":"Fast Rates for General Unbounded Loss Functions: from ERM to Generalized Bayes","date":"2016-05-01","arxiv_id":"1605.00252","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-c-library-for-multimodal-deep-learning","title":"A C++ library for Multimodal Deep Learning","date":"2015-12-22","arxiv_id":"1512.06927","n_code_links":0,"syntology":null},{"paper":null,"slug":"higher-order-asymptotics-for-the-parametric","title":"Higher-order asymptotics for the parametric complexity","date":"2015-10-01","arxiv_id":"1510.00112","n_code_links":0,"syntology":null},{"paper":null,"slug":"incorporating-type-ii-error-probabilities","title":"Incorporating Type II Error Probabilities from Independence Tests into Score-Based Learning of Bayesian Network Structure","date":"2015-05-12","arxiv_id":"1505.02870","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-unified-perspective-on-multi-domain-and","title":"A Unified Perspective on Multi-Domain and Multi-Task Learning","date":"2014-12-23","arxiv_id":"1412.7489","n_code_links":0,"syntology":null},{"paper":null,"slug":"joint-energy-based-detection-and","title":"Joint Energy-based Detection and Classificationon of Multilingual Text Lines","date":"2014-07-23","arxiv_id":"1407.6082","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparsityboost-a-new-scoring-function-for","title":"SparsityBoost: A New Scoring Function for Learning Bayesian Network Structure","date":"2013-09-26","arxiv_id":"1309.6820","n_code_links":0,"syntology":null},{"paper":null,"slug":"extending-universal-intelligence-models-with","title":"Extending Universal Intelligence Models with Formal Notion of Representation","date":"2013-06-06","arxiv_id":"1306.1557","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-bayesian-approach-to-learning-bayesian","title":"A Bayesian Approach to Learning Bayesian Networks with Local Structure","date":"2013-02-06","arxiv_id":"1302.1528","n_code_links":0,"syntology":null},{"paper":"/paper/parsimonious-module-inference-in-large","slug":"parsimonious-module-inference-in-large","title":"Parsimonious module inference in large networks","date":"2012-12-19","arxiv_id":"1212.4794","n_code_links":1,"syntology":null},{"paper":null,"slug":"discrete-mdl-predicts-in-total-variation","title":"Discrete MDL Predicts in Total Variation","date":"2009-12-01","arxiv_id":null,"n_code_links":0,"syntology":null}],"papers_shown":97,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":97,"with_a_code_link":22,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":97,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":3,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":3,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":4,"papers_where_code_ran_first_page":"/method/mdl/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/mdl/papers/ran/1","json":"/method/mdl/papers/ran/1.json","rows":4}],"tasks":[{"task":"/task/model-selection","name":"Model Selection","papers":7},{"task":"/task/multi-task-learning","name":"Multi-Task Learning","papers":5},{"task":"/task/multimodal-deep-learning","name":"Multimodal Deep Learning","papers":5},{"task":"/task/descriptive","name":"Descriptive","papers":4},{"task":"/task/active-learning","name":"Active Learning","papers":3},{"task":"/task/bayesian-inference","name":"Bayesian Inference","papers":3},{"task":"/task/clustering","name":"Clustering","papers":3},{"task":"/task/deep-learning","name":"Deep Learning","papers":3},{"task":"/task/domain-adaptation","name":"Domain Adaptation","papers":3},{"task":"/task/classification","name":"General Classification","papers":3},{"task":"/task/image-classification","name":"Image Classification","papers":3},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":3},{"task":"/task/subgroup-discovery","name":"Subgroup Discovery","papers":3},{"task":"/task/image-classification","name":"image-classification","papers":3},{"task":"/task/reinforcement-learning-2","name":"reinforcement-learning","papers":3},{"task":"/task/attribute","name":"Attribute","papers":2},{"task":"/task/binary-classification","name":"Binary Classification","papers":2},{"task":"/task/causal-inference","name":"Causal Inference","papers":2},{"task":"/task/change-detection","name":"Change Detection","papers":2},{"task":"/task/decision-making","name":"Decision Making","papers":2}],"tasks_shown":20,"n_tasks":101,"usage_by_year":[{"year":"2009","papers":1},{"year":"2012","papers":1},{"year":"2013","papers":3},{"year":"2014","papers":2},{"year":"2015","papers":3},{"year":"2016","papers":3},{"year":"2017","papers":4},{"year":"2018","papers":2},{"year":"2019","papers":15},{"year":"2020","papers":15},{"year":"2021","papers":9},{"year":"2022","papers":7},{"year":"2023","papers":17},{"year":"2024","papers":10},{"year":"2025","papers":5}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/mdl"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=MDL","read_at":"2026-10-05T00:59:01+00:00","query":"MDL","kind":"method","have":"no_code","tier":"paper_only","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"MDL","origin_arxiv_id":"2602.07520"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":"for_this_exact_name_only","absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":null,"in_graph":0,"list_truncated":null,"strongest_link":null},"retrieve_with":null,"name_competition":{"verdict":"outranked","may_be_wrong_sense":true,"bearers_found":3,"served":{"arxiv_id":"2602.07520","citations":0},"leading_other_bearer":{"arxiv_id":"2003.12298","title":"Information-Theoretic Probing with Minimum Description Length","citations":333,"named_by":["acronym_expansion"],"bearer_name":"information-theoretic probing with minimum description length (MDL)","ask_with":"have('2003.12298')"},"n_other_bearers_listed":2,"note":"'MDL' is ALSO the name of 'information-theoretic probing with minimum description length (MDL)', a method in 'Information-Theoretic Probing with Minimum Description Length' (arXiv:2003.12298, 333 citations), which is cited FAR more than the paper this answer is about (0). This answer may be about the wrong MDL. If you meant the better-known one, ask again with that entry of `also_named`."},"name_competition_text":"The same name also belongs to “information-theoretic probing with minimum description length (MDL)”, a method in the paper “Information-Theoretic Probing with Minimum Description Length” (arXiv:2003.12298, 333 citations), which the lookup finds cited far more than the paper this answer is about (0 citations), so this answer may be about a different sense of the name.","near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2602.07520","page":null,"syntology_url":"https://syntology.ai/paper/2602.07520","in_graph_layer":false,"samples":0},"line":"no code under this exact name (no_code; paper_only). The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2602.07520) is about this method is not checked; it does not say whether this method has code.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"beaf7024141c86b6652aef5e771324ed854c3013259385e735949e048dfb1798","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}