Nonparametric undirected graphical model selection using diffusion models

• URL: http://arxiv.org/abs/2606.08468v1
• Date: Sun, 07 Jun 2026 06:22:13 GMT
• Title: Nonparametric undirected graphical model selection using diffusion models
• Abstract summary: We develop a nonparametric approach to undirected graphical model selection based on diffusion models.<n>We demonstrate its empirical performance through extensive simulations and two real data analyses.
• Score: 3.6515314438258097
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Undirected graphical models provide a fundamental framework for representing conditional independence structures among high-dimensional random variables. While undirected graphical model selection has become a central problem in high-dimensional statistics, most existing methods are restricted to parametric settings. In this paper, we develop a nonparametric approach to undirected graphical model selection based on diffusion models. Recent work has shown that diffusion models can adapt to the unknown graph structure of the underlying distribution, yet utilizing these models for explicit graph estimation remains unexplored. To bridge this gap, we introduce a novel diffusion-based method for nonparametric undirected graphical model selection. We establish the model selection consistency of the proposed method and demonstrate its empirical performance through extensive simulations and two real data analyses.

Related papers

• Diffusion Model for Manifold Data: Score Decomposition, Curvature, and Statistical Complexity [93.52679474816728]
  Diffusion models have become a leading framework in generative modeling.<n>This paper investigates how diffusion models learn structured data, focusing on two key aspects: statistical complexity and influence of data geometric properties.<n>We also highlight the interplay of manifold curvature with the structures in the score function.
  arXiv  Detail & Related papers  (2026-03-21T04:40:19Z)
• Nonparametric Data Attribution for Diffusion Models [57.820618036556084]
  Data attribution for generative models seeks to quantify the influence of individual training examples on model outputs.<n>We propose a nonparametric attribution method that operates entirely on data, measuring influence via patch-level similarity between generated and training images.
  arXiv  Detail & Related papers  (2025-10-16T03:37:16Z)
• Simple and Critical Iterative Denoising: A Recasting of Discrete Diffusion in Graph Generation [0.0]
  dependencies between intermediate noisy states lead to error accumulation and propagation during the reverse denoising process.<n>We propose a novel framework called Simple Iterative Denoising, which simplifies discrete diffusion and circumvents the issue.<n>Our empirical evaluations demonstrate that the proposed method significantly outperforms existing discrete diffusion baselines in graph generation tasks.
  arXiv  Detail & Related papers  (2025-03-27T15:08:58Z)
• Continuous Diffusion Model for Language Modeling [64.7425225935854]
  Existing continuous diffusion models for discrete data underperform compared to discrete methods.<n>We propose a continuous diffusion model for language modeling that incorporates the geometry of the underlying categorical distribution.<n>Our method outperforms existing discrete diffusion models and approaches the performance of autoregressive models.
  arXiv  Detail & Related papers  (2025-02-17T08:54:29Z)
• Surrogate models for diffusion on graphs via sparse polynomials [0.0]
  We provide sparse-based surrogate models for parametric diffusion equations on graphs with community structure.<n>Our theoretical findings are accompanied by a series of numerical experiments conducted on both synthetic and real-world graphs.
  arXiv  Detail & Related papers  (2025-02-10T15:57:33Z)
• Accelerated Diffusion Models via Speculative Sampling [89.43940130493233]
  Speculative sampling is a popular technique for accelerating inference in Large Language Models.<n>We extend speculative sampling to diffusion models, which generate samples via continuous, vector-valued Markov chains.<n>We propose various drafting strategies, including a simple and effective approach that does not require training a draft model.
  arXiv  Detail & Related papers  (2025-01-09T16:50:16Z)
• Identification of Non-causal Graphical Models [0.0]
  The paper considers the problem to estimate non-causal graphical models whose edges encode smoothing relations among the variables. We show that the solution minimizing the transportation distance with respect to white noise process is a double-sided autoregressive non-causal graphical model.
  arXiv  Detail & Related papers  (2024-10-12T10:40:46Z)
• Latent diffusion models for parameterization and data assimilation of facies-based geomodels [0.0]
  Diffusion models are trained to generate new geological realizations from input fields characterized by random noise. Latent diffusion models are shown to provide realizations that are visually consistent with samples from geomodeling software.
  arXiv  Detail & Related papers  (2024-06-21T01:32:03Z)
• Infinite-Dimensional Diffusion Models [3.9748528039819977]
  We formulate diffusion-based generative models in infinite dimensions and apply them to the generative modelling of functions.<n>Using our theory, we also develop guidelines for the design of infinite-dimensional diffusion models.
  arXiv  Detail & Related papers  (2023-02-20T18:00:38Z)
• Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations [57.15855198512551]
  We propose a novel score-based generative model for graphs with a continuous-time framework. We show that our method is able to generate molecules that lie close to the training distribution yet do not violate the chemical valency rule.
  arXiv  Detail & Related papers  (2022-02-05T08:21:04Z)
• Probabilistic Circuits for Variational Inference in Discrete Graphical Models [101.28528515775842]
  Inference in discrete graphical models with variational methods is difficult. Many sampling-based methods have been proposed for estimating Evidence Lower Bound (ELBO) We propose a new approach that leverages the tractability of probabilistic circuit models, such as Sum Product Networks (SPN) We show that selective-SPNs are suitable as an expressive variational distribution, and prove that when the log-density of the target model is aweighted the corresponding ELBO can be computed analytically.
  arXiv  Detail & Related papers  (2020-10-22T05:04:38Z)

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.