Quotient-Based Posterior Analysis for Euclidean Latent Space Models

• URL: http://arxiv.org/abs/2604.02739v1
• Date: Fri, 03 Apr 2026 05:21:10 GMT
• Title: Quotient-Based Posterior Analysis for Euclidean Latent Space Models
• Abstract summary: We propose a quotient-based posterior analysis for Euclidean latent space models.<n>We show how coherent posterior analysis can reveal latent relational structure beyond a single embedding.
• Score: 0.5371337604556311
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Latent space models are widely used in statistical network analysis and are often fit by Markov chain Monte Carlo. However, posterior summaries of latent coordinates are not canonical because the likelihood depends only on pairwise distances and is invariant under rigid motions of the latent space. Standard post hoc alignment can aid visualization, but the resulting summaries depend on an arbitrary reference configuration. We propose a quotient-based posterior analysis for Euclidean latent space models using the centered Gram map, which represents identifiable latent structure while removing nonidentifiability. This yields intrinsic posterior summaries of mean structure and uncertainty that can be computed directly from posterior samples, together with basic theoretical guarantees including canonicality, existence, and stability. Through simulations and analyses of the Florentine marriage network and a statisticians' coauthorship network, the proposed framework clarifies when alignment-based summaries are stable, when they become reference-sensitive, and which nodes or relationships are weakly identified. These results show how coherent posterior analysis can reveal latent relational structure beyond a single embedding.

Related papers

• PriorPose: Reference-Guided Joint Deformation and Alignment for Category-Level Object Pose Estimation [65.40341394642324]
  Category-level object pose estimation seeks to recover a similarity transform $(R,t,s)$ for unseen instances without instance-specific CAD models.<n>Most competitive methods are correspondence-based.<n>We propose PriorPose, a reference-guided correspondence framework that keeps the category prior explicit.
  arXiv  Detail & Related papers  (2026-09-15T06:57:34Z)
• K-Models: a Flexible and Interpretable Method for Ordinal Clustering with Application to Antigen-Antibody Interaction Profiles [65.21921642886367]
  K-Models is a novel framework that integrates ordinal constraints and estimates key underlying elements of the random process generating the observed functional profiles.<n>The proposed method is evaluated through simulations and real-world applications.
  arXiv  Detail & Related papers  (2026-05-14T13:35:44Z)
• Topological Detection of Hopf Bifurcations via Persistent Homology: A Functional Criterion from Time Series [0.0]
  We propose a framework for the detection of Hopf bifurcations directly from time series, based on persistent homology applied to phase space reconstructions via Takens embedding within the framework of Topological Data Analysis.<n>The results support the interpretation of dynamical transitions as topological phase transitions and demonstrate the potential of topological data analysis as a model-free tool for the quantitative analysis of nonlinear time series.
  arXiv  Detail & Related papers  (2026-03-28T20:25:38Z)
• Representation Geometry as a Diagnostic for Out-of-Distribution Robustness [0.5978543974412219]
  We propose a geometry-based diagnostic framework that constructs class-conditional mutual k-nearest-neighbor graphs from in-distribution embeddings.<n>We find that lower spectral complexity and higher mean curvature consistently predict stronger out-of-distribution (OOD) accuracy across checkpoints.<n>Our results demonstrate that representation geometry enables interpretable, label-free diagnosis and supports reliable unsupervised checkpoint selection.
  arXiv  Detail & Related papers  (2026-02-03T19:13:36Z)
• Knowledge-Informed Kernel State Reconstruction for Interpretable Dynamical System Discovery [46.9843470803458]
  MAAT (Model Aware Approximation of Trajectories) is a framework for symbolic discovery built on knowledge-informed Kernel State Reconstruction.<n>It substantially reduces state-estimation MSE for trajectories and derivatives used by downstream symbolic regression.
  arXiv  Detail & Related papers  (2026-01-29T21:15:52Z)
• Manifold Percolation: from generative model to Reinforce learning [0.26905021039717986]
  Generative modeling is typically framed as learning mapping rules, but from an observer's perspective without access to these rules, the task becomes disentangling the geometric support from the probability distribution.<n>We propose that continuum percolation is uniquely suited to this support analysis, as the sampling process effectively projects high-dimensional density estimation onto a geometric counting problem on the support.
  arXiv  Detail & Related papers  (2025-11-25T17:12:42Z)
• Convergence of Score-Based Discrete Diffusion Models: A Discrete-Time Analysis [56.442307356162864]
  We study the theoretical aspects of score-based discrete diffusion models under the Continuous Time Markov Chain (CTMC) framework.<n>We introduce a discrete-time sampling algorithm in the general state space $[S]d$ that utilizes score estimators at predefined time points.<n>Our convergence analysis employs a Girsanov-based method and establishes key properties of the discrete score function.
  arXiv  Detail & Related papers  (2024-10-03T09:07:13Z)
• Joint Bayesian Inference of Graphical Structure and Parameters with a Single Generative Flow Network [59.79008107609297]
  We propose in this paper to approximate the joint posterior over the structure of a Bayesian Network. We use a single GFlowNet whose sampling policy follows a two-phase process. Since the parameters are included in the posterior distribution, this leaves more flexibility for the local probability models.
  arXiv  Detail & Related papers  (2023-05-30T19:16:44Z)
• Exploring Predictive States via Cantor Embeddings and Wasserstein Distance [0.0]
  We show how Wasserstein distances may be used to detect predictive equivalences in symbolic data. We show that exploratory data analysis using the resulting geometry provides insight into the temporal structure of processes.
  arXiv  Detail & Related papers  (2022-06-09T00:09:47Z)
• Bayesian Topological Learning for Classifying the Structure of Biological Networks [1.644043499620662]
  Actin cytoskeleton networks generate local topological signatures due to the natural variations in the number, size, and shape of holes of the networks. Persistent homology is a method that explores these topological properties of data and summarizes them as persistence diagrams. We implement a Bayes factor algorithm to classify the actin filament networks and benchmark it against several state-of-the-art classification methods.
  arXiv  Detail & Related papers  (2020-09-24T22:43:03Z)
• Nonparametric Score Estimators [49.42469547970041]
  Estimating the score from a set of samples generated by an unknown distribution is a fundamental task in inference and learning of probabilistic models. We provide a unifying view of these estimators under the framework of regularized nonparametric regression. We propose score estimators based on iterative regularization that enjoy computational benefits from curl-free kernels and fast convergence.
  arXiv  Detail & Related papers  (2020-05-20T15:01:03Z)
• Stable and consistent density-based clustering via multiparameter persistence [49.1574468325115]
  We consider the degree-Rips construction from topological data analysis.<n>We analyze its stability to perturbations of the input data using the correspondence-interleaving distance.<n>We integrate these methods into a pipeline for density-based clustering, which we call Persistable.
  arXiv  Detail & Related papers  (2020-05-18T19:45:04Z)

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.