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

87174261348 · May 202619922001200920172026
48 results for local variance

The paper extends a variance gamma model to quadratic functions, reducing arbitrage and computational costs.

problem Creating an arbitrage-free interpolation for option pricing models.
method Generalizing the local variance gamma model to a piecewise quadratic local variance function.
result The quadratic model results in an arbitrage-free interpolation of class C3, reducing knots and computational cost.

This paper describes another extension of the Local Variance Gamma model originally proposed by P. Carr in 2008, and then further elaborated on by Carr and Nadtochiy, 2017 (CN2017), and Carr and Itkin, 2018 (CI2018). As compared with the latest version of the model developed in CI2018 and called the ELVG (the Expanded …

2018-09-19abs ↗pdf ↗

Asymptotic analysis of short-maturity options on realized variance in local-stochastic volatility models.

problem Analyzing the behavior of short-maturity options on realized variance in local-stochastic volatility models.
method Large deviations theory and variational problems to solve rate functions for different cases.
result Explicit solutions for the rate function in the uncorrelated case and upper/lower bounds and expansions for the correlated case.

New insights into bias-variance tradeoff for data-driven optimization under local misspecification.

problem Understanding the relative performance of SAA, IEO, and ETO under local misspecification.
method Developed a local misspecification perspective using contiguity theory in statistics.
result Explicit expressions for decision bias and geometric understanding of variance.

We investigate a local reparameterizaton technique for greatly reducing the variance of stochastic gradients for variational Bayesian inference (SGVB) of a posterior over model parameters, while retaining parallelizability. This local reparameterization translates uncertainty about global parameters into local noise th…

2015-06-08abs ↗pdf ↗

Managing risk in dynamic decision problems is of cardinal importance in many fields such as finance and process control. The most common approach to defining risk is through various variance related criteria such as the Sharpe Ratio or the standard deviation adjusted reward. It is known that optimizing many of the vari…

2012-06-27abs ↗pdf ↗

The paper proposes an expanded version of the Local Variance Gamma model of Carr and Nadtochiy by adding drift to the governing underlying process. Still in this new model it is possible to derive an ordinary differential equation for the option price which plays a role of Dupire's equation for the standard local volat…

2018-02-26abs ↗pdf ↗

Derives variance kernel for reaction boundary in financial models.

problem Separating components in financial volatility models.
method Operational-time variance kernel, damped Abel response kernel, closed asymptotic form.
result Operational variance has a closed asymptotic form involving various parameters.

Analyzes how diffusion models learn, revealing a spectral bias in structure mastery.

problem Understanding the learning dynamics and bias in diffusion models.
method Developed an analytical framework using a Gaussian-equivalence principle to solve gradient-flow dynamics and integrate probability-flow ODEs.
result Exposes a universal inverse-variance spectral law: high-variance structure is mastered faster than low-variance detail.

Derives operational-time variance kernel for reaction boundaries in financial markets.

problem Separating components in volatility models to better understand market dynamics.
method Derives a variance kernel for a latent-order-book reaction boundary, separating structural boundary cumulant, clock projection, and pricing-measure choice.
result Operational variance has a closed asymptotic form for long-memory forcing, with effective signed-forcing intensity and resilience.

We present an actor-critic framework for MDPs where the objective is the variance-adjusted expected return. Our critic uses linear function approximation, and we extend the concept of compatible features to the variance-adjusted setting. We present an episodic actor-critic algorithm and show that it converges almost su…

2013-10-14abs ↗pdf ↗

The paper calibrates a model to market quotes efficiently and arbitrage-free.

problem Calibrating a model to market option quotes efficiently and without arbitrage.
method Piecewise-linear local variance function for efficient calibration.
result Arbitrage-free interpolation of class C2C^2 achieved under one millisecond.

To accelerate the training of machine learning models, distributed stochastic gradient descent (SGD) and its variants have been widely adopted, which apply multiple workers in parallel to speed up training. Among them, Local SGD has gained much attention due to its lower communication cost. Nevertheless, when the data …

2019-12-30abs ↗pdf ↗

Self-attention networks localize when eigenspectrum variance is small.

problem Self-attention mechanisms can lead to rank and entropy collapses, reducing model expressivity and trainability.
method Characterized attention localization using query-key eigenspectrum variance.
result Small eigenspectrum variance prevents both rank and entropy collapses, improving model performance.

The paper explores risk-minimization for exponential additive models, providing mathematical expressions and numerical examples.

problem Risk-minimization in incomplete markets for exponential additive models.
method Derive explicit mathematical expressions for local risk-minimization strategies in exponential additive models.
result Provide necessary conditions for deriving expressions and confirm integrability conditions for specific models.

We compute the value of a variance swap when the underlying is modeled as a Markov process time changed by a Lévy subordinator. In this framework, the underlying may exhibit jumps with a state-dependent Lévy measure, local stochastic volatility and have a local stochastic default intensity. Moreover, the Lévy subordina…

2012-09-04abs ↗pdf ↗

Bagging reduces variance in LID estimation by preserving local distribution of NN distances.

problem High estimation variance from limited data in small neighborhoods.
method Subbagging to preserve local distribution of NN distances, combined with ensemble size.
result Bagging significantly reduces variance and MSE in LID estimation.

Adaptive batch sizes improve local gradient methods in distributed training.

problem Communication bottlenecks in distributed deep learning.
method Adaptive batch size strategies for local gradient methods.
result Adaptive batch sizes reduce minibatch gradient variance and improve training efficiency.

FedGLOMO accelerates FL convergence for non-convex functions.

problem Efficiently solving non-convex optimization problems in federated learning with client heterogeneity.
method Combines global and local momentum updates to reduce variance and improve convergence rate.
result Achieves O(ε1.5)\mathcal{O}(ε^{-1.5}) convergence to εε-stationary point, compared to O(ε2)\mathcal{O}(ε^{-2}).

Locally adapted parameterizations of a model (such as locally weighted regression) are expressive but often suffer from high variance. We describe an approach for reducing the variance, based on the idea of estimating simultaneously a transformed space for the model, as well as locally adapted parameterizations in this…

2012-06-27abs ↗pdf ↗

A new method improves few-shot learning by combining ProtoNet with LFD.

problem Few-shot learning struggles with high variance support sets.
method Combines ProtoNet with Local Fisher Discriminant Analysis.
result Superior classification accuracy on miniImageNet and tieredImageNet.

Optimizes budgeted evaluations of LLMs by allocating queries to judges efficiently.

problem Evaluating LLMs with heterogeneous judges and varying costs and reliability.
method Formalizes and analyzes budgeted heteroskedastic multi-judge estimation, proposing EST-IVWE for practical implementation.
result EST-IVWE matches the oracle IVWE rate up to lower-order terms in the budget and is instance-optimal.

This study optimizes model averaging for personalized collaborative learning.

problem Differences in data or objectives between nodes in federated learning.
method Weighted averaging between local and global models for scalar mean estimation.
result There is always some positive model averaging that reduces expected squared error.

The paper proves the law of one price in a continuous-time setting without friction.

problem Identifying conditions under which the law of one price holds in a continuous-time setting without frictions.
method Formulating a new mechanism for LOP failure and proving a novel variant of the uniform boundedness principle.
result Establishes the equivalence of the economic concept of LOP with the probabilistic property of the existence of a local $\scr{E}$-martingale state price density.

The latest generation of volatility derivatives goes beyond variance and volatility swaps and probes our ability to price realized variance and sojourn times along bridges for the underlying stock price process. In this paper, we give an operator algebraic treatment of this problem based on Dyson expansions and moment …

2007-10-16abs ↗pdf ↗

Two Fisher information matrix estimators are analyzed for neural networks, focusing on their variances and trade-offs.

problem Estimating the Fisher information matrix in neural networks due to its high computational cost.
method Examined two popular diagonal Fisher information matrix estimators and their variances in neural networks for regression and classification.
result The variances of the estimators depend on the non-linearity with respect to different parameter groups and should not be neglected.

The paper characterizes optimal dynamic portfolios for a modified mean-variance utility.

problem Optimal dynamic portfolio choice for a modified mean-variance utility.
method Complete characterization under minimal assumptions, no restrictions on asset return moments.
result Maximal MMV utility is linked to the monotone Sharpe ratio, with global squared MSR as the nominal yield.

New proof shows how to identify DAGs with weakly increasing errors.

problem Identifying the true DAG in models with weakly increasing error variances.
method Minimum-trace DAG method and hill climbing algorithm with R2R neighborhood.
result Hill climbing algorithm without strict local optima under weakly increasing error variances.

We propose and investigate new complementary methodologies for estimating predictive variance networks in regression neural networks. We derive a locally aware mini-batching scheme that result in sparse robust gradients, and show how to make unbiased weight updates to a variance network. Further, we formulate a heurist…

2019-06-04abs ↗pdf ↗

LEAPS samples discrete distributions via CTMCs and locally equivariant networks.

problem Sampling from discrete distributions with known normalization.
method Continuous-time Markov chain, locally equivariant functions, attention layers, convolutional networks.
result LEAPS minimizes the variance of importance weights, improving sampling efficiency.

Risk management in dynamic decision problems is a primary concern in many fields, including financial investment, autonomous driving, and healthcare. The mean-variance function is one of the most widely used objective functions in risk management due to its simplicity and interpretability. Existing algorithms for mean-…

2018-09-07abs ↗pdf ↗