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

137274411548 · Jun 202019922001200920172026
48 results for Predictive Monte Carlo

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.

The paper predicts cryptocurrency prices using a path-dependent Monte Carlo simulation.

problem Forecasting cryptocurrency prices with volatility and jumps.
method Merton's jump diffusion model with machine learning, traditional, and statistical methods.
result Introduced a path-dependent Monte Carlo simulation for cryptocurrency price prediction.

The paper integrates multiple Gaussian process predictions using Monte Carlo sampling.

problem Accurate prediction of variables using multiple models.
method Log-linear pooling of Gaussian process predictions, combined with Monte Carlo sampling.
result The log-linear pooling method improves prediction accuracy compared to linear pooling.

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.

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

PEMC uses ML to enhance Monte Carlo simulations, reducing variance and runtime.

problem Computational inefficiency in Monte Carlo simulations for complex tasks.
method Prediction-Enhanced Monte Carlo (PEMC) framework that uses ML surrogates as predictors.
result PEMC provides unbiased evaluations with reduced variance and runtime compared to standard Monte Carlo.

Paper improves Monte Carlo sampling with new theoretical insights and methods.

problem Improving Monte Carlo sampling for variance reduction.
method Theoretical analysis of negatively dependent random variables and novel extensions using number theory and particle algorithms.
result Near-Orthogonal Monte Carlo (NOMC) consistently outperforms Orthogonal Monte Carlo (OMC) in various applications.

Paper analyzes Gibbs and Langevin Monte Carlo for interpolation regime, showing generalization from low errors.

problem Analyzing Gibbs and Langevin Monte Carlo in overparameterized interpolation regime.
method Data-dependent bounds and stability under approximation with Langevin Monte Carlo.
result Generalization is signaled by small training errors in noisy regime, with bounds stable under approximation.

GO-OED maximizes predictive information gain on nonlinear QoIs.

problem Maximizing information gain on nonlinear predictive quantities.
method Nested Monte Carlo estimator, Markov chain Monte Carlo, kernel density estimation, Bayesian optimization.
result GO-OED outperforms conventional OED in nonlinear settings.

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.

New model predicts radiative properties of nanoparticle layers with high accuracy and uncertainty.

problem Predicting radiative properties of nanoparticle embedded layers accurately and with uncertainty.
method Conditional normalizing flows learn conditional distributions of optical outputs given input parameters.
result The model achieves high predictive accuracy and reliable uncertainty estimates.

New method reduces uncertainty in AI-driven Monte Carlo simulations.

problem Epistemic uncertainty in AI surrogate models affects Monte Carlo sampling outcomes.
method Penalty Ensemble Method (PEM) modifies Metropolis acceptance rule to increase rejection probability in uncertain regions.
result PEM enhances reliability of Monte Carlo simulations by reducing uncertainty propagation.

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.

Two new methods generate probabilistic forecasts of individual treatment effects.

problem Generating probabilistic forecasts of individual treatment effects for risk-aware decision-making.
method Proposes CCT and CMC meta-learners combining conformal predictive systems with analytic convolution or Monte Carlo sampling.
result Achieve probabilistically calibrated predictive distributions and performant continuous ranked probability scores.

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 ↗

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.

MC-CP combines adaptive MC dropout with conformal prediction for robust uncertainty quantification.

problem Deploying deep learning models in safety-critical applications requires reliable confidence estimates.
method MC-CP integrates adaptive Monte Carlo dropout with conformal prediction to improve model performance.
result MC-CP significantly outperforms state-of-the-art UQ methods in both classification and regression tasks.

Posterior refinement improves sample efficiency in Bayesian neural networks.

problem Bayesian neural networks suffer from poor predictive performance due to inaccurate posterior approximations.
method Propose refining Gaussian approximate posteriors with normalizing flows to improve predictive distributions.
result Posterior refinement yields competitive predictive performance with minimal computational overhead.

Bayesian neural networks predict stress fields and uncertainty in materials.

problem Uncertainty in stress field predictions for complex materials.
method Modified Bayesian U-net architecture with three inference algorithms.
result High accuracy predictions and interpretable uncertainty estimates.

New SMC method for pBNNs improves scalability and predictive performance.

problem Training pBNNs with high-dimensional stochastic parameters.
method Gradient-based proposals within SMC samplers.
result New method outperforms state-of-the-art in predictive performance and training time.

Enhances uncertainty estimation in medical image segmentation.

problem Frequency-related noise in medical imaging leads to biased uncertainty estimates.
method Extends MC-Dropout to the frequency domain for better uncertainty estimation.
result MC-Frequency Dropout improves calibration and uncertainty in semantic segmentation.

This paper improves Bayesian decision tree learning using HMC.

problem Bayesian decision tree learning is challenging due to a large parameter space.
method Develops and compares HMC-based algorithms for exploring Bayesian decision tree posteriors.
result HMC-based methods outperform existing methods in predictive accuracy and tree complexity.

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.

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.

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.

This paper solves the open problem of computing Bayes optimal prediction for decision trees using a Markov chain Monte Carlo method.

problem Computing the Bayes optimal prediction for decision trees is infeasible due to an infeasible summation over all division patterns of a feature space.
method Solved the open problem using a Markov chain Monte Carlo method with adaptively tuned step size.
result Computed the Bayes optimal prediction for decision trees using a Markov chain Monte Carlo method.

Paper quantifies uncertainty in probabilistic models using Gaussian Processes.

problem Assessing reliability of probabilistic machine learning predictions.
method Systematic framework for estimating epistemic and aleatoric uncertainty, using Gaussian Processes and Monte Carlo sampling.
result Effective approach for quantifying prediction confidence in probabilistic models.

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.

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 ↗