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

70141211281 · May 202619922001200920172026
48 results for exact simulation

This paper develops the first method for the exact simulation of reflected Brownian motion (RBM) with non-stationary drift and infinitesimal variance. The running time of generating exact samples of non-stationary RBM at any time tt is uniformly bounded by O(1/γˉ2)\mathcal{O}(1/\barγ^2) where γˉ\barγ is the average drift of…

2013-12-23abs ↗pdf ↗

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.

Exact path simulation of the underlying state variable is of great practical importance in simulating prices of financial derivatives or their sensitivities when there are no analytical solutions for their pricing formulas. However, in general, the complex dependence structure inherent in most nontrivial stochastic vol…

2013-10-24abs ↗pdf ↗

Exact simulation method for market impact estimation under various execution strategies.

problem Estimating market impact from observed price trajectories under different execution strategies.
method Conditional simulation of point processes under perturbed intensities.
result Exact, event-driven algorithm for reconstructing counterfactual paths.

This paper discusses the exact simulation of the stock price process underlying the 3/2 model. Using a result derived by Craddock and Lennox using Lie Symmetry Analysis, we adapt the Broadie-Kaya algorithm for the simulation of affine processes to the 3/2 model. We also discuss variance reduction techniques and find th…

2011-05-17abs ↗pdf ↗

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.

Exact selective inference with randomization for Gaussian regression models.

problem Exact selective inference in Gaussian regression models.
method Introduces a pivot for exact selective inference with randomization, reducing the problem to a bivariate truncated Gaussian distribution.
result Our pivot leads to exact inference and produces narrower confidence intervals than related methods.

In this paper we outline methodology to efficiently simulate (jump) diffusion bridge sample paths without discretisation error. We achieve this by considering the simulation of conditioned (jump) diffusion bridge sample paths in light of recent work developing a mathematical framework for simulating finite dimensional …

2015-05-12abs ↗pdf ↗

Study simulates Variance Gamma processes for energy derivatives pricing.

problem Simulating Variance Gamma processes for accurate energy derivative pricing.
method Three-step procedure to relate self-decomposability to increments, derived from Qu et al. (2019). Exact simulation of skeleton of Variance Gamma and symmetric Variance Gamma driven Ornstein-Uhlenbeck processes.
result Exact simulation of Variance Gamma and related processes without numerical inversion.

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.

Exact simulation of correlated binary outcomes using PMF constraints and linear programming.

problem Simulating dependent Bernoulli outcomes with specific means and correlations.
method Formulate the problem over the joint Bernoulli PMF, impose constraints, and solve as a linear program. Use convex-hull characterization and truncated-moment completion scheme for feasibility and simulation.
result Exact simulation framework for correlated binary outcomes, providing a convex-hull characterization and truncated-moment completion scheme.

This study assesses risk concentration in MDB portfolios using Monte Carlo simulations.

problem Risk concentration in MDB portfolios of a few borrowers.
method Realistic MDB portfolio simulations and Monte Carlo analysis.
result Current risk adjustments may be overly conservative.

This paper presents by simulation how approximate multipliers can be utilized to enhance the training performance of convolutional neural networks (CNNs). Approximate multipliers have significantly better performance in terms of speed, power, and area compared to exact multipliers. However, approximate multipliers have…

2019-12-26abs ↗pdf ↗

SparseProp speeds up SNN simulations and training by four orders of magnitude.

problem Efficiently simulating and training large spiking neural networks.
method Event-based algorithm that reduces computational cost from O(N) to O(log(N)) per spike.
result Numerically exact simulations of large spiking networks and efficient training using backpropagation.

In this paper, we extend the ββ-CNMF to two dimensions and derive exact multiplicative updates for its factors. The new updates generalize and correct the nonnegative matrix factor deconvolution previously proposed by Schmidt and Mørup. We show by simulation that the updates lead to a monotonically decreasing ββ-dive…

2018-11-05abs ↗pdf ↗

Exact partitioning of high-order planted models achieved through convex optimization.

problem Efficiently partitioning hypergraphs generated by high-order planted models.
method Solving a computationally efficient convex optimization problem with a tensor nuclear norm constraint.
result Exact recovery of true underlying cluster structures with high probability.

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 ↗

In this correspondence, we obtain exact recovery conditions for regularized modified basis pursuit (reg-mod-BP) and discuss when the obtained conditions are weaker than those for modified-CS or for basis pursuit (BP). The discussion is also supported by simulation comparisons. Reg-mod-BP provides a solution to the spar…

2011-08-16abs ↗pdf ↗

The paper analyzes a five-factor capital market model and facilitates exact simulation.

problem Analyzing and simulating a five-factor capital market model.
method Using a Vasicek interest rate model, mean-reverting excess return, and realized inflation with expectation, the paper derives the necessary distributional results and describes practical methods to overcome rank deficiency.
result Exact simulation from the model can be achieved by sampling from a seven-dimensional normal distribution.

This paper considers the problem of estimating the structure of multiple related directed acyclic graph (DAG) models. Building on recent developments in exact estimation of DAGs using integer linear programming (ILP), we present an ILP approach for joint estimation over multiple DAGs, that does not require that the ver…

2014-04-04abs ↗pdf ↗

This paper improves parameter estimation in cardiac models using Gaussian process-based MH sampling.

problem Uncertainty in estimating patient-specific model parameters from sparse and noisy clinical data.
method Integrates surrogate modeling into Metropolis-Hastings sampling to improve computational efficiency and accuracy.
result Significant gain in computational efficiency without compromising accuracy, and insights into tissue heterogeneity.

The exact nonnegative matrix factorization (exact NMF) problem is the following: given an mm-by-nn nonnegative matrix XX and a factorization rank rr, find, if possible, an mm-by-rr nonnegative matrix WW and an rr-by-nn nonnegative matrix HH such that X=WHX = WH. In this paper, we propose two heuristics for exac…

2014-11-26abs ↗pdf ↗

We consider the exact path sampling of the squared Bessel process and some other continuous-time Markov processes, such as the CIR model, constant elasticity of variance diffusion model, and hypergeometric diffusions, which can all be obtained from a squared Bessel process by using a change of variable, time and scale …

2009-10-21abs ↗pdf ↗

Study on gamma-related OU processes with simulation methods.

problem Distributional properties and simulation of gamma-related OU processes.
method Investigation of gamma and bilateral gamma laws, derivation of closed-form densities and characteristic functions, and development of efficient simulation algorithms.
result Efficient algorithms for generating gamma-related OU processes with significantly faster performance than existing methods.

Paper introduces a diagnostic for approximate inference methods.

problem Estimating errors in probabilistic inference algorithms, especially for approximate methods.
method Repeatedly simulate datasets from the prior and perform inference on each, estimating a symmetric KL-divergence.
result A diagnostic for approximate inference methods can be estimated using symmetric KL-divergence.

In the present paper, an expansion of the transition density of Hyperbolic Brownian motion with drift is given, which is potentially useful for pricing and hedging of options under stochastic volatility models. We work on a condition on the drift which dramatically simplifies the proof.

2017-05-02abs ↗pdf ↗

Locally-verifiable conditions ensure exactness of spline discrete de Rham complex.

problem Ensuring cohomological equivalence of spline discrete complex to continuous de Rham complex.
method Theoretical analysis and locally-verifiable sufficient conditions for exactness.
result Locally-verifiable conditions guarantee exactness of hierarchical B-spline discrete de Rham complex.

Develops efficient methods for approximating densities of financial models with jumps.

problem Approximating densities of affine jump diffusions with state-independent jump intensities.
method Recursive approach for deriving closed-form solutions to moments, constructing density approximations via moment matching.
result Superior computational efficiency and precision in option pricing and simulation compared to existing techniques.

We present a Bayesian model selection approach to estimate the intrinsic dimensionality of a high-dimensional dataset. To this end, we introduce a novel formulation of the probabilisitic principal component analysis model based on a normal-gamma prior distribution. In this context, we exhibit a closed-form expression o…

2017-03-08abs ↗pdf ↗

This study improves audit sampling by using sequential procedures with statistical guarantees.

problem Improving audit efficiency and reliability with statistical methods.
method Formulated as a sequential testing problem, defining null and alternative hypotheses, stopping and decision rules, and exact boundary conditions.
result Exact design yields ex ante control of decision error probabilities, and simulation-based implementation approximates this design.

This work improves neural likelihood surrogates for stochastic models with a score-augmented loss.

problem Efficient parameter inference for stochastic models with computationally expensive likelihood functions.
method Score-augmented loss function for neural network likelihood surrogates.
result Improves surrogate quality at a lower computational cost compared to generating more data.

Machine learning boosts RCT efficiency by controlling type I error and improving statistical power.

problem Improving statistical efficiency in RCTs with complex covariate adjustments.
method Machine learning-assisted adjustment under Rosenbaum's framework for exact tests.
result The proposed method robustly controls type I error and significantly boosts statistical efficiency.

Decentralized Gaussian processes for multi-agent systems.

problem Scalable and flexible learning solutions for multi-agent systems.
method Asymptotically exact decentralized solution to Gaussian processes, with online Bayesian model averaging for hyperparameter selection.
result Asymptotically exact decentralized Gaussian process approximation and online Bayesian model averaging.

Models for which the likelihood function can be evaluated only up to a parameter-dependent unknown normalising constant, such as Markov random field models, are used widely in computer science, statistical physics, spatial statistics, and network analysis. However, Bayesian analysis of these models using standard Monte…

2015-04-01abs ↗pdf ↗