Squared families: Searching beyond regular probability models
Not on the map. Why?
Abstract (arXiv)
We introduce squared families, which are families of probability densities obtained by squaring a linear transformation of a statistic. Squared families are singular, however their singularity can easily be handled so that they form regular models. After handling the singularity, squared families possess many convenient properties. Their Fisher information is a conformal transformation of the Hessian metric induced from a Bregman generator. The Bregman generator is the normalising constant, and yields a statistical divergence on the family. The normalising constant admits a helpful parameter-integral factorisation, meaning that only one parameter-independent integral needs to be computed for all normalising constants in the family, unlike in exponential families. Finally, the squared family kernel is the only integral that needs to be computed for the Fisher information, statistical divergence and normalising constant. We then describe how squared families are special in the broader class of g-families, which are obtained by applying a sufficiently regular function g to a linear transformation of a statistic. After removing special singularities, positively homogeneous families and exponential families are the only g-families for which the Fisher information is a conformal transformation of the Hessian metric, where the generator depends on the parameter only through the normalising constant. Even-order monomial families also admit parameter-integral factorisations, unlike exponential families. We study parameter estimation and density estimation in squared families, in the well-specified and misspecified settings. We use a universal approximation property to show that squared families can learn sufficiently well-behaved target densities at a rate of O(N-1/2)+C n-1/4, where N is the number of datapoints, n is the number of parameters, and C is some constant.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 16 of its 46 references that are in the map. First posted on arXiv 27 Mar 2025.
Builds on
16 of 46 references.
References · 16
- 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,323
- 2015Deep Kernel Learningcited by 445
- 2018An elementary introduction to information geometrycited by 76
- 2020Approximation Bounds for Random Neural Networks and Reservoir Systemscited by 52
- 2020Non-parametric Models for Non-negative Functionscited by 41
- 2023Subtractive Mixture Models via Squaring: Representation and Learningcited by 39
- 2014Variational Inference for Gaussian Process Modulated Poisson Processescited by 26
- 2021PSD Representations for Effective Probability Modelscited by 23
- 2024Sum of Squares Circuitscited by 21
- 2023How to Turn Your Knowledge Graph Embeddings into Generative Modelscited by 20
- 2016Poisson intensity estimation with reproducing kernelscited by 14
- 2024On the Relationship Between Monotone and Squared Probabilistic Circuitscited by 14
4 more
- 2023Squared Neural Families: A New Class of Tractable Density Modelscited by 12
- 2017Fast Bayesian Intensity Estimation for the Permanental Processcited by 10
- 2021Sampling from Arbitrary Functions via PSD Modelscited by 8
- 2024Exact, Fast and Expressive Poisson Point Processes via Squared Neural Familiescited by 6
Built on by
Citing papers per year: 2025: 1.
1 paper.