Bayesian inference of minimally complex models with interactions of arbitrary order

Finding the model that best describes a high-dimensional dataset is a daunting task, even more so if one aims to consider all possible high-order patterns of the data (i.e., correlation patterns between three or more variables), going beyond pairwise models. For binary data, we show that this task becomes feasible when restricting the search to a family of simple models, which we call minimally complex models (MCMs). MCMs are maximum entropy models that have interactions of arbitrarily high order grouped into independent components of minimal complexity. They are simple in information-theoretic terms, which means they can only fit well certain types of data patterns and are therefore easy to falsify. We show that Bayesian model selection restricted to these models is computationally feasible and has many advantages. First, the model evidence, which balances goodness of fit against complexity, can be computed efficiently without any parameter fitting, enabling very fast explorations of the space of MCMs. Second, the family of MCMs is invariant under gauge transformations, which can be used to develop a representation-independent approach to statistical modeling. For small systems (up to 15 variables), combining these two results allows us to select the best MCM among all, even though the number of models is already extremely large (10^{68} models for 15 variables). For larger systems, we propose simple heuristics to find optimal MCMs in reasonable times. Also, inference and sampling can be performed without any computational effort. Finally, because MCMs have interactions of any order, they can reveal the presence of important high-order dependencies in the data, providing an alternative approach to explore high-order dependencies in complex systems. We apply our method to synthetic data and real-world examples, illustrating how MCMs portray the structure of dependencies among variables in a simple manner, extracting falsifiable predictions on symmetries and invariance from the data.

Authors

Institutions

Publication Details

Journal
Physical review. E
Published
2025-05-15
DOI
https://doi.org/10.1103/physreve.111.054307
Primary Topic
Statistical Methods and Inference
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Bayesian inference of minimally complex models with interactions of arbitrary order

Clélia de Mulatier, Matteo Marsili
Physical review. E
Statistical Methods and Inference
article

Bayesian inference of minimally complex models with interactions of arbitrary order

Clélia de Mulatier, Matteo Marsili
article en

Abstract

Finding the model that best describes a high-dimensional dataset is a daunting task, even more so if one aims to consider all possible high-order patterns of the data (i.e., correlation patterns between three or more variables), going beyond pairwise models. For binary data, we show that this task becomes feasible when restricting the search to a family of simple models, which we call minimally complex models (MCMs). MCMs are maximum entropy models that have interactions of arbitrarily high order grouped into independent components of minimal complexity. They are simple in information-theoretic terms, which means they can only fit well certain types of data patterns and are therefore easy to falsify. We show that Bayesian model selection restricted to these models is computationally feasible and has many advantages. First, the model evidence, which balances goodness of fit against complexity, can be computed efficiently without any parameter fitting, enabling very fast explorations of the space of MCMs. Second, the family of MCMs is invariant under gauge transformations, which can be used to develop a representation-independent approach to statistical modeling. For small systems (up to 15 variables), combining these two results allows us to select the best MCM among all, even though the number of models is already extremely large (10^{68} models for 15 variables). For larger systems, we propose simple heuristics to find optimal MCMs in reasonable times. Also, inference and sampling can be performed without any computational effort. Finally, because MCMs have interactions of any order, they can reveal the presence of important high-order dependencies in the data, providing an alternative approach to explore high-order dependencies in complex systems. We apply our method to synthetic data and real-world examples, illustrating how MCMs portray the structure of dependencies among variables in a simple manner, extracting falsifiable predictions on symmetries and invariance from the data.

Physical review. EVol. 111(5)
The Abdus Salam International Centre for Theoretical Physics (ICTP) (IT), California University of Pennsylvania (US), University of Amsterdam (NL)
Openalex Percentile: Top 89%
Statistical Methods and Inference
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.