arXiv research

HDT improves MCMC on graphs with history-dependent sampling.

BiDAG R package learns and samples Bayesian network structures efficiently.

Acyclic digraphs are the underlying representation of Bayesian networks, a widely used class of probabilistic graphical models. Learning the underlying graph from data is a way of gaining insights about the structural properties of a domain. Structure learning forms one of the inference challenges of statistical graphi…

A graph homomorphism is a map between two graphs that preserves adjacency relations. We consider the problem of sampling a random graph homomorphism from a graph into a large network. We propose two complementary MCMC algorithms for sampling random graph homomorphisms and establish bounds on their mixing times and the …

Bayesian structure learning improved using GFlowNets.

In Peña (2007), MCMC sampling is applied to approximately calculate the ratio of essential graphs (EGs) to directed acyclic graphs (DAGs) for up to 20 nodes. In the present paper, we extend that work from 20 to 31 nodes. We also extend that work by computing the approximate ratio of connected EGs to connected DAGs, of …

Proposes BGCN-NRWS for semi-supervised node classification with reduced overfitting.

We introduce Tempered Geodesic Markov Chain Monte Carlo (TG-MCMC) algorithm for initializing pose graph optimization problems, arising in various scenarios such as SFM (structure from motion) or SLAM (simultaneous localization and mapping). TG-MCMC is first of its kind as it unites asymptotically global non-convex opti…

A D-Wave quantum annealer (QA) having a 2048 qubit lattice, with no missing qubits and couplings, allowed embedding of a complete graph of a Restricted Boltzmann Machine (RBM). A handwritten digit OptDigits data set having 8x7 pixels of visible units was used to train the RBM using a classical Contrastive Divergence. E…

Bayesian learning for forests and trees improves graph detection and structure learning.

LIC compiles probabilistic models to generate efficient MCMC proposals.

This supplementary material includes three parts: some preliminary results, four examples, an experiment, three new algorithms, and all proofs of the results in the paper "Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs".

Smoothed fitness landscape improves protein optimization.

SteinGen generates diverse graph samples from a single example.

Nonlinear MCMC improves Bayesian machine learning sampling.

The rapid development of computing power and efficient Markov Chain Monte Carlo (MCMC) simulation algorithms have revolutionized Bayesian statistics, making it a highly practical inference method in applied work. However, MCMC algorithms tend to be computationally demanding, and are particularly slow for large datasets…

PL-MCMC samples from normalizing flows' conditional distributions.

We present a new Markov chain Monte Carlo method for estimating posterior probabilities of structural features in Bayesian networks. The method draws samples from the posterior distribution of partial orders on the nodes; for each sampled partial order, the conditional probabilities of interest are computed exactly. We…

Markov Chain Monte Carlo (MCMC) and Belief Propagation (BP) are the most popular algorithms for computational inference in Graphical Models (GM). In principle, MCMC is an exact probabilistic method which, however, often suffers from exponentially slow mixing. In contrast, BP is a deterministic method, which is typicall…

This study investigates the effects of Markov chain Monte Carlo (MCMC) sampling in unsupervised Maximum Likelihood (ML) learning. Our attention is restricted to the family of unnormalized probability densities for which the negative log density (or energy function) is a ConvNet. We find that many of the techniques used…

Bayesian networks are probabilistic graphical models widely employed to understand dependencies in high dimensional data, and even to facilitate causal discovery. Learning the underlying network structure, which is encoded as a directed acyclic graph (DAG) is highly challenging mainly due to the vast number of possible…

Bayesian method learns graph structures from Gaussian data efficiently.

There has been recent interest in developing scalable Bayesian sampling methods such as stochastic gradient MCMC (SG-MCMC) and Stein variational gradient descent (SVGD) for big-data analysis. A standard SG-MCMC algorithm simulates samples from a discrete-time Markov chain to approximate a target distribution, thus samp…

This paper tackles sampling issues in latent space EBMs by introducing diffusion-based amortization.

Paper proposes a method to improve MCMC sampling for energy-based models.

Neural network MCMC sampler maximizes proposal entropy for efficient sampling.

AI-driven framework optimizes MCMC-based preconditioners for faster linear system solving.

Bayesian neural networks tutorial via MCMC in Python.

Stochastic gradient Markov chain Monte Carlo (SG-MCMC) has been increasingly popular in Bayesian learning due to its ability to deal with large data. A standard SG-MCMC algorithm simulates samples from a discretized-time Markov chain to approximate a target distribution. However, the samples are typically highly correl…

This paper analyzes MCMC algorithms on large graphs using Dirichlet forms.

Improved sampling accuracy in SG-MCMC methods via non-uniform gradient subsampling.

We propose a novel approximate inference algorithm that approximates a target distribution by amortising the dynamics of a user-selected MCMC sampler. The idea is to initialise MCMC using samples from an approximation network, apply the MCMC operator to improve these samples, and finally use the samples to update the a…

Sampling from posterior distributions using Markov chain Monte Carlo (MCMC) methods can require an exhaustive number of iterations, particularly when the posterior is multi-modal as the MCMC sampler can become trapped in a local mode for a large number of iterations. In this paper, we introduce the pseudo-extended MCMC…

BIGUE algorithm provides credible intervals for hyperbolic network embeddings.

EBM life cycle project improves MCMC for image generation, defense, and density modeling.

The paper parallelizes MCMC using random forests for big data Bayesian computation.

Markov chain Monte Carlo (MCMC) methods are widely used in machine learning. One of the major problems with MCMC is the question of how to design chains that mix fast over the whole state space; in particular, how to select the parameters of an MCMC algorithm. Here we take a different approach and, similarly to paralle…

This paper proposes a method to train energy-based models using variational auto-encoders for efficient sampling.

Paper proposes first unlearning algorithm for MCMC models.

Markov chain Monte Carlo (MCMC) algorithms are widely used to sample from complicated distributions, especially to sample from the posterior distribution in Bayesian inference. However, MCMC is not directly applicable when facing the doubly intractable problem. In this paper, we discussed and compared two existing solu…

Cyclical MCMC tackles high-dimensional multimodal distributions, showing convergence under certain conditions.

This work optimizes MCMC algorithms for modern accelerators without synchronization overheads.

Study improves Bayesian calibration of mechanical properties using active learning and MCMC.

New MCMC method corrects bias without extra cost.

The paper proposes methods to estimate MCMC quality with couplings, bounding Wasserstein distance.

A new Monte Carlo sampling method derived from reverse diffusion.

KSD Thinning uses KSD to thin MCMC samples efficiently.

New analysis of SGD with MCMC gradient estimator shows convergence rate and saddle point escape.