Bayesian inference for models that have an intractable partition function is known as a doubly intractable problem, where standard Monte Carlo methods are not applicable. The past decade has seen the development of auxiliary variable Monte Carlo techniques (Møller et al., 2006; Murray et al., 2006) for tackling this pr…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,657 papers · 148 categories
Trend · papers per month
17 results for “Doubly-intractable”
A new method improves inference for complex Bayesian models.
problem Bayesian inference for doubly intractable distributions is computationally challenging.
method Monte Carlo Stein variational gradient descent (MC-SVGD) approach.
result The method achieves substantial computational gains over existing algorithms.
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…
New method for MCMC models without perfect or sequential samplers.
problem Bayesian inference for complex models with intractable terms.
method Utilizes tractable independence model to construct unbiased estimates.
result Scalable method for high-dimensional models.
A large number of statistical models are "doubly-intractable": the likelihood normalising term, which is a function of the model parameters, is intractable, as well as the marginal likelihood (model evidence). This means that standard inference techniques to sample from the posterior, such as Markov chain Monte Carlo (…
Computing partition functions, the normalizing constants of probability distributions, is often hard. Variants of importance sampling give unbiased estimates of a normalizer Z, however, unbiased estimates of the reciprocal 1/Z are harder to obtain. Unbiased estimates of 1/Z allow Markov chain Monte Carlo sampling of "d…
Undirected graphical models are applied in genomics, protein structure prediction, and neuroscience to identify sparse interactions that underlie discrete data. Although Bayesian methods for inference would be favorable in these contexts, they are rarely used because they require doubly intractable Monte Carlo sampling…
The exchange algorithm is studied for its convergence and asymptotic variance.
problem Theoretical limitations of the exchange algorithm in sampling from doubly-intractable distributions.
method Theoretical analysis of the exchange algorithm's convergence speed and asymptotic variance.
result The exchange algorithm converges at a geometric rate and satisfies a Central Limit Theorem.
New MCMC methods use auxiliary variables to sample from intractable distributions.
problem Sampling from distributions with unknown normalizing constants.
method Unified Markov chain Monte Carlo framework with auxiliary variables.
result New algorithms outperform existing methods on synthetic and real datasets.
Action-BED: Task-Driven Bayesian Experimental Design
problem Bayesian experimental design with doubly intractable objectives
method Formulating BED in terms of expected future loss (EFL) and optimising it with stochastic gradients
result Simplified and task-driven framework for BED
Bayesian approach for inhomogeneous Poisson process intensity estimation.
problem Intractable integral in likelihood of Gaussian Cox process.
method Joint modeling of intensity and cumulative intensity as transformed Gaussian process; exact MCMC sampler.
result Exact posterior inference without approximations.
Delayed acceptance ABC-SMCstat.CO
Approximate Bayesian computation (ABC) is now an established technique for statistical inference used in cases where the likelihood function is computationally expensive or not available. It relies on the use of a~model that is specified in the form of a~simulator, and approximates the likelihood at a~parameter value $…
New method uses neural exponential families for likelihood-free inference.
problem Bayesian Likelihood-Free Inference with intractable likelihood.
method Score Matching neural conditional exponential families for approximate likelihood.
result State-of-the-art performance in posterior sampling for intractable likelihood models.
NPE improves scalability and efficiency for ERGMs.
problem Scalability and efficiency issues in Bayesian ERGM estimation.
method Neural posterior estimation (NPE) for ERGMs using neural network density estimation.
result NPE provides more efficient and scalable inference for ERGMs.
New scalable variational Bayes methods for Hawkes processes.
problem Computational intractability of Bayesian estimation for generalised nonlinear Hawkes processes.
method Unified variational Bayes framework, adaptive mean-field approximation, sparsity-inducing procedure.
result Adaptive mean-field variational algorithm for sigmoid Hawkes processes is scalable and robust.
This paper addresses challenges in flexibly modeling multimodal data that lie on constrained spaces. Such data are commonly found in spatial applications, such as climatology and criminology, where measurements are restricted to a geographical area. Other settings include domains where unsuitable recordings are discard…
Clustered Mallows Modelstat.ME
Extends Mallows model to handle item indifference in rankings.
problem Real data often contains item indifference, challenging strict preference assumptions.
method Proposes Clustered Mallows Model (CMM) to accommodate item indifference.
result CMM provides a flexible representation of rank collections with ordered clusters.