paper-with-me

홈 › Papers

Squared families: Searching beyond regular probability models

2025-03-27 · Russell Tsuchida, Jiawei Liu, Cheng Soon Ong, Dino Sejdinovic

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 $\mathcal{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.

📄 PDF Abstract BibTeX arXiv:2503.21128

Code (0)

등록된 구현이 없습니다.

Tasks

Density Estimationparameter estimation

Similar Papers 제목 키워드 기반

Squared Neural Families: A New Class of Tractable Density Models

2023-09-21 · NeurIPS 2023 11

Flexible models for probability distributions are an essential ingredient in many machine learning tasks. We develop and investigate a new class of probability distributions, which we call a Squared Neural Family (SNEFY)…

Bayesian dense inverse searching algorithm for real-time stereo matching in minimally invasive surgery

2021-06-14 · Jingwei Song, Qiuchen Zhu, Jianyu Lin, Maani Ghaffari

This paper reports a CPU-level real-time stereo matching method for surgical images (10 Hz on 640 * 480 image with a single core of i5-9400). The proposed method is built on the fast ''dense inverse searching'' algorithm…

CPUStereo Matching

A Unifying View of Variational Generative Wasserstein Flows

2026-05-29 · Paul Caucheteux, Clément Bonet, Anna Korba arxiv

Many modern generative models can be viewed as minimizing divergences between probability distributions, yet they rely on different algorithmic and geometric principles. Wasserstein gradient flows provide a continuous-ti…

Wavelet Design in a Learning Framework

2021-07-23 · Dhruv Jawali, Abhishek Kumar, Chandra Sekhar Seelamantula

Wavelets have proven to be highly successful in several signal and image processing applications. Wavelet design has been an active field of research for over two decades, with the problem often being approached from an …

Supervised learning of sheared distributions using linearized optimal transport

2022-01-25 · Varun Khurana, Harish Kannan, Alexander Cloninger, Caroline Moosmüller

In this paper we study supervised learning tasks on the space of probability measures. We approach this problem by embedding the space of probability measures into $L^2$ spaces using the optimal transport framework. In t…

image-classificationImage Classification