The Degeneracy Distillery

📅 2026-06-22
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
This study addresses the challenge of prediction and inversion in physical models or real-world data arising from parameter degeneracy—where parameters become indistinguishable—by treating degeneracy as an intrinsic property of the model. The authors propose a novel, data-free analytical framework that automatically identifies and resolves degenerate parameter combinations. Leveraging information geometry to globally flatten the Fisher information matrix, and integrating symbolic computation with simulation-driven modeling, the method achieves robust detection and disentanglement of degeneracies without relying on observational data. In contrast to conventional approaches that depend on posterior estimation, this technique offers superior generalizability and uncovers underlying physical mechanisms. Validated across multiple synthetic and real-world cases, it maintains calibration accuracy while reducing simulation costs by up to an order of magnitude and yields interpretable parameter coordinate transformations.
📝 Abstract
When two or more parameters or labels produce similar data, they are degenerate, or hard to distinguish. Degeneracies render both label prediction and inverse problems difficult, since both machine learning algorithms and probabilistic samplers rely on the distinguishability of data and its gradients with respect to parameters. However, identifying degeneracies in physical models or real-world datasets can be elucidating about the choice of model or the underlying process that produces the data. We present the degeneracy distillery, a method that (1) detects and (2) resolves degenerate parameter combinations (a) automatically and (b) symbolically, from parameter-data (or parameter-simulation) pairs alone, through estimation and flattening of the Fisher information matrix. By exploring the information geometry of the likelihood, we characterize degeneracies as an intrinsic property of the physical model, requiring no realised data observation. We demonstrate our approach on a range of synthetic and real-world problems, discovering symbolic coordinate transformations that identify the combinations of parameters of a model which yield independent effects on the data. The resulting coordinates flatten the Fisher information in expectation globally, in contrast to posterior-based methods that flatten only at a single point, and substantially reduce the simulation budget required for downstream neural posterior estimation. In test cases we require up to $10\times$ fewer simulations for posterior estimation at matched validation calibration whilst simultaneously gaining physical insight on the system.
Problem

Research questions and friction points this paper is trying to address.

degeneracy
parameter identifiability
inverse problems
Fisher information
likelihood geometry
Innovation

Methods, ideas, or system contributions that make the work stand out.

degeneracy
Fisher information matrix
information geometry
symbolic transformation
neural posterior estimation
🔎 Similar Papers
No similar papers found.
T
T. Lucas Makinen
Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Wilberforce Rd, Cambridge CB3 0WA, United Kingdom; Imperial Centre for Inference and Cosmology (ICIC), Imperial College London, Prince Consort Road, London SW7 2AZ, United Kingdom
Deaglan J. Bartlett
Deaglan J. Bartlett
University of Oxford
Cosmologymachine learningBayesian large-scale structure inferencefield-level inferencesymbolic regression
N
Niall Jeffrey
Department of Physics and Astronomy, University College London, London WC1E 6BT, United Kingdom; Department of Physics & King’s Institute for Artificial Intelligence, King’s College London, London WC2R 2LS, United Kingdom
B
Benjamin D. Wandelt
Department of Physics and Astronomy, Johns Hopkins University, Baltimore, MD 21218, USA; Department of Applied Mathematics and Statistics, Johns Hopkins University, Baltimore, MD 21218, USA