Related papers: Multidimensional sampling for simulation and integ…
This paper addresses the challenging computational problem of estimating intractable expectations over discrete domains. Existing approaches, including Monte Carlo and Russian Roulette estimators, are consistent but often require a large…
For real symmetric matrices that are accessible only through matrix vector products, we present Monte Carlo estimators for computing the diagonal elements. Our probabilistic bounds for normwise absolute and relative errors apply to Monte…
Quantum mechanics for many-body systems may be reduced to the evaluation of integrals in 3N dimensions using Monte-Carlo, providing the Quantum Monte Carlo ab initio methods. Here we limit ourselves to expectation values for trial…
Orthogonal Monte Carlo (OMC) is a very effective sampling algorithm imposing structural geometric conditions (orthogonality) on samples for variance reduction. Due to its simplicity and superior performance as compared to its Quasi Monte…
We formulate both Markov chain Monte Carlo (MCMC) sampling algorithms and basic statistical physics in terms of elementary symmetries. This perspective on sampling yields derivations of well-known MCMC algorithms and a new parallel…
An introduction to numerical large-deviation sampling is provided. First, direct biasing with a known distribution is explained. As simple example, the Bernoulli experiment is used throughout the text. Next, Markov chain Monte Carlo (MCMC)…
Quasi-Monte Carlo (QMC) integration over unbounded domains $\mathbb{R}^s$ remains challenging due to the high dimensionality of sampling space and the boundary growth of the integrand. In applications such as uncertainty quantification…
Quantum computing was so far mainly concerned with discrete problems. Recently, E. Novak and the author studied quantum algorithms for high dimensional integration and dealt with the question, which advantages quantum computing can bring…
In a recent paper Keister proposed two quadrature rules as alternatives to Monte Carlo for certain multidimensional integrals and reported his test results. In earlier work we had shown that the quasi-Monte Carlo method with generalized…
This paper describes a new algorithm for Monte Carlo integration, based on the Field Estimator for Arbitrary Spaces (FiEstAS). The algorithm is discussed in detail, and its performance is evaluated in the context of Bayesian analysis, with…
In particle-based algorithms, the effect of binary collisions is commonly described in a statistical way, using Monte Carlo techniques. It is shown that, in the relativistic regime, stringent constraints should be considered on the sampling…
Dynamical triangulations of four-dimensional Euclidean quantum gravity give rise to an interesting, numerically accessible model of quantum gravity. We give a simple introduction to the model and discuss two particularly important issues.…
The concept of discrepancy plays an important role in the study of uniformity properties of point sets. For sets of random points, the discrepancy is a random variable. We apply techniques from quantum field theory to translate the problem…
In my lectures at the Les Houches Summer School 2008, I discussed central concepts of computational statistical physics, which I felt would be accessible to the very cross-cultural audience at the school. I started with a discussion of…
We consider the problem of estimating the expected outcomes of Monte Carlo processes whose outputs are described by multidimensional random variables. We tightly characterize the quantum query complexity of this problem for various choices…
Spectral clustering is a popular unsupervised learning technique which is able to partition unlabelled data into disjoint clusters of distinct shapes. However, the data under consideration are often experimental data, implying that the data…
Complex scientific models where the likelihood cannot be evaluated present a challenge for statistical inference. Over the past two decades, a wide range of algorithms have been proposed for learning parameters in computationally feasible…
In this study, we give an extension of Montanaro's arXiv/archive:1504.06987 quantum Monte Carlo method, tailored for computing expected values of random variables that exhibit infinite variance. This addresses a challenge in analyzing…
An effective two-stage method for an estimation of parameters of the linear regression is considered. For this purpose we introduce a certain quasi-estimator that, in contrast to usual estimator, produces two alternative estimates. It is…
We introduce a powerful and flexible MCMC algorithm for stochastic simulation. The method builds on a pseudo-marginal method originally introduced in [Genetics 164 (2003) 1139--1160], showing how algorithms which are approximations to an…