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
48 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.
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 (…
Doubly SGD improves convergence for intractable objective optimization.
problem Optimizing objectives in sum of intractable expectations.
method Doubly SGD with doubly stochastic gradients and independent minibatching.
result Established convergence of doubly SGD under general conditions, including dependent component gradient estimators.
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.
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…
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…
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
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.
A new MCMC method for GPs tackles computational burden and intractable likelihoods.
problem High computational burden and intractable likelihoods in Gaussian process models.
method Combines variationally sparse Gaussian processes with pseudo-marginal MCMC.
result Asymptotically exact inference with computational gains for large datasets.
We extend the existing framework of semi-implicit variational inference (SIVI) and introduce doubly semi-implicit variational inference (DSIVI), a way to perform variational inference and learning when both the approximate posterior and the prior distribution are semi-implicit. In other words, DSIVI performs inference …
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.
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.
Graph alignment problem solved with convex relaxations for correlated matrices.
problem Recovering hidden vertex permutations from correlated Gaussian matrices.
method Convex relaxations of the quadratic assignment problem over doubly stochastic matrices.
result The solution of the convex relaxation concentrates around the ground-truth permutation matrix for certain correlation parameters.
BiDVL improves EBLVMs for visual tasks by optimizing two variational distributions.
problem Training EBLVMs is challenging due to intractable distributions.
method Bi-level doubly variational learning with two tractable distributions.
result BiDVL achieves impressive image generation and reconstruction performance.
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.
Paper extends LME models to allow sign constraints on coefficients with SDTN random effects.
problem Inference with sign constraints on random effects in LME models.
method Proposes SDTN distribution for random effects and develops likelihood-based approaches for estimation.
result Proposed constrained model improves real-world interpretations and achieves satisfactory performance.
The paper examines Einstein doubly warped product manifolds with a semi-symmetric metric connection.
problem Characterizing Einstein doubly warped product manifolds with a semi-symmetric metric connection.
method Deriving curvature formulas and proving necessary and sufficient conditions for a manifold to be a warped product.
result Obtained results for Einstein doubly warped product manifolds and Einstein-like doubly warped product manifolds.
Characterizes spacetimes using doubly torqued vectors.
problem Classifying spacetimes based on their geometric properties.
method Characterization through doubly torqued vectors and their properties.
result Doubly twisted and Kundt spacetimes can be characterized.
New invariant measures doubly slice links, disproving previous bounds.
problem Understanding doubly slice links and their invariants.
method Introduced new invariant to measure doubly slice links and disproved previous bounds.
result Examples of links with large doubly slice genus but .
Characterizes a specific type of spacetime using vector fields.
problem Classifying a specific type of spacetime.
method Using vector fields to characterize 1+n doubly twisted spacetimes.
result Simple classification of 1+n doubly-twisted spacetimes.
Characterizes and examines gradient solitons on doubly warped product manifolds.
problem Understanding gradient solitons on specific manifold structures.
method Characterizations and examinations of various types of gradient solitons on doubly warped product manifolds.
result Effects of gradient solitons on factor manifolds and specific curvature properties of doubly warped products.
The article enumerates doubly symmetric diagrams for knots up to 18 crossings.
problem Enumerating doubly symmetric diagrams for knots.
method Developed an enumeration strategy for prime knots given by doubly symmetric diagrams.
result Determined all cases of doubly symmetric diagrams up to 18 crossings.
Deep latent variable models have become a popular model choice due to the scalable learning algorithms introduced by (Kingma & Welling, 2013; Rezende et al., 2014). These approaches maximize a variational lower bound on the intractable log likelihood of the observed data. Burda et al. (2015) introduced a multi-sample v…
Proposes DR-ACI for causal effect intervals with temporal dependence.
problem Causal effect intervals under temporal dependence.
method Doubly robust adaptive conformal inference (DR-ACI).
result Constructs prediction intervals for causal effects.
Simplified tutorial on doubly robust learning for causal inference.
problem Challenges in applying doubly robust methods due to complexity and software barriers.
method Combines propensity score and outcome modeling for robust causal inference.
result Makes doubly robust learning accessible through simplified methodology and practical examples.
We show that if the connected sum of two knots with coprime Alexander polynomials is doubly slice, then the Ozsváth-Szabó correction terms as smooth double sliceness obstructions vanish for both knots. Recently, Jeffrey Meier gave smoothly slice knots that are topologically doubly slice, but not smoothly doubly slice. …
In this article, we present a complete study of two disjoint classes of conformal vector fields on doubly warped product manifolds as well as on doubly warped space-times. Then we study Ricci solitons on doubly warped product manifollds admitting these types of conformal vector fields.
Identifies doubly slice genera for 2909 prime knots with up to 12 crossings.
problem Determining the doubly slice genera of prime knots.
method Identifies the minimal genus for each knot that divides a surface in .
result Identified the doubly slice genera for 2909 prime knots with up to 12 crossings.
The paper shows some Montesinos links can't be doubly sliced strongly.
problem Understanding double sliceness for Montesinos links.
method Using branched double covers and Seifert fibered spaces.
result A large family of Montesinos links are not strongly doubly slice.
We define an obstruction for a knot to be Z[Z]-homology ribbon, and use this to provide restrictions on the integers that can occur as the triple linking numbers of derivative links of knots that are either homotopy ribbon or doubly slice. Our main application finds new non-doubly slice knots. In particular this gives …
Hamiltonian cycles found in toroidal maps.
problem Hamiltonicity of doubly semi-equivelar maps on the torus.
method Analyzing 2-uniform tilings of the plane to derive Hamiltonian cycles.
result Every doubly semi-equivelar map on the torus contains a Hamiltonian cycle.
New lower bound for doubly slice genus using knot signatures.
problem Finding a lower bound for the doubly slice genus of knots.
method Using the classical signature function to derive a new lower bound.
result Proved that for every nonnegative integer N, there exists a knot with exactly N difference between slice and doubly slice genus.
In this paper we study fundamental geometric properties of doubly warped product immersion which is an extension of warped product immersion. Moreover, we study geometric inequality for doubly warped products isometrically immersed in arbitrary Riemannian manifolds.
Paper defines new risk measures for elliptical distributions.
problem Risk measurement for elliptical distributions.
method DTM, DTS, DTK definitions and formula derivation for specific distributions.
result Explicit formulas for DTE, DTV, DTS, and DTK for various distributions.
Some basic geometric properties of doubly twisted product immersions are established.
We give a formula for Alexander polynomials of doubly primitive knots.
We construct an infinite family of smoothly slice knots that we prove are topologically doubly slice. Using the correction terms coming from Heegaard Floer homology, we show that none of these knots is smoothly doubly slice. We use these knots to show that the subgroup of the double concordance group consisting of smoo…
The twisting number of a ribbon knot is at least as large as its doubly slice genus.
problem Proving a lower bound for the twisting number of ribbon knots in terms of their doubly slice genus.
method Analyzing symmetric unions and tangle replacements to establish the bound.
result Ribbon knots have arbitrarily high twisting numbers, matching their doubly slice genus.
In this paper, we introduce horizontal and vertical warped product Finsler manifold. We prove that every C-reducible or proper Berwaldian doubly warped product Finsler manifold is Riemannian. Then, we find the relation between Riemmanian curvatures of doubly warped product Finsler manifold and its components, and consi…
Double Machine Learning Methods for Estimating Average Treatment Effects: A Comparative Studystat.ME
New methods combine machine learning with doubly robust estimators for better treatment effect estimation.
problem Estimating average treatment effects from observational data.
method Doubly robust methods using machine learning techniques.
result Machine learning improves the performance of doubly robust estimators.
We study the asymptotic behaviour of doubly periodic instantons with square-integrable curvature. Then, we establish the equivalence given by the Nahm transform between the doubly periodic instantons with square integrable curvature and the wild harmonic bundles on the dual torus.
New method glues Scherk surfaces into minimal surfaces, limiting possible outcomes.
problem Limiting the outcomes of gluing Scherk surfaces into minimal surfaces.
method Constructing minimal surfaces by stacking and gluing doubly periodic Scherk surfaces.
result Except for special cases, gluing more Scherk surfaces results in known minimal surfaces.
Study classifies submanifolds in probability simplex.
problem Classifying submanifolds in the probability simplex.
method Complete classification through geometric analysis.
result Doubly totally-umbilical submanifolds identified and classified.
We prove that an odd pretzel knot is doubly slice if it has twist parameters consisting of copies of and copies of for some odd integer . Combined with the work of Issa and McCoy, it follows that these are the only doubly slice odd pretzel knots.
Using Traizet's regeneration method, we prove that for each positive integer n there is a family of embedded, doubly periodic minimal surfaces with parallel ends in Euclidean space of genus 2n-1 and 4 ends in the quotient by the maximal group of translations. The genus 2n-1 family converges smoothly to 2n copies of Sch…