paper-with-me

Papers

Divide-and-Conquer Posterior Sampling for Denoising Diffusion Priors

2024-03-18 · Yazid Janati, Badr Moufad, Alain Durmus, Eric Moulines, Jimmy Olsson

Recent advancements in solving Bayesian inverse problems have spotlighted denoising diffusion models (DDMs) as effective priors. Although these have great potential, DDM priors yield complex posterior distributions that are challenging to sample. Existing approaches to posterior sampling in this context address this problem either by retraining model-specific components, leading to stiff and cumbersome methods, or by introducing approximations with uncontrolled errors that affect the accuracy of the produced samples. We present an innovative framework, divide-and-conquer posterior sampling, which leverages the inherent structure of DDMs to construct a sequence of intermediate posteriors that guide the produced samples to the target posterior. Our method significantly reduces the approximation error associated with current techniques without the need for retraining. We demonstrate the versatility and effectiveness of our approach for a wide range of Bayesian inverse problems. The code is available at \url{https://github.com/Badr-MOUFAD/dcps}

📄 PDF Abstract BibTeX arXiv:2403.11407

Code (1)

badr-moufad/dcps 공식 구현 jax

Tasks

DenoisingImage Restoration

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically
Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…

Similar Papers 제목 키워드 기반

Diffusion Generative Modelling for Divide-and-Conquer MCMC

2024-06-17 · C. Trojan, P. Fearnhead, C. Nemeth

Divide-and-conquer MCMC is a strategy for parallelising Markov Chain Monte Carlo sampling by running independent samplers on disjoint subsets of a dataset and merging their output. An ongoing challenge in the literature …

Density Estimation

Parallelising MCMC via Random Forests

2019-11-21 · Wu Changye, Christian P. Robert

For Bayesian computation in big data contexts, the divide-and-conquer MCMC concept splits the whole data set into batches, runs MCMC algorithms separately over each batch to produce samples of parameters, and combines th…

Divide-and-Conquer: Towards Generalizable Amortized Bayesian Inference for the Drift Diffusion Model

2026-08-04 · Yufei Wu, Shanqing Gao, Andreas Voss, Francis Tuerlinckx arxiv

The drift diffusion model (DDM) is a cornerstone of cognitive decision-making research. Although numerous estimation methods exist, researchers continue to seek inference approaches that are both fast and flexible across…

Bayesian Inference

SwISS: A Scalable Markov chain Monte Carlo Divide-and-Conquer Strategy

2022-08-08 · Callum Vyner, Christopher Nemeth, Chris Sherlock

Divide-and-conquer strategies for Monte Carlo algorithms are an increasingly popular approach to making Bayesian inference scalable to large data sets. In its simplest form, the data are partitioned across multiple compu…

Bayesian Inference

SaGess: Sampling Graph Denoising Diffusion Model for Scalable Graph Generation

2023-06-29 · Stratis Limnios, Praveen Selvaraj, Mihai Cucuringu, Carsten Maple 외

Over recent years, denoising diffusion generative models have come to be considered as state-of-the-art methods for synthetic data generation, especially in the case of generating images. These approaches have also prove…

DenoisingGraph GenerationLink PredictionSynthetic Data Generation