A Probabilistic Circuit-Induced Pseudo-Metric for Out-of-Distribution Detection

• URL: http://arxiv.org/abs/2608.09117v2
• Date: Mon, 17 Aug 2026 10:34:33 GMT
• Title: A Probabilistic Circuit-Induced Pseudo-Metric for Out-of-Distribution Detection
• Abstract summary: We introduce Hierarchical Likelihood Vector (HLV), a representation whose entries are the likelihoods associated with selected PC nodes.<n>HLD is a PC-induced pseudo-metric that compares the probability distributions through the expectations of their HLVs.<n>We show that HLD is an integral probability metric over a function class naturally induced by the PC and develop a principled goodness-of-fit hypothesis test for unsupervised OOD detection.
• Score: 0.8538830579425144
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Probabilistic Circuits (PCs) are tractable generative models whose internal nodes encode a hierarchy of probabilistic summaries over different variable scopes. Existing PC-based out-of-distribution (OOD) detection methods ignore this hierarchy, reducing the entire circuit to the scalar likelihood (or its uncertainty) computed at the root. We introduce Hierarchical Likelihood Vector (HLV), a representation whose entries are the likelihoods associated with selected PC nodes and define the Hierarchical Likelihood Distance (HLD), a PC-induced pseudo-metric that compares the probability distributions through the expectations of their HLVs. We show that HLD is an integral probability metric over a function class naturally induced by the PC and develop a principled goodness-of-fit hypothesis test for unsupervised OOD detection. Unlike existing approaches, the trained PC alone serves as the representation of the in-distribution: no held-out in-distribution data are required at deployment. We further show that the quantities required by the hypothesis test can be computed exactly, directly from the trained circuit, yielding an approximate analytic decision threshold. Experiments on tabular and MNIST datasets demonstrate that exploiting the hierarchical probabilistic summaries encoded through the PC improve OOD detection over root-likelihood, uncertainty-, typicality- and kernel-based baselines, while naturally localizing distribution shifts to the PC nodes responsible for the shift.

Related papers

• Mitigating the Likelihood Paradox in Flow-based OOD Detection via Entropy Manipulation [24.066271161451425]
  We argue that entropy control increases the expected log-likelihood gap between in-distribution and OOD samples in favor of the in-distribution.<n>We then evaluate our method against likelihood-based OOD detectors on standard benchmarks and find consistent AUROC improvements over baselines.
  arXiv  Detail & Related papers  (2026-02-10T09:31:03Z)
• From Shortcut to Induction Head: How Data Diversity Shapes Algorithm Selection in Transformers [67.02076505996284]
  We study how the choice of pretraining data distribution steers a shallow transformer toward one behavior or the other.<n>Our results shed light on the algorithmic biases of pretrained transformers and offer conceptual guidelines for data-driven control of their learned behaviors.
  arXiv  Detail & Related papers  (2025-12-21T08:10:26Z)
• Out-of-Distribution Detection in Molecular Complexes via Diffusion Models for Irregular Graphs [11.928558263824213]
  We present a probabilistic OOD detection framework for complex 3D graph data built on a diffusion model.<n>A single probability-flow ODE produces per-sample log-likelihoods, providing a principled typicality score for distribution shift.<n>We validate the approach on protein-ligand complexes and construct strict OOD datasets.
  arXiv  Detail & Related papers  (2025-12-20T17:56:15Z)
• Tractable Representation Learning with Probabilistic Circuits [30.116247936061395]
  Probabilistic circuits (PCs) are powerful probabilistic models that enable exact and tractable inference.<n>While dominant in neural networks, representation learning with PCs remains underexplored.<n>We introduce autoencoding probabilistic circuits (APCs), a novel framework leveraging the tractability of PCs to model probabilistic embeddings explicitly.
  arXiv  Detail & Related papers  (2025-07-06T13:17:16Z)
• Policy Evaluation in Distributional LQR [70.63903506291383]
  We provide a closed-form expression of the distribution of the random return. We show that this distribution can be approximated by a finite number of random variables. Using the approximate return distribution, we propose a zeroth-order policy gradient algorithm for risk-averse LQR.
  arXiv  Detail & Related papers  (2023-03-23T20:27:40Z)
• Probabilistic Circuits That Know What They Don't Know [17.335642512433385]
  Probabilistic circuits (PCs) are models that allow exact and tractable probabilistic inference. We show that PCs are in fact not robust to out-of-distribution (OOD) data, i.e., they don't know what they don't know. We propose tractable dropout inference (TDI), an inference procedure to estimate uncertainty by deriving an analytical solution to Monte Carlo dropout (MCD) through variance propagation.
  arXiv  Detail & Related papers  (2023-02-13T17:36:49Z)
• Probabilistic Conformal Prediction Using Conditional Random Samples [73.26753677005331]
  PCP is a predictive inference algorithm that estimates a target variable by a discontinuous predictive set. It is efficient and compatible with either explicit or implicit conditional generative models.
  arXiv  Detail & Related papers  (2022-06-14T03:58:03Z)
• Probabilistic Kolmogorov-Arnold Network [1.4732811715354455]
  The present paper proposes a method for estimating probability distributions of the outputs in the case of aleatoric uncertainty. The suggested approach covers input-dependent probability distributions of the outputs, as well as the variation of the distribution type with the inputs. Although the method is applicable to any regression model, the present paper combines it with KANs, since the specific structure of KANs leads to computationally-efficient models' construction.
  arXiv  Detail & Related papers  (2021-04-04T23:49:15Z)
• The Hidden Uncertainty in a Neural Networks Activations [105.4223982696279]
  The distribution of a neural network's latent representations has been successfully used to detect out-of-distribution (OOD) data. This work investigates whether this distribution correlates with a model's epistemic uncertainty, thus indicating its ability to generalise to novel inputs.
  arXiv  Detail & Related papers  (2020-12-05T17:30:35Z)
• General stochastic separation theorems with optimal bounds [68.8204255655161]
  Phenomenon of separability was revealed and used in machine learning to correct errors of Artificial Intelligence (AI) systems and analyze AI instabilities. Errors or clusters of errors can be separated from the rest of the data. The ability to correct an AI system also opens up the possibility of an attack on it, and the high dimensionality induces vulnerabilities caused by the same separability.
  arXiv  Detail & Related papers  (2020-10-11T13:12:41Z)
• Tractable Inference in Credal Sentential Decision Diagrams [116.6516175350871]
  Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values. We develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with credal sets of mass functions. For a first empirical validation, we consider a simple application based on noisy seven-segment display images.
  arXiv  Detail & Related papers  (2020-08-19T16:04:34Z)
• Evaluating probabilistic classifiers: Reliability diagrams and score decompositions revisited [68.8204255655161]
  We introduce the CORP approach, which generates provably statistically Consistent, Optimally binned, and Reproducible reliability diagrams in an automated way. Corpor is based on non-parametric isotonic regression and implemented via the Pool-adjacent-violators (PAV) algorithm.
  arXiv  Detail & Related papers  (2020-08-07T08:22:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.