paper-with-me

홈 › Papers

Variationally Inferred Sampling Through a Refined Bound for Probabilistic Programs

2019-08-26 · Victor Gallego, David Rios Insua

A framework to boost the efficiency of Bayesian inference in probabilistic programs is introduced by embedding a sampler inside a variational posterior approximation. We call it the refined variational approximation. Its strength lies both in ease of implementation and automatically tuning of the sampler parameters to speed up mixing time using automatic differentiation. Several strategies to approximate \emph{evidence lower bound} (ELBO) computation are introduced. Experimental evidence of its efficient performance is shown solving an influence diagram in a high-dimensional space using a conditional variational autoencoder (cVAE) as a deep Bayes classifier; an unconditional VAE on density estimation tasks; and state-space models for time-series data.

📄 PDF Abstract BibTeX arXiv:1908.09744

Code (1)

vicgalle/vis 공식 구현 pytorch

Tasks

Bayesian InferenceDensity EstimationState Space ModelsTime SeriesTime Series Analysis

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…
Solana Customer Service Number +1-833-534-1729 설명 없음
USD Coin Customer Service Number +1-833-534-1729 설명 없음

Similar Papers 제목 키워드 기반

Variationally Inferred Sampling Through a Refined Bound

2019-10-16 · pproximateinference AABI Symposium 2019 12 · Victor Gallego, David Rios Insua

A framework for efficient Bayesian inference in probabilistic programs is introduced by embedding a sampler inside a variational posterior approximation. Its strength lies in both ease of implementation and automatically…

Bayesian InferenceDensity EstimationState Space ModelsTime Series+1

Dynamic Importance Sampling for Anytime Bounds of the Partition Function

2017-12-01 · NeurIPS 2017 12 · Qi Lou, Rina Dechter, Alexander T. Ihler

Computing the partition function is a key inference task in many graphical models. In this paper, we propose a dynamic importance sampling scheme that provides anytime finite-sample bounds for the partition function. Ou…

Heuristic Search

Inference-Time Alignment for Diffusion Models via Variationally Stable Doob's Matching

2026-01-10 · Jinyuan Chang, Chenguang Duan, Yuling Jiao, Yi Xu 외 arxiv

Inference-time alignment for diffusion models aims to adapt a pre-trained reference diffusion model toward a target distribution without retraining the reference score network, thereby preserving the generative capacity …

Variationally correct operator learning: Reduced basis neural operator with a posteriori error estimation

2025-12-24 · Yuan Qiu, Wolfgang Dahmen, Peng Chen arxiv

Minimizing PDE-residual losses is a common strategy to promote physical consistency in neural operators. However, standard formulations often lack variational correctness, meaning that small residuals do not guarantee sm…

Parameter-free Stochastic Optimization of Variationally Coherent Functions

2021-01-30 · Francesco Orabona, Dávid Pál

We design and analyze an algorithm for first-order stochastic optimization of a large class of functions on $\mathbb{R}^d$. In particular, we consider the \emph{variationally coherent} functions which can be convex or no…

Stochastic Optimization