On Maximum Entropy and Inference

Abstract

Maximum Entropy is a powerful concept that entails a sharp separation between relevant and irrelevant variables. It is typically invoked in inference, once an assumption is made on what the relevant variables are, in order to estimate a model from data, that affords predictions on all other (dependent) variables. Conversely, maximum entropy can be invoked to retrieve the relevant variables (sufficient statistics) directly from the data, once a model is identified by Bayesian model selection. We explore this approach in the case of spin models with interactions of arbitrary order, and we discuss how relevant interactions can be inferred. In this perspective, the dimensionality of the inference problem is not set by the number of parameters in the model, but by the frequency distribution of the data. We illustrate the method showing its ability to recover the correct model in a few prototype cases and discuss its application on a real dataset.

16 pages, 4 figures

References in corpus (8)

• Weak pairwise correlations imply strongly correlated network states in a neural population
• Inverse statistical problems: from the inverse Ising problem to data science
• The simplest maximum entropy model for collective behavior in a neural network
• Statistical mechanics of the US Supreme Court
• On the sufficiency of pairwise interactions in maximum entropy models of biological networks
• Multivariate dependence and genetic networks inference
• Criticality of mostly informative samples: A Bayesian model selection approach
• The Stochastic complexity of spin models: Are pairwise models really simple?

Cited by in corpus (2)

• The Stochastic complexity of spin models: Are pairwise models really simple?
• Maximum Entropy Approach for the Prediction of Urban Mobility Patterns