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

295886115 · Jun 202019922001200920172026
48 results for log-Euler scheme

Developed unbiased estimators for Heston model with stochastic interest rates.

problem Estimating the Heston model with stochastic interest rates.
method Combined unbiased estimators with the Heston model and developed a semi-exact log-Euler scheme.
result Convergence rate of O(h)O(h) in the L2L^2 norm for a wide range of models.

A new method for computing image curvature efficiently and accurately.

problem Low performance, low accuracy, and requirement of second order differentiability in conventional computation schemes.
method Proposes a novel discrete computation scheme for weighted Gaussian curvature.
result More accurate, computationally more efficient, and does not require second order differentiability.

Study evaluates UK CDC schemes, finding intergenerational cross-subsidies in flat-accrual schemes and dynamic-accrual schemes can reduce but not eliminate them.

problem Intergenerational cross-subsidies in UK CDC schemes, particularly in flat-accrual schemes.
method Comparison of flat-accrual and dynamic-accrual CDC schemes, analysis of performance and level of cross-subsidies.
result Dynamic-accrual schemes can reduce but not eliminate intergenerational cross-subsidies, while flat-accrual schemes often have significant cross-subsidies.

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.

Extends JKO scheme for iterative algorithms with unknown parameters.

problem Computational and statistical analysis of iterative algorithms with unknown parameters.
method Develops statistical methods to estimate unknown parameters and adapts JKO scheme.
result Establishes asymptotic theory for the statistical JKO scheme.

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.

Study finds risk management significantly improves pension scheme efficiency in Kenya.

problem Improving efficiency of pension schemes in Kenya.
method Panel data analysis of 128 pension schemes from 2015-2021.
result Risk management significantly mediates the relationship between corporate governance and pension scheme 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 ↗

In the present paper, we introduce a numerical scheme for the price of a barrier option when the price of the underlying follows a diffusion process. The numerical scheme is based on an extension of a static hedging formula of barrier options. For getting the static hedging formula, the underlying process needs to have…

2012-06-13abs ↗pdf ↗

The paper analyzes convergence of Riemannian SA schemes for stochastic optimization.

problem Stochastic optimization problems on Riemannian manifolds.
method Analyzes convergence of Riemannian stochastic approximation schemes using exponential map or retraction functions.
result Shows Riemannian SA schemes find an O(b+logn/n){\mathcal{O}}(b_\infty + \log n / \sqrt{n})-stationary point within O(n){\mathcal{O}}(n) iterations.

We introduce (binary) Darboux transformation for general differential equation of the second order in two independent variables. We present a discrete version of the transformation for a 6-point difference scheme. The scheme is appropriate to solving a hyperbolic type initial-boundary value problem. We discuss several …

2006-06-08abs ↗pdf ↗

We present a new high-order compact scheme for the multi-dimensional Black-Scholes model with application to European Put options on a basket of two underlying assets. The scheme is second-order accurate in time and fourth-order accurate in space. Numerical examples confirm that a standard second-order finite differenc…

2015-05-28abs ↗pdf ↗

A risk of small defined-benefit pension schemes is that there are too few members to eliminate idiosyncratic mortality risk, that is there are too few members to effectively pool mortality risk. This means that when there are few members in the scheme, there is an increased risk of the liability value deviating signifi…

2011-07-07abs ↗pdf ↗

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 ↗

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.

In this work, we explain the working mechanism of MixUp in terms of adversarial training. We introduce a new class of adversarial training schemes, which we refer to as directional adversarial training, or DAT. In a nutshell, a DAT scheme perturbs a training example in the direction of another example but keeps its ori…

2019-06-17abs ↗pdf ↗

We prove universality theorems ("Murphy's Laws") for representation schemes of fundamental groups of closed 3-dimensional manifolds. We show that germs of SL(2,C)-representation schemes of such groups are essentially the same as germs of schemes of over rational numbers.

2013-03-10abs ↗pdf ↗

New compression schemes save communication in distributed mean estimation.

problem Efficiently compressing vectors for mean estimation in a limited communication setting.
method Collaborative compression schemes that exploit vector similarities without requiring known correlations.
result Analysis shows varying error types with vector similarity.

A fast, accurate method for pricing American options with free boundaries.

problem Pricing American options with free boundaries efficiently and accurately.
method A sixth-order compact finite difference scheme with a dynamic staggered boundary scheme and 3(2) R-K Bogacki-Shampine time stepping.
result An efficient sixth-order compact scheme for pricing American options with free boundaries.