Dependence Fidelity and Downstream Inference Stability in Generative Models

• URL: http://arxiv.org/abs/2603.17041v1
• Date: Tue, 17 Mar 2026 18:24:31 GMT
• Title: Dependence Fidelity and Downstream Inference Stability in Generative Models
• Abstract summary: Covariance-level dependence fidelity is a useful criterion for evaluating generative models.<n> dependence divergence induces quantitative instability in downstream inference.<n>These results highlight dependence fidelity as a useful diagnostic for evaluating generative models.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent advances in generative AI have led to increasingly realistic synthetic data, yet evaluation criteria remain focused on marginal distribution matching. While these diagnostics assess local realism, they provide limited insight into whether a generative model preserves the multivariate dependence structures governing downstream inference. We introduce covariance-level dependence fidelity as a practical criterion for evaluating whether a generative distribution preserves joint structure beyond univariate marginals. We establish three core results. First, distributions can match all univariate marginals exactly while exhibiting substantially different dependence structures, demonstrating marginal fidelity alone is insufficient. Second, dependence divergence induces quantitative instability in downstream inference, including sign reversals in regression coefficients despite identical marginal behavior. Third, explicit control of covariance-level dependence divergence ensures stable behavior for dependence-sensitive tasks such as principal component analysis. Synthetic constructions illustrate how dependence preservation failures lead to incorrect conclusions despite identical marginal distributions. These results highlight dependence fidelity as a useful diagnostic for evaluating generative models in dependence-sensitive downstream tasks, with implications for diffusion models and variational autoencoders. These guarantees apply specifically to procedures governed by covariance structure; tasks requiring higher-order dependence such as tail-event estimation require richer criteria.

Related papers

• Learning Bidirectional Causal Interactions with Heteroscedastic Neural Networks [1.0356094515229846]
  This paper proposes SEM-DNN, a heteroscedastic neural simultaneous-equation estimator.<n>It learns reciprocal structural interactions without external instruments.<n>An application to ready-to-eat cereal scanner data illustrates how the method can study contemporaneous price-sales feedback.
  arXiv  Detail & Related papers  (2026-07-24T13:53:58Z)
• Uncertainty in Federated Granger Causality: From Origins to Systemic Consequences [3.122408196953971]
  Granger Causality (GC) provides a rigorous framework for learning causal structures from time-series data.<n> Federated GC algorithms only yield deterministic point estimates of causality and neglect uncertainty.<n>This paper establishes the first methodology for rigorously quantifying uncertainty.
  arXiv  Detail & Related papers  (2026-02-13T15:12:18Z)
• Mechanistic Independence: A Principle for Identifiable Disentangled Representations [7.550362088105815]
  Disentangled representations seek to recover latent factors of variation underlying observed data.<n>We introduce a unified framework in which disentanglement is achieved through mechanistic independence.
  arXiv  Detail & Related papers  (2025-09-26T10:58:03Z)
• Meta-Dependence in Conditional Independence Testing [11.302018782958205]
  We study a "meta-dependence" between conditional independence properties using the following geometric intuition.<n>We provide a simple-to-compute measure of this meta-dependence using information projections and consolidate our findings empirically using both synthetic and real-world data.
  arXiv  Detail & Related papers  (2025-04-17T02:41:22Z)
• Identifiable Latent Neural Causal Models [82.14087963690561]
  Causal representation learning seeks to uncover latent, high-level causal representations from low-level observed data. We determine the types of distribution shifts that do contribute to the identifiability of causal representations. We translate our findings into a practical algorithm, allowing for the acquisition of reliable latent causal representations.
  arXiv  Detail & Related papers  (2024-03-23T04:13:55Z)
• C-Disentanglement: Discovering Causally-Independent Generative Factors under an Inductive Bias of Confounder [35.09708249850816]
  We introduce a framework entitled Confounded-Disentanglement (C-Disentanglement), the first framework that explicitly introduces the inductive bias of confounder. We conduct extensive experiments on both synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2023-10-26T11:44:42Z)
• Identifiable Latent Polynomial Causal Models Through the Lens of Change [82.14087963690561]
  Causal representation learning aims to unveil latent high-level causal representations from observed low-level data.<n>One of its primary tasks is to provide reliable assurance of identifying these latent causal models, known as identifiability.
  arXiv  Detail & Related papers  (2023-10-24T07:46:10Z)
• Nonparametric Identifiability of Causal Representations from Unknown Interventions [63.1354734978244]
  We study causal representation learning, the task of inferring latent causal variables and their causal relations from mixtures of the variables. Our goal is to identify both the ground truth latents and their causal graph up to a set of ambiguities which we show to be irresolvable from interventional data.
  arXiv  Detail & Related papers  (2023-06-01T10:51:58Z)
• Exploiting Independent Instruments: Identification and Distribution Generalization [3.701112941066256]
  We exploit the independence for distribution generalization by taking into account higher moments. We prove that the proposed estimator is invariant to distributional shifts on the instruments. These results hold even in the under-identified case where the instruments are not sufficiently rich to identify the causal function.
  arXiv  Detail & Related papers  (2022-02-03T21:49:04Z)
• Disentangling Observed Causal Effects from Latent Confounders using Method of Moments [67.27068846108047]
  We provide guarantees on identifiability and learnability under mild assumptions. We develop efficient algorithms based on coupled tensor decomposition with linear constraints to obtain scalable and guaranteed solutions.
  arXiv  Detail & Related papers  (2021-01-17T07:48:45Z)
• Latent Causal Invariant Model [128.7508609492542]
  Current supervised learning can learn spurious correlation during the data-fitting process. We propose a Latent Causal Invariance Model (LaCIM) which pursues causal prediction.
  arXiv  Detail & Related papers  (2020-11-04T10:00:27Z)
• GenDICE: Generalized Offline Estimation of Stationary Values [108.17309783125398]
  We show that effective estimation can still be achieved in important applications. Our approach is based on estimating a ratio that corrects for the discrepancy between the stationary and empirical distributions. The resulting algorithm, GenDICE, is straightforward and effective.
  arXiv  Detail & Related papers  (2020-02-21T00:27:52Z)

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.