Skip to content
DraconiticResearch
Search Sources API
190,869 studies31 sourcesUpdated just now
PreprintarXiv licencearXiv

Likelihood-free inference with nuisance parameters through normalizing flows

Abstract

We present a simple decomposition of a neural-network-based normalizing flow that naturally uncovers a pivotal statistic (or something close) in the presence of nuisance parameters, based only on a sample generator from the distribution of interest. We show that the statistic is near-pivotal in the sense of minimum average KL-divergence of its p-values versus uniform and we argue that it can be expected to have good power when the dimension of the statistic equals the dimension of the parameter. It is able to incorporate prior knowledge about group invariances such as translation and scale. It can discover the one-sample t-test almost exactly, outperforms the Welch test in terms of worst-case size over a constrained variance-ratio range and achieves good calibration on partial biserial correlations, while showing higher power (and being much faster) on small-to-moderate samples than profile likelihood-ratio techniques.

Related

  1. Asymptotics for likelihood ratio tests of boundary points with singular information and unidentifiable nuisance parameters
    Karl Oskar Ekvall, Ola Hössjer, Matteo Bottai +1
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. A perspective note on likelihood approximation and inference for complex simulation models using a chain of aggregated normalizing flows
    Getachew K Befekadu
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. Variational Bayesian Inference Based Progressive Multi-Target MIMO Sensing with Nuisance Parameters
    Jiayi Yao, Shuowen Zhang
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  4. Optimal Hamiltonian Parameter Estimation in the Presence of Nuisance Parameters
    Zhiyao Hu, Haidong Yuan, Liang Jiang +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
  5. Truthful and Admissible Principal--Agent Testing with Nuisance Parameters
    Aaditya Ramdas
    arXivPreprintarXiv licenceFull textStatisticsarXiv
BibTeX
@misc{assheton2026likelihoodfree,
  title = {{Likelihood-free inference with nuisance parameters through normalizing flows}},
  author = {Phil Assheton},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.10534},
  eprint = {2609.10534},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.10534},
}
RIS
TY  - UNPB
TI  - Likelihood-free inference with nuisance parameters through normalizing flows
AU  - Phil Assheton
PY  - 2026
DA  - 2026/09/09
PB  - arXiv
DO  - 10.48550/arxiv.2609.10534
UR  - https://arxiv.org/abs/2609.10534
AB  - We present a simple decomposition of a neural-network-based normalizing flow that naturally uncovers a pivotal statistic (or something close) in the presence of nuisance parameters, based only on a sample generator from the distribution of interest. We show that the statistic is near-pivotal in the sense of minimum average KL-divergence of its p-values versus uniform and we argue that it can be expected to have good power when the dimension of the statistic equals the dimension of the parameter. It is able to incorporate prior knowledge about group invariances such as translation and scale. It can discover the one-sample t-test almost exactly, outperforms the Welch test in terms of worst-case size over a constrained variance-ratio range and achieves good calibration on partial biserial correlations, while showing higher power (and being much faster) on small-to-moderate samples than profile likelihood-ratio techniques.
ER  -