Maximum entropy relaxation of multi-way cardinality constraints for synthetic population generation

Read full text Summarise with VIRAT
Authors: François Pachet, Jean-Daniel Zucker
Cited by: 0
References: 27

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Generating synthetic populations from aggregate statistics is a core component of microsimulation, agent-based modeling, policy analysis, and privacy-preserving data release. Beyond classical census marginals, many applications require matching heterogeneous unary, binary, and more generally multi-way constraints derived from surveys, expert knowledge, or automatically extracted descriptions. Constructing populations that satisfy such multi-way constraints simultaneously poses a significant computational challenge. We consider populations where each individual is described by categorical attributes and the target is a collection of global frequency constraints over attribute combinations. Exact formulations scale poorly as the number and arity of constraints increase, especially when the constraints are numerous and overlapping. We propose a maximum-entropy relaxation of this problem. Multi-way cardinality constraints are matched in expectation rather than exactly, yielding an exponential-family distribution over complete population assignments and a convex optimization problem over Lagrange multipliers. The convex program defines the theoretical MaxEnt solution; in practice we approximate it with a fixed-budget MCMC moment-matching procedure, and all reported results measure the empirical performance of this finite-budget approximation. We evaluate the approach on NPORS-derived scaling benchmarks with four to 40 attributes, and on a controlled synthetic benchmark family generated independently of NPORS, and compare it primarily against generalized raking. The results show that MaxEnt becomes increasingly advantageous as the number of attributes and ternary interactions grows, while raking remains competitive on smaller, lower-arity instances.

Fields of Study & Subjects

demographic modeling and climate adaptation Simulation Techniques and Applications Markov Chains and Monte Carlo Methods

Publication details

Journal / source
Frontiers in Artificial Intelligence
Volume
9
Pages
1840945–1840945
Publication date
23 October 2026
Language
EN