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,742 papers · 148 categories

Trend · papers per month

4183124165 · Jun 202019922001200920172026
48 results for variance calculation

This paper is concerned with the asymptotics for Greeks of European-style options and the risk-neutral density function calculated under the constant elasticity of variance model. Formulae obtained help financial engineers to construct a perfect hedge with known behaviour and to price any options on financial assets.

2017-06-24abs ↗pdf ↗

Existing feature selection methods fail to properly account for interactions between features when evaluating feature subsets. In this paper, we attempt to remedy this issue by using orthogonal variance decomposition to evaluate features. The orthogonality of the decomposition allows us to directly calculate the total …

2019-10-22abs ↗pdf ↗

Study improves variance calculation for random zero sets on complex manifolds.

problem Improving the variance calculation for random zero sets on complex manifolds.
method Deriving an asymptotic expansion for the variance of linear statistics of zero divisors of random holomorphic sections.
result Sharpens leading-order asymptotics for the variance of random zero sets.

Before training a neural net, a classic rule of thumb is to randomly initialize the weights so the variance of activations is preserved across layers. This is traditionally interpreted using the total variance due to randomness in both weights \emph{and} samples. Alternatively, one can interpret the rule of thumb as pr…

2019-02-13abs ↗pdf ↗

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.

The paper calculates sensitivities for financial derivatives using path weighting methods.

problem Computing sensitivities for path-dependent financial derivatives with high variance and degeneracy issues.
method Proposes explicit path weighting formula, variance reduction adjustment, and covariance inflation technique.
result Effective methods to address high variance and degeneracy in sensitivities computation.

New chaos formula simplifies variance calculation for Gaussian nodal volumes.

problem Analyzing the variance of Gaussian nodal volumes on Riemannian manifolds.
method Explicit Wiener-Itô chaos decomposition, reducing complexity from 2+2n2+2n to 4 Hermite polynomials.
result New exact formula for variance and bounds, valid for arbitrary manifolds.

In this paper, we argue that, once the costs of maintaining the hedging portfolio are properly taken into account, semi-static portfolios should more properly be thought of as separate classes of derivatives, with non-trivial, model-dependent payoff structures. We derive new integral representations for payoffs of exot…

2019-02-07abs ↗pdf ↗

The paper addresses portfolio allocation with uncertain covariance matrices, finding a logarithmic risk dependence.

problem Portfolio allocation with uncertain covariance matrices.
method Calculates the expected value of CARA utility function over a distribution of covariance matrices, considering uncertainty in future returns and covariances.
result Marginalization introduces a logarithmic dependence on risk, leading to lower allocation levels for higher uncertainties.

Develops a method for non-equilibrium importance sampling to estimate expectations and constants.

problem Estimating expectations and normalization constants for complex high-dimensional distributions.
method Generates samples from a base distribution, transports them using a velocity field, and averages along flowlines.
result The method can achieve zero-variance estimation and significantly reduces variance compared to vanilla estimators.

We show that the moments of the distribution of historic stock returns are in excellent agreement with the Heston model and not with the multiplicative model, which predicts power-law tails of volatility and stock returns. We also show that the mean realized variance of returns is a linear function of the number of day…

2017-11-29abs ↗pdf ↗

This note finds closed-form solutions for mean-risk portfolios using a specific type of mixture distribution.

problem Finding optimal portfolios under mean-risk criteria for general distributions.
method Using normal mean-variance mixture (NMVM) distributions, the paper derives closed-form expressions for mean-risk frontiers by optimizing a Markowitz model with adjusted return vectors.
result Closed-form solutions for mean-risk portfolios are found for return vectors following NMVM distributions.

The paper calculates Bachelier option prices using Taylor expansions and applies it as a variance reduction technique.

problem Calculating Bachelier option prices and variance reduction in correlated cases.
method Taylor expansions and classical Itô calculus to derive option prices, uses negative powers of future mean volatility.
result The paper provides a new method to calculate Bachelier option prices and applies it to reduce variance in Monte Carlo simulations.

In this paper Portfolio Optimization techniques were used to determine the most favorable investment portfolio. In particular, stock indices of three companies, namely Microsoft Corporation, Christian Dior Fashion House and Shevron Corporation were evaluated. Using this data the amounts invested in each asset when a po…

2015-05-19abs ↗pdf ↗

In risk management, tail risks are of crucial importance. The assessment of risks should be carried out in accordance with the regulatory authority's requirement at high quantiles. In general, the underlying distribution function is unknown, the database is sparse, and therefore special tail models are used. Very often…

2019-04-27abs ↗pdf ↗

This paper calculates worst-case target semi-variances for uncertain losses.

problem Managing risk when loss distribution is uncertain and only partial information is known.
method Derives worst-case target semi-variances for symmetric or non-negative losses under uncertainty sets representing investor's undesirable scenarios.
result Closed-form expressions for worst-case target semi-variances are derived.

Within many machine learning algorithms, a fundamental problem concerns efficient calculation of an unbiased gradient wrt parameters $\gammav$ for expectation-based objectives $\Ebb_{q_{\gammav} (\yv)} [f(\yv)]$. Most existing methods either (i) suffer from high variance, seeking help from (often) complicated variance-…

2019-01-17abs ↗pdf ↗

It is well known that Markov chain Monte Carlo (MCMC) methods scale poorly with dataset size. A popular class of methods for solving this issue is stochastic gradient MCMC. These methods use a noisy estimate of the gradient of the log posterior, which reduces the per iteration computational cost of the algorithm. Despi…

2017-06-16abs ↗pdf ↗

This research develops a new model for cyber risk and insurance pricing.

problem Accurate calculation of aggregate losses in cyber insurance pricing.
method A path-based k-generation risk contagion model in a tree-shaped network structure.
result Explicit expressions for mean and variance of local loss on a single path.

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.

Maximum Likelihood Estimators (MLE) has many good properties. For example, the asymptotic variance of MLE solution attains equality of the asymptotic Cram{é}r-Rao lower bound (efficiency bound), which is the minimum possible variance for an unbiased estimator. However, obtaining such MLE solution requires calculating t…

2018-05-18abs ↗pdf ↗

Paper derives closed-form solutions for CEV model using semiclassical approximation.

problem Analyzing the constant elasticity variance (CEV) option pricing model.
method Utilizes semiclassical (WKB) approximation and Van Vleck-Morette determinant.
result Derives an exponential factor not previously considered in the kernel.

A large portfolio of independent returns is optimized under the variance risk measure with a ban on short positions. The no-short selling constraint acts as an asymmetric 1\ell_1 regularizer, setting some of the portfolio weights to zero and keeping the out of sample estimator for the variance bounded, avoiding the di…

2016-12-21abs ↗pdf ↗

Proposes deep graph persistence to address neural persistence issues in deep learning.

problem Variance of weights and lack of spatial structure in deep neural networks impact neural persistence.
method Extends neural persistence to the whole network, considering interactions between layers.
result Deep graph persistence alleviates variance-related issues and captures persistent paths through the network.

(Mini-batch) Stochastic Gradient Descent is a popular optimization method which has been applied to many machine learning applications. But a rather high variance introduced by the stochastic gradient in each step may slow down the convergence. In this paper, we propose the antithetic sampling strategy to reduce the va…

2018-10-07abs ↗pdf ↗

Deep Gaussian Processes (DGP) are hierarchical generalizations of Gaussian Processes (GP) that have proven to work effectively on a multiple supervised regression tasks. They combine the well calibrated uncertainty estimates of GPs with the great flexibility of multilayer models. In DGPs, given the inputs, the outputs …

2018-01-09abs ↗pdf ↗

In this paper we study a family of variance reduction methods with randomized batch size---at each step, the algorithm first randomly chooses the batch size and then selects a batch of samples to conduct a variance-reduced stochastic update. We give the linear convergence rate for this framework for composite functions…

2018-08-07abs ↗pdf ↗

CPCR mitigates bias in PCR for overparameterized models.

problem Bias in Principal Component Regression (PCR) for overparameterized models.
method Calibrated Principal Component Regression (CPCR) learns a low-variance prior in the PC subspace and calibrates the model in the original feature space.
result CPCR outperforms standard PCR in overparameterized settings, improving prediction across multiple problems.

We introduce a faithful representation of the heavy tail multivariate distribution of asset returns, as parsimonous as the Gaussian framework. Using calculation techniques of functional integration and Feynman diagrams borrowed from particle physics, we characterize precisely, through its cumulants of high order, the d…

1998-11-19abs ↗pdf ↗

This paper examines weight initialization for 1-Lipschitz networks to improve robustness against adversarial attacks.

problem Improving the robustness of deep neural networks against adversarial attacks.
method Examined weight parametrization of AOL and SLL networks, calculated weight variance bounds, and demonstrated weight decay.
result Weight initialization causes deep 1-Lipschitz networks to decay to zero, and weight variance does not affect output variance distribution.

We investigate the use of Malliavin calculus in order to calculate the Greeks of multidimensional complex path-dependent options by simulation. For this purpose, we extend the formulas employed by Montero and Kohatsu-Higa to the multidimensional case. The multidimensional setting shows the convenience of the Malliavin …

2011-03-29abs ↗pdf ↗