The reviewed record of science sign in
Pith

arxiv: 2502.13757 · v3 · pith:SUTLGUHB · submitted 2025-02-19 · stat.ML · cs.LG

Identifying Metric Structures of Deep Latent Variable Models

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:SUTLGUHBrecord.jsonopen to challenge →

classification stat.ML cs.LG
keywords latentvariabledatadeepmodelmodelsadditionaldistances
0
0 comments X
read the original abstract

Deep latent variable models learn condensed representations of data that, hopefully, reflect the inner workings of the studied phenomena. Unfortunately, these latent representations are not statistically identifiable, meaning they cannot be uniquely determined. Domain experts, therefore, need to tread carefully when interpreting these. Current solutions limit the lack of identifiability through additional constraints on the latent variable model, e.g. by requiring labeled training data, or by restricting the expressivity of the model. We change the goal: instead of identifying the latent variables, we identify relationships between them such as meaningful distances, angles, and volumes. We prove this is feasible under very mild model conditions and without additional labeled data. We empirically demonstrate that our theory results in more reliable latent distances, offering a principled path forward in extracting trustworthy conclusions from deep latent variable models.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Unsupervised Causal Abstractions Discovery

    cs.LG 2026-06 unverdicted novelty 6.0

    Low-rank graphs induce latents that form causal abstractions, with identifiability results and a practical objective enabling unsupervised learning of high-level SCMs from low-level measurements.