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,695 papers · 148 categories

Trend · papers per month

61122183244 · Jun 202019922001200920172026
48 results for Monte Carlo validation

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.

Developed scalable Monte Carlo method for VIX option pricing.

problem VIX option pricing in stochastic Volterra rough volatility models with non-Markovian vol-of-vol.
method Infinite dimensional Markovian representation to devise scalable least squares Monte Carlo.
result Efficient VIX option pricing method for generalized models.

Improved sampling for high-dimensional posteriors with underdamped Langevin.

problem Scalability issues in high-dimensional problems with approximate Thompson sampling.
method Underdamped Langevin Monte Carlo for accelerated posterior concentration.
result Logarithmic regret improvement from ildeO(d)\mathcal{ ilde O}(d) to ildeO(d)\mathcal{ ilde O}(\sqrt{d}).

Develops a neural surrogate for proton dose calculation using Monte Carlo dropout uncertainty.

problem Computational demand in proton therapy workflows requiring repeated evaluations.
method Integrates Monte Carlo dropout into a neural network surrogate for fast, differentiable dose predictions and uncertainty quantification.
result Shows significant speedups over MC while retaining uncertainty information.

New method controls bias in unadjusted Hamiltonian Monte Carlo and underdamped Langevin.

problem Bias in unadjusted Hamiltonian Monte Carlo and underdamped Langevin samplers.
method Delocalization of bias technique applied to these samplers.
result Control W2W_2 bias with O(K)O(\sqrt{K}) integration steps for high-dimensional distributions.

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 ↗

This paper develops a new framework to assess crypto portfolio risk using simulation methods.

problem Traditional financial risk models fail to capture crypto market characteristics like volatility and contagion.
method The framework integrates four components: volatility stress testing, hedging, contagion modeling, and Monte Carlo simulation.
result The framework robustly assesses crypto portfolio risk and is validated with real data.

The Heston model is validated for option pricing using theoretical derivations and empirical market data.

problem Validating the Heston model for accurate option pricing.
method Theoretical derivations and empirical validations using Monte Carlo simulations and machine learning.
result The Heston model is robust and relevant for current financial markets.

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.

Analyzes unsupervised neural networks using statistical mechanics and Monte Carlo simulations.

problem Understanding computational capabilities of unsupervised neural networks.
method Statistical mechanics approach and Monte Carlo simulations.
result Obtained a phase diagram summarizing network performance.

Bayesian max-margin models have shown superiority in various practical applications, such as text categorization, collaborative prediction, social network link prediction and crowdsourcing, and they conjoin the flexibility of Bayesian modeling and predictive strengths of max-margin learning. However, Monte Carlo sampli…

2015-04-27abs ↗pdf ↗

An important application of intelligent vehicles is advance detection of dangerous events such as collisions. This problem is framed as a problem of optimal alarm choice given predictive models for vehicle location and motion. Techniques for real-time collision detection are surveyed and grouped into three classes: ran…

2017-08-16abs ↗pdf ↗

MCCE generates realistic counterfactual explanations for tabular data.

problem Creating valid and actionable counterfactual explanations for complex tabular data.
method MCCE models the joint distribution of features and decision using an autoregressive generative model with decision trees. It samples counterfactuals and removes invalid ones.
result MCCE outperforms state-of-the-art methods on various performance metrics and is faster.

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 ↗

SLMC improves sampling efficiency for high-dimensional distributions.

problem Sampling from high-dimensional distributions is computationally challenging.
method SLMC projects Langevin updates onto subsampled eigenblocks of a time-varying preconditioner.
result SLMC offers superior adaptability and computational efficiency compared to traditional methods.

A new explicit scheme calculates XVA adjustments using neural networks and conditional expectations.

problem Calculating cross valuation adjustments (XVA) in realistic financial scenarios.
method Simulation/regression scheme for BSDEs, using neural networks and quantile regressions.
result The scheme outperforms Picard iterations in high-dimensional and hybrid market risks.

This study compares MC and QMC methods for derivative pricing, showing QMC's superior convergence rates.

problem Improving derivative pricing accuracy and efficiency in high-dimensional settings.
method Compared Monte Carlo and quasi-Monte Carlo techniques, focusing on convergence rates and low-discrepancy sequences.
result Quasi-Monte Carlo methods achieve superior convergence rates and reduce root mean square error in derivative pricing.

We unify slice sampling and Hamiltonian Monte Carlo (HMC) sampling, demonstrating their connection via the Hamiltonian-Jacobi equation from Hamiltonian mechanics. This insight enables extension of HMC and slice sampling to a broader family of samplers, called Monomial Gamma Samplers (MGS). We provide a theoretical anal…

2016-02-25abs ↗pdf ↗

New methods improve efficiency of sampling algorithms for complex systems.

problem Efficiently sampling from complex, high-dimensional probability distributions.
method Randomized Runge-Kutta-Nyström methods tailored for Hamiltonian flows.
result Quantitative 5/25/2-order L2L^2-accuracy in approximating Hamiltonian flows.

ParaMonte::Python streamlines Bayesian data analysis with fast Monte Carlo and MCMC routines.

problem Efficiently sampling posterior distributions in Bayesian modeling and data science.
method Serial and MPI-parallelized Markov Chain Monte Carlo (MCMC) routines.
result Automated model calibration and uncertainty quantification in Bayesian analysis.

Paper introduces MCSD, a method for uncertainty estimation in deep learning.

problem Need for reliable uncertainty quantification in deep neural networks.
method Theoretical connection to variational inference and empirical benchmarking of MCSD.
result MCSD achieves competitive predictive accuracy and improves uncertainty ranking.

In this paper, we discuss the application of quasi-Monte Carlo methods to the Heston model. We base our algorithms on the Broadie-Kaya algorithm, an exact simulation scheme for the Heston model. As the joint transition densities are not available in closed-form, the Linear Transformation method due to Imai and Tan, a p…

2012-02-15abs ↗pdf ↗

Improves accuracy of SMCI estimators without expanding sum regions.

problem Intractable multiple summations in evaluating expectations on the Ising model.
method Combining multiple SMCI estimators using generalized least squares (GLS).
result The proposed method can improve accuracy without combinatorial explosion.

This paper extends AD techniques to Monte Carlo processes for efficient derivative calculation.

problem Obtaining derivatives of expectation values in Monte Carlo processes.
method Two approaches: reweighting and Hamiltonian extension of HMC.
result Hamiltonian approach as a change of variables simplifies variance reduction.

New method combines Monte Carlo and tensor networks for solving complex equations.

problem Solving high-dimensional partial differential equations efficiently.
method Uses Monte Carlo simulations and tensor train sketching for updates and re-estimations.
result Demonstrates versatility and efficacy in solving specific equations.