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

74147221294 · Jun 202019922001200920172026
48 results for simulation schemes

AES scheme improves Bermudan and American option pricing for Heston models.

problem Pricing Bermudan and American options under Heston models efficiently.
method AES scheme using non-central chi-square distribution for variance process.
result AES achieves higher accuracy and computational efficiency for Bermudan options.

New simulation method simplifies Heston model with Poisson conditioning for better accuracy and efficiency.

problem Computational expense in exact simulation schemes for Heston model.
method Proposes a new exact simulation scheme without modified Bessel function evaluations, leveraging conditional integrated variance simplification.
result Good performance in terms of accuracy, efficiency, and reliability compared to existing methods.

Efficient simulation scheme for rough Heston model reduces computational cost.

problem Accurate and efficient simulation of the rough Heston model for option pricing.
method Weak simulation scheme based on Markovian approximations of the rough Heston process.
result The new scheme exhibits second order weak convergence with linear computational cost.

Efficiently simulates the Heston model with large time steps using a novel method.

problem Challenges in simulating the Heston model with large time steps.
method Implicit integrated variance scheme exploiting the near-linear nature between stochastic driver and conditional integrated variance process.
result Achieves near-exact accuracy with coarse discretizations, efficient for large time steps.

GPU speeds up Monte Carlo simulations for large time steps.

problem Slow convergence and inaccurate solutions with large time steps in Monte Carlo simulations.
method Generalizes the Seven League scheme for GPU acceleration.
result Significantly improved computational speed.

Efficiently simulates SABR model with novel sampling methods.

problem Sampling integrated variance and terminal forward price in SABR model.
method Moment-matched shifted lognormal approximation for integrated variance, CEV approximation for terminal forward price.
result Enhanced simulation scheme is highly efficient, accurate, and reliable.

Develops a new bivariate process for energy markets with improved simulation methods.

problem Modelling energy markets with stochastic delays and efficient simulations.
method Introduces a novel bivariate Normal Inverse Gaussian process and a path simulation scheme.
result Improves simulation efficiency for energy market models.

A new fast method simulates stochastic volatility models.

problem Simulating stochastic volatility models efficiently.
method Karhunen-Loève expansions to express stochastic volatility as sine series, followed by analytical derivation of integrals.
result Simulation is several hundred times faster than existing methods.

A new method simulates square-root processes efficiently.

problem Simulating square-root processes accurately and efficiently.
method Simulate the integrated square-root process instead of the square-root process itself.
result High precision with low number of time steps, and exact limiting Inverse Gaussian distributions.

This paper proposes a new method to learn integration schemes for complex ODEs.

problem Learning efficient integration schemes for non-linear ODEs and their identification.
method A novel framework to learn integration schemes that minimize an integration-related cost function.
result The proposed learning-based approach provides integration schemes close to analytical solutions.

A new simulation method for Volterra processes improves convergence for rough kernels.

problem Simulating Volterra processes with singular kernels.
method iVi (integrated Volterra implicit) scheme based on Inverse Gaussian distribution.
result The iVi scheme achieves weak convergence with few time steps, especially for rough kernels.

Agent-based simulation assesses tradable credit schemes for congestion reduction.

problem Simplistic modeling of TCS impacts in transportation research.
method Agent- and activity-based simulation framework within SimMobility.
result TCS stabilizes network and market performance over time, reducing congestion.

Deep learning accelerates Monte Carlo SDE simulations with large time steps.

problem Accurate simulation of SDEs with large time steps.
method Polynomial chaos expansion with neural network learned stochastic collocation points.
result Data-driven scheme achieves strong convergence in Monte Carlo simulations.

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.

In this paper, we propose an acceleration scheme for online memory-limited PCA methods. Our scheme converges to the first k>1k>1 eigenvectors in a single data pass. We provide empirical convergence results of our scheme based on the spiked covariance model. Our scheme does not require any predefined parameters such as t…

2018-07-17abs ↗pdf ↗

The paper develops a new simulation technique for estimating conditional expectations in financial models.

problem Estimating conditional expectations in financial models with expensive simulation of endogenous variables.
method Introduces a hierarchical simulation scheme with oversimplified defaults to address variance issues.
result The hierarchical simulation technique significantly improves the success of neural net regression for conditional expectation estimation.

New method transforms complex stochastic equations into simpler ones for efficient simulation.

problem Efficient simulation of complex path-dependent stochastic processes.
method Transforms Volterra-type SDEs into standard diffusion processes using convolution kernels.
result Proposes a numerical simulation scheme with a strong convergence rate of 1/2.

The latent Dirichlet allocation (LDA) model is a widely-used latent variable model in machine learning for text analysis. Inference for this model typically involves a single-site collapsed Gibbs sampling step for latent variables associated with observations. The efficiency of the sampling is critical to the success o…

2016-08-02abs ↗pdf ↗

Improved inference efficiency for complex simulations.

problem Challenges in performing inference under resource-intensive stochastic simulators.
method Active sequential neural posterior estimation (ASNPE) integrating active learning into posterior estimation.
result Improved sample efficiency with low computational overhead.

Study simulates Heston-type local stochastic volatility model using particle method.

problem Simulate calibrated Heston-type local stochastic volatility model with non-standard coefficients.
method Monte Carlo particle method, Euler-Maruyama scheme, full truncation Euler scheme.
result Strong convergence of Euler-Maruyama scheme with rate 1/2 in time, up to a logarithmic factor.

The paper models financial asset prices with jumps and evaluates European option prices using numerical methods.

problem Modeling and pricing European options with jumps in delayed stochastic systems.
method Existence, uniqueness, and positivity of solutions to delayed stochastic differential equations with jumps. Application of Fourier transformation for analytical pricing and Monte-Carlo simulation with a logarithmic Euler-Maruyama scheme for numerical approximation.
result The logarithmic Euler-Maruyama scheme provides a positive and convergent method for approximating the solution to the delayed stochastic differential equations with jumps.

Spiking neuronal networks are usually simulated with three main simulation schemes: the classical time-driven and event-driven schemes, and the more recent hybrid scheme. All three schemes evolve the state of a neuron through a series of checkpoints: equally spaced in the first scheme and determined neuron-wise by spik…

2017-06-18abs ↗pdf ↗

A Bayesian estimation of a GARCH model is performed for US Dollar/Japanese Yen exchange rate by the Metropolis-Hastings algorithm with a proposal density given by the adaptive construction scheme. In the adaptive construction scheme the proposal density is assumed to take a form of a multivariate Student's t-distributi…

2010-12-29abs ↗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.

We introduce Graphical TREX (GTREX), a novel method for graph estimation in high-dimensional Gaussian graphical models. By conducting neighborhood selection with TREX, GTREX avoids tuning parameters and is adaptive to the graph topology. We compare GTREX with standard methods on a new simulation set-up that is designed…

2014-10-27abs ↗pdf ↗

Develops numerical methods for pricing exchange options in a market with limited liquidity.

problem Pricing European style exchange options in a market with finite liquidity.
method Integrates price impact into the dynamics of correlated assets using a controlled variate approach.
result Numerical pricing methods for exchange options are developed and validated.

We introduce a simulation scheme for Brownian semistationary processes, which is based on discretizing the stochastic integral representation of the process in the time domain. We assume that the kernel function of the process is regularly varying at zero. The novel feature of the scheme is to approximate the kernel fu…

2015-07-10abs ↗pdf ↗

Monte Carlo simulations of diffusion processes often introduce bias in the final result, due to time discretization. Using an auxiliary Poisson process, it is possible to run simulations which are unbiased. In this article, we propose such a Monte Carlo scheme which converges to the exact value. We manage to keep the s…

2016-05-06abs ↗pdf ↗

New method simulates sticky boundaries in multidimensional diffusions.

problem Simulating sticky boundaries in multidimensional diffusions.
method Approximate sticky diffusion by a Markov chain, using either finite difference or matching local moments.
result Validates both construction methods for first-order simulation schemes.

Distributed-OMP recovers sparse vectors with low communication costs.

problem High-dimensional sparse linear regression with limited computation and communication.
method Distributed orthogonal matching pursuit (OMP) scheme.
result Support of the regression vector can be recovered with linear communication per machine and logarithmic in dimension.

Recent years have seen an increased level of interest in pricing equity options under a stochastic volatility model such as the Heston model. Often, simulating a Heston model is difficult, as a standard finite difference scheme may lead to significant bias in the simulation result. Reducing the bias to an acceptable le…

2011-11-25abs ↗pdf ↗