Research
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

127254380507 · Jun 202019922001200920172026
48 results for Monte-Carlo estimator

New estimator reduces nested expectation estimation costs.

problem Estimating repeatedly nested expectations is computationally expensive.
method Recursive Estimator for Arbitrary Depth (READ) using randomized multilevel Monte Carlo.
result Optimal computational cost of O(ε^(-2)) for every fixed D.

Adaptive Multilevel Monte Carlo improves probability estimation for complex random variables.

problem Estimating probabilities of complex random variables with multiple approximations.
method Adaptive Multilevel Monte Carlo framework for discontinuous functionals.
result Achieves optimal computational complexities for both smooth and discontinuous functionals.

Develops a multilevel Monte Carlo framework with dropout for efficient uncertainty quantification.

problem Efficiently quantify uncertainty in complex models using dropout.
method Integrates multilevel Monte Carlo with Monte Carlo dropout, creating coupled estimators to reduce variance.
result Demonstrates significant variance reduction and efficiency gains over single-level Monte Carlo dropout.

Quantum computing offers a quadratic speedup for estimating non-linear functionals.

problem Estimating non-linear functionals of probability distributions.
method Proposes a quantum-inside-quantum Monte Carlo algorithm for a broad class of non-linear estimation problems.
result Achieves a quadratic speedup for non-linear estimation problems, including nested conditional expectations and stochastic optimization.

The paper improves Monte Carlo methods for optimization problems.

problem Efficiently solving optimization problems with biased Monte Carlo estimators.
method Introduces Multilevel Monte Carlo (MLMC) within Sample Average Approximation (SAA).
result Establishes uniform convergence and sample complexity for MLMC in SAA.

Monte Carlo (MC) techniques are often used to estimate integrals of a multivariate function using randomly generated samples of the function. In light of the increasing interest in uncertainty quantification and robust design applications in aerospace engineering, the calculation of expected values of such functions (e…

2011-08-24abs ↗pdf ↗

SBMC method improves uncertainty estimation in deep learning models.

problem Improving uncertainty quantification in deep learning models.
method A scalable Bayesian Monte Carlo method using a model and parallel SMC/MCMC algorithm.
result SBMC achieves comparable or better accuracy and improved uncertainty quantification compared to state-of-the-art methods.

Researchers estimate optimal PAC-Bayes bounds using Hamiltonian Monte Carlo.

problem Estimating tight PAC-Bayes bounds with restricted posterior families.
method Sampling from optimal Gibbs posterior using Hamiltonian Monte Carlo, estimating KL divergence, and proposing high-probability bounds.
result Significant tightness gaps in PAC-Bayes bounds, up to 5-6% in some cases.

New insights into variational inference using Monte Carlo estimates.

problem Improving variational bounds in latent variable models.
method Analyzing properties of Monte Carlo estimates and their impact on variational gaps.
result Negative correlation reduces variational gaps, contrary to intuition.

A new Monte Carlo sampling method derived from reverse diffusion.

problem Sampling from complex distributions, especially multi-modal ones.
method Transforming score matching into mean estimation; estimating means of regularized posterior distributions.
result rdMC can approximate sampling with any desired accuracy and is significantly faster than MCMC for complex distributions.

Active Kriging Monte Carlo simulation method with conformal certification for failure probability estimation

problem Failure probability estimation in structural reliability analysis
method Active learning framework with conformal prediction
result Improved uncertainty quantification and reliability of failure probability estimates

Many machine learning problems involve Monte Carlo gradient estimators. As a prominent example, we focus on Monte Carlo variational inference (MCVI) in this paper. The performance of MCVI crucially depends on the variance of its stochastic gradients. We propose variance reduction by means of Quasi-Monte Carlo (QMC) sam…

2018-07-04abs ↗pdf ↗

The paper uses Fourier integral theorem for estimating multivariate distributions.

problem Estimating multivariate distributions and conditional distribution functions.
method Natural Monte Carlo and fully nonparametric estimators based on Fourier integral theorem.
result Explicit Monte Carlo estimators without estimated covariance matrix.

In this paper we propose a new approach to estimation of the tail exponent in financial stock markets. We begin the study with the finite sample behavior of the Hill estimator under α-stable distributions. Using large Monte Carlo simulations, we show that the Hill estimator overestimates the true tail exponent and can …

2012-01-23abs ↗pdf ↗

Sequential Monte Carlo (SMC) methods have successfully been used in many applications in engineering, statistics and physics. However, these are seldom used in financial option pricing literature and practice. This paper presents SMC method for pricing barrier options with continuous and discrete monitoring of the barr…

2014-05-21abs ↗pdf ↗

Estimates covariance matrices using Markov chain Monte Carlo with improved sample complexity.

problem Complexity of covariance matrix estimation for Gibbs distributions.
method Uses Markov chain Monte Carlo with conditions on the chain's spectral gap and Poincaré inequality.
result Achieves similar sample complexity as i.i.d. samples with better query complexity.

Regularized linear regression under the 1\ell_1 penalty, such as the Lasso, has been shown to be effective in variable selection and sparse modeling. The sampling distribution of an 1\ell_1-penalized estimator β^\hatβ is hard to determine as the estimator is defined by an optimization problem that in general can only…

2014-01-17abs ↗pdf ↗

Importance weighting is a general way to adjust Monte Carlo integration to account for draws from the wrong distribution, but the resulting estimate can be highly variable when the importance ratios have a heavy right tail. This routinely occurs when there are aspects of the target distribution that are not well captur…

2015-07-09abs ↗pdf ↗

Estimating the dependency of variables is a fundamental task in data analysis. Identifying the relevant attributes in databases leads to better data understanding and also improves the performance of learning algorithms, both in terms of runtime and quality. In data streams, dependency monitoring provides key insights …

2018-10-04abs ↗pdf ↗

Normal distributions ensure asymptotic variance reduction in moment matching Monte Carlo.

problem Asymptotic variance reduction in general integration problems.
method Characterization of conditions for asymptotic variance reduction using normal distributions.
result Asymptotic variance reduction is guaranteed for normal distributions in moment matching Monte Carlo.

Proposes a method to reduce parallel complexity of MLMC in SGD.

problem Poor scalability of MLMC in SGD on parallel platforms.
method Proposes a delayed MLMC gradient estimator to reduce parallel complexity.
result Proves reduction in average parallel complexity per iteration at the cost of slightly worse convergence rate.

Two new estimators reduce costs and improve accuracy for EHR outcome prediction.

problem Sparse estimate distributions, high computational cost, and high sampling variance in EHR outcome prediction.
method Proposed SCOPE and REACH estimators that leverage next-token probability distributions.
result SCOPE and REACH match Monte Carlo accuracy with token reductions of 2.5-3.4 times and variance guarantees.

A new method samples from a target density without initial samples using Monte Carlo estimation of the score.

problem Sampling from a target density without initial samples.
method Monte Carlo estimation of the score using oracle access to the log likelihood.
result Samples can be produced from the target density without needing initial samples.

New method combines neural networks with Monte Carlo for complex system reliability.

problem Estimating small failure probabilities in complex systems.
method Subset Simulation with Hamiltonian Neural Networks.
result High acceptance rates and computational efficiency in low-probability regions.

This paper is a broad and accessible survey of the methods we have at our disposal for Monte Carlo gradient estimation in machine learning and across the statistical sciences: the problem of computing the gradient of an expectation of a function with respect to parameters defining the distribution that is integrated; t…

2019-06-25abs ↗pdf ↗

Study introduces a variational approach for efficient KL divergence estimation in Dirichlet mixture models.

problem Efficient estimation of KL divergence in Dirichlet mixture models.
method Variational approach for a closed-form solution.
result Superior efficiency and accuracy compared to Monte Carlo methods.