Inducing Comparability of Factorised Probability Distributions

• URL: http://arxiv.org/abs/2607.20502v1
• Date: Tue, 23 Jun 2026 08:33:06 GMT
• Title: Inducing Comparability of Factorised Probability Distributions
• Abstract summary: We propose an extension scheme for any two given models and establish the formal foundation: Unmatched components are completed using conditionally uniform extensions.<n>This preserves the probabilistic semantics while enabling the application of well-defined distributional discrepancy measures.
• Score: 4.622328826769001
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: To allow for principled comparison between two probabilistic graphical models defined over non-identical variable sets, they have to be lifted to a common measurable space. To this end, we propose an extension scheme for any two given models and establish the formal foundation: Unmatched components are completed using conditionally uniform (Laplace) extensions such that the resulting joint distributions differ from the original ones only by multiplicative constants and coincide under projection. This preserves the probabilistic semantics while enabling the application of well-defined distributional discrepancy measures. We establish the invariance of the induced joint under projection and use the extensions to provide a minimal structural extension of two factor graphs to the smalles common measurable space as well as to a common graphical structure by a deterministic algorithm. In addition, we discuss structural and measure-theoretic properties and identify promising criteria for comparison methodologies.

Related papers

• Projective Maximum Entropy: Universality and Acceptance-Region Calibration [2.639737913330821]
  We formulate maximum entropy on the projective space of nonnegative measures.<n>Every admissible monotone transform of the same normalized power functional has exactly the same universality under linear moment constraints.<n>The resulting affine-equivariant reference density is the unique projective maximum-entropy solution.
  arXiv  Detail & Related papers  (2026-07-17T22:50:47Z)
• Representational Capacity: Geometric Limits on Feature Representation in Transformer Language Models [51.56484100374058]
  We develop a framework for estimating how many near-orthogonal directions a model can support.<n>Applying this metric across dozens of open-source models reveals two classes: models with high $varepsilon$ whose embeddings lack near-orthogonal structure, and models with low $varepsilon$ that maintain it.
  arXiv  Detail & Related papers  (2026-06-01T18:28:56Z)
• Distributional Equivalence in Linear Non-Gaussian Latent-Variable Cyclic Causal Models: Characterization and Learning [13.891913455492697]
  We argue that a core obstacle to a general, structural-assumption-free approach is the lack of an equivalence characterization.<n>Key to our approach is a new tool, edge rank constraints, which fills a missing piece in the toolbox for latent-variable causal discovery.
  arXiv  Detail & Related papers  (2026-03-05T03:57:14Z)
• Efficient Covariance Estimation for Sparsified Functional Data [51.69796254617083]
  proposed Random-knots (Random-knots-Spatial) and B-spline (Bspline-Spatial) estimators of the covariance function are computationally efficient.<n>Asymptotic pointwise of the covariance are obtained for sparsified individual trajectories under some regularity conditions.
  arXiv  Detail & Related papers  (2025-11-23T00:50:33Z)
• Score-Based Model for Low-Rank Tensor Recovery [49.158601255093416]
  Low-rank tensor decompositions (TDs) provide an effective framework for multiway data analysis.<n>Traditional TD methods rely on predefined structural assumptions, such as CP or Tucker decompositions.<n>We propose a score-based model that eliminates the need for predefined structural or distributional assumptions.
  arXiv  Detail & Related papers  (2025-06-27T15:05:37Z)
• InterHandGen: Two-Hand Interaction Generation via Cascaded Reverse Diffusion [53.90516061351706]
  We present InterHandGen, a novel framework that learns the generative prior of two-hand interaction. For sampling, we combine anti-penetration and synthesis-free guidance to enable plausible generation. Our method significantly outperforms baseline generative models in terms of plausibility and diversity.
  arXiv  Detail & Related papers  (2024-03-26T06:35:55Z)
• Nonparametric Partial Disentanglement via Mechanism Sparsity: Sparse Actions, Interventions and Sparse Temporal Dependencies [58.179981892921056]
  This work introduces a novel principle for disentanglement we call mechanism sparsity regularization. We propose a representation learning method that induces disentanglement by simultaneously learning the latent factors. We show that the latent factors can be recovered by regularizing the learned causal graph to be sparse.
  arXiv  Detail & Related papers  (2024-01-10T02:38:21Z)
• String Diagrams with Factorized Densities [0.0]
  Both probabilistic programs and causal models define a joint probability density over a set of random variables. This work builds on work on Markov categories of probabilistic mappings to define a category whose morphisms combine a joint density, factorized over each sample space, with a deterministic mapping from samples to return values.
  arXiv  Detail & Related papers  (2023-05-04T02:30:44Z)
• Wrapped Distributions on homogeneous Riemannian manifolds [58.720142291102135]
  Control over distributions' properties, such as parameters, symmetry and modality yield a family of flexible distributions. We empirically validate our approach by utilizing our proposed distributions within a variational autoencoder and a latent space network model.
  arXiv  Detail & Related papers  (2022-04-20T21:25:21Z)
• Structure-preserving GANs [6.438897276587413]
  We introduce structure-preserving GANs as a data-efficient framework for learning distributions. We show that we can reduce the discriminator space to its projection on the invariant discriminator space. We contextualize our framework by building symmetry-preserving GANs for distributions with intrinsic group symmetry.
  arXiv  Detail & Related papers  (2022-02-02T16:40:04Z)
• Cycle Consistent Probability Divergences Across Different Spaces [38.43511529063335]
  Discrepancy measures between probability distributions are at the core of statistical inference and machine learning. This work proposes a novel unbalanced Monge optimal transport formulation for matching, up to isometries, distributions on different spaces.
  arXiv  Detail & Related papers  (2021-11-22T16:35:58Z)

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.