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

23456890 · Jun 202019922001200920172026
48 results for Hybrid Monte Carlo

The hybrid Monte Carlo (HMC) algorithm is used for Bayesian analysis of the generalized autoregressive conditional heteroscedasticity (GARCH) model. The HMC algorithm is one of Markov chain Monte Carlo (MCMC) algorithms and it updates all parameters at once. We demonstrate that how the HMC reproduces the GARCH paramete…

2007-02-27abs ↗pdf ↗

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.

We apply the hybrid Monte Carlo (HMC) algorithm to the financial time sires analysis of the stochastic volatility (SV) model for the first time. The HMC algorithm is used for the Markov chain Monte Carlo (MCMC) update of volatility variables of the SV model in the Bayesian inference. We compute parameters of the SV mod…

2008-07-28abs ↗pdf ↗

Efficient hybrid method for pricing barrier options with stochastic volatility.

problem Valuation of barrier options on assets with stochastic volatility.
method Combining Monte Carlo simulation and semi-analytical heat potential method.
result Our method provides better accuracy and is orders of magnitude faster than existing methods.

A hybrid model for Bayesian optimization handles mixed variables using MCTS for categorical and GP for continuous.

problem Optimizing functions with mixed variable types (continuous, integer, categorical).
method Merges MCTS for categorical and GP for continuous variables, integrates UCTS search strategy, and dynamically selects kernels.
result Hybrid models outperform traditional methods in Bayesian optimization.

The hybrid Monte Carlo (HMC) algorithm is applied for the Bayesian inference of the stochastic volatility (SV) model. We use the HMC algorithm for the Markov chain Monte Carlo updates of volatility variables of the SV model. First we compute parameters of the SV model by using the artificial financial data and compare …

2009-12-30abs ↗pdf ↗

We present a new method for conducting Monte Carlo inference in graphical models which combines explicit search with generalized importance sampling. The idea is to reduce the variance of importance sampling by searching for significant points in the target distribution. We prove that it is possible to introduce search…

2013-01-16abs ↗pdf ↗

We study the use of the multilevel Monte Carlo technique in the context of the calculation of Greeks. The pathwise sensitivity analysis differentiates the path evolution and reduces the payoff's smoothness. This leads to new challenges: the inapplicability of pathwise sensitivities to non-Lipschitz payoffs often makes …

2011-02-07abs ↗pdf ↗

This paper reviews various sampling methods from statistics and machine learning.

problem Addressing sampling methods in statistics and machine learning.
method Explains and reviews simple random sampling, bootstrapping, stratified sampling, cluster sampling, multistage sampling, network sampling, snowball sampling, and sampling from cumulative distribution function.
result Summarizes characteristics, pros, and cons of different sampling methods.

A hybrid framework prices options using neural networks and VAE latent space.

problem Lack of explicit asset dynamics information in compressed volatility surfaces.
method Combining Weighted Monte Carlo with neural networks trained on VAE latent space.
result Effective pricing of vanilla and exotic options on idealized vol surface.

We explore a general framework in Markov chain Monte Carlo (MCMC) sampling where sequential proposals are tried as a candidate for the next state of the Markov chain. This sequential-proposal framework can be applied to various existing MCMC methods, including Metropolis-Hastings algorithms using random proposals and m…

2019-07-15abs ↗pdf ↗

Hybrid model for multimodal distributions using diffusion and classification.

problem Sampling from multimodal distributions with correct proportions.
method Divide-and-conquer strategy: identify modes, train classifiers, diffusion models, bridge sampling.
result Framework effectively handles multimodal distributions in high dimensions.

This paper modifies the Ait-Sahalia model to better describe interest rate behaviors.

problem Inadequate specifications of the original Ait-Sahalia model to explain various interest rate phenomena.
method Proposes a modified hybrid Poisson-jump Ait-Sahalia model and uses truncated EM techniques for numerical approximation.
result Validates the modified model using Monte Carlo simulations for bond and barrier option payoffs.

The AutoML task consists of selecting the proper algorithm in a machine learning portfolio, and its hyperparameter values, in order to deliver the best performance on the dataset at hand. Mosaic, a Monte-Carlo tree search (MCTS) based approach, is presented to handle the AutoML hybrid structural and parametric expensiv…

2019-06-01abs ↗pdf ↗

Paper derives analytical formulas for NLD-CEV moments with regime switching.

problem Analytical tractability of NLD-CEV models under stochastic regimes.
method Hybrid system approach using Feynman-Kac formula for solving interconnected PDEs.
result Exact closed-form expressions for fractional-order conditional moments.

Proposes EDESH-SA for better inventory management under uncertainty.

problem Inventory management under uncertainty.
method Ensemble Differential Evolution with simulation-based hybridization and self-adaptation.
result Improves financial performance and optimizes search spaces.

The non-Markovian nature of rough volatility processes makes Monte Carlo methods challenging and it is in fact a major challenge to develop fast and accurate simulation algorithms. We provide an efficient one for stochastic Volterra processes, based on an extension of Donsker's approximation of Brownian motion to the f…

2017-11-08abs ↗pdf ↗

Review of MLMC in financial engineering, focusing on option pricing and risk management.

problem Efficient estimation of financial risks and option prices using Monte Carlo methods.
method Incorporation of importance sampling and adaptive sampling algorithms in MLMC framework.
result Hybrid algorithms reduce overall variance in estimating financial risks and option prices.

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.

Framework for sensitivity analysis in biomanufacturing processes.

problem High complexity and uncertainty in biomanufacturing processes.
method Shapley value estimation for linear and nonlinear pKG models, using quasi-Monte Carlo and antithetic sampling.
result Improved efficiency and accuracy in sensitivity analysis for biomanufacturing processes.

We simplify a complex volatility model to make it easier to price options.

problem The rough Bergomi model's non-Markovian nature complicates option pricing.
method We approximate the rBergomi model with a Bergomi model that is Markovian.
result The rBergomi model can be effectively approximated by a Markovian model.

Optimized GPRNN reduces model complexity and overfitting, improving performance.

problem Overfitting in neural networks and high model complexity.
method Gaussian Process Regression - Neural Network hybrid with optimized redundant coordinates.
result Optimized GPRNN achieves lower test set error with fewer terms/neurons.

Indian Buffet Process based models are an elegant way for discovering underlying features within a data set, but inference in such models can be slow. Inferring underlying features using Markov chain Monte Carlo either relies on an uncollapsed representation, which leads to poor mixing, or on a collapsed representation…

2017-03-09abs ↗pdf ↗

VBS improves sampling efficiency in cosmological data analysis.

problem High dimensionality of cosmological parameter space makes sampling computationally challenging.
method Developed a hybrid scheme combining variational self-boosted sampling with Hamiltonian Monte Carlo.
result VBS generates better quality samples and reduces auto-correlation length by a factor of 10-50.

We develop a mixed least squares Monte Carlo-partial differential equation (LSMC-PDE) method for pricing Bermudan style options on assets whose volatility is stochastic. The algorithm is formulated for an arbitrary number of assets and volatility processes and we prove the algorithm converges almost surely for a class …

2018-03-20abs ↗pdf ↗

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 paper improves simulation methods for rough Volterra stochastic volatility models.

problem Inefficient techniques in Monte-Carlo simulations for rough Volterra volatility models.
method Comparison and modification of three simulation methods: Cholesky, Hybrid, and rDonsker schemes.
result Suggests modifications to improve simulation accuracy and efficiency.

New AD methods improve likelihood estimation for partially observed systems.

problem Estimating likelihood functions for partially observed nonlinear systems.
method Embedding AD particle filter methods in a theoretical framework, developing new algorithms for likelihood maximization.
result Mean squared error significantly lower than existing algorithms.

Hybrid approach combines VI and HMC for efficient Bayesian inference in neural networks.

problem Computational demands and inaccuracies in Bayesian inference for neural networks.
method Combines VI and HMC, reducing parameter space and accelerating inference.
result Significantly reduces inference time for large neural networks, improving uncertainty quantification.

In this paper we propose new algorithm to reduce autocorrelation in Markov chain Monte-Carlo algorithms for euclidean field theories on the lattice. Our proposing algorithm is the Hybrid Monte-Carlo algorithm (HMC) with restricted Boltzmann machine. We examine the validity of the algorithm by employing the phi-fourth t…

2017-12-11abs ↗pdf ↗