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

118237355473 · Jun 202019922001200920172026
48 results for SV estimation

CGAs estimate team performance from data, simplifying SV computation.

problem Predicting and rewarding team performance using game theory.
method Cooperative game abstractions (CGAs) for estimating characteristic functions from data.
result CGAs enable linear-time computation of Shapley Value for team contributions.

Framework for sensitivity analysis in biomanufacturing processes.

problem High complexity and uncertainty in biomanufacturing processes.
method Shapley value estimation for linear and nonlinear pKG models, using quasi-Monte Carlo and antithetic sampling.
result Improved efficiency and accuracy in sensitivity analysis for biomanufacturing processes.

Improved Shapley Value method for better model interpretation.

problem Misunderstanding and incorrect interpretation of Shapley Values in machine learning models.
method Identification of null and active coalitions, coalitional Shapley Value computation.
result Correct computation and inference of important variables using Shapley Values.

Improved Shapley Values for tree-based models, more accurate than existing methods.

problem Inaccurate Shapley Values in tree-based models leading to poor explanations.
method Introduced two new estimators exploiting tree structure, derived correct approach for categorical variables.
result More accurate Shapley Values for tree-based models, demonstrated through simulations.

Stochastic volatility (SV) models mimic many of the stylized facts attributed to time series of asset returns, while maintaining conceptual simplicity. The commonly made assumption of conditionally normally distributed or Student-t-distributed returns, given the volatility, has however been questioned. In this manuscri…

2013-08-27abs ↗pdf ↗

We apply the hybrid Monte Carlo (HMC) algorithm to the financial time sires analysis of the stochastic volatility (SV) model for the first time. The HMC algorithm is used for the Markov chain Monte Carlo (MCMC) update of volatility variables of the SV model in the Bayesian inference. We compute parameters of the SV mod…

2008-07-28abs ↗pdf ↗

We prove that the Brin-Thompson groups sV, also called higher dimensional Thompson's groups, are of type F_\infty for all natural numbers s. This result was previously shown for s up to 3, by considering the action of sV on a naturally associated space. Our key step is to retract this space to a subspace sX which is ea…

2012-07-20abs ↗pdf ↗

FedCoin uses blockchain to fairly distribute incentives in federated learning.

problem Fairly incentivizing data owners in federated learning with privacy concerns.
method FedCoin uses a blockchain-based peer-to-peer payment system with a proof of Shapley (PoSap) protocol to calculate and distribute Shapley Values.
result FedCoin accurately computes Shapley Values and promotes high-quality data contributions.

This paper proposes a new method to fairly value data in federated learning.

problem Fairly valuing decentralized data contributions in federated learning.
method Variant of Shapley value (federated Shapley value) that is efficient and respects the order of data contributions.
result The federated Shapley value can reflect the real utility of data sources and enhance system robustness, security, and efficiency.

Sparse classifiers such as the support vector machines (SVM) are efficient in test-phases because the classifier is characterized only by a subset of the samples called support vectors (SVs), and the rest of the samples (non SVs) have no influence on the classification result. However, the advantage of the sparsity has…

2014-01-27abs ↗pdf ↗

In 'A Closed-Form Solution for Options with Stochastic Volatility with Applications to Bond and Currency Options', Heston proposes a Stochastic Volatility (SV) model with constant interest rate and derives a semi-explicit valuation formula. Heston also describes, in general terms, how the model could be extended to inc…

2018-09-24abs ↗pdf ↗

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 ↗

Let SVdnSV^{\pmb n}_{\pmb d} be the Segre-Veronese given as the image of the embedding induced by the line bundle OPn1××Pnr(d1,,dr)\mathcal{O}_{\mathbb{P}^{n_1}\times\dots\times\mathbb{P}^{n_r}}(d_1,\dots, d_r). We prove that asymptotically SVdnSV^{\pmb n}_{\pmb d} is not hh-defective for hn1log2(d1)h\leq n_1^{\lfloor \log_2(d-1)\rfloor}.

2016-11-05abs ↗pdf ↗

Study compares models for pricing multi-strike quanto call options with SV, SC, and SER.

problem Pricing multi-strike quanto call options with stochastic volatility, correlation, and exchange rates.
method Comparative analysis of SV, SC, and SER models; Monte Carlo simulation; Milstein scheme; antithetic variates; correlation risk parameters.
result GARCH-Jump SV, Weibull SC, and Ornstein Uhlenbeck (OU) SER model combination performs best.

Unified deep learning framework improves SV in noisy, reverberant, and long non-speech segments.

problem Robust speaker verification in adverse environments, especially short speech segments.
method Feature Pyramid Module (FPM)-based Multi-scale Aggregation (MSA), Self-adaptive Soft VAD (SAS-VAD), Masking-based Speech Enhancement (SE).
result The proposed method outperforms baseline systems in challenging conditions.

The hybrid Monte Carlo (HMC) algorithm is applied for the Bayesian inference of the stochastic volatility (SV) model. We use the HMC algorithm for the Markov chain Monte Carlo updates of volatility variables of the SV model. First we compute parameters of the SV model by using the artificial financial data and compare …

2009-12-30abs ↗pdf ↗

Improved KNN data valuation method with reduced computation time.

problem Efficiently valuing individual data points in KNN models.
method Proposed a new utility function and derived its calculation for KNN classifiers/regressors, achieving similar time complexity as the original method.
result Soft-label KNN-SV outperforms the original method in mislabeled data detection.

We describe a novel binary classification technique called Banded SVM (B-SVM). In the standard C-SVM formulation of Cortes et al. (1995), the decision rule is encouraged to lie in the interval [1, \infty]. The new B-SVM objective function contains a penalty term that encourages the decision rule to lie in a user specif…

2011-07-12abs ↗pdf ↗

Financial derivatives pricing aims to find the fair value of a financial contract on an underlying asset. Here we consider option pricing in the partial differential equations framework. The contemporary models lead to one-dimensional or multidimensional parabolic problems of the convection-diffusion type and generaliz…

2015-04-04abs ↗pdf ↗

The Stochastic Volatility (SV) model and its variants are widely used in the financial sector while recurrent neural network (RNN) models are successfully used in many large-scale industrial applications of Deep Learning. Our article combines these two methods in a non-trivial way and proposes a model, which we call th…

2019-06-07abs ↗pdf ↗

SIM-Shapley improves SV approximation efficiency and stability.

problem High computational costs of Shapley value methods in high-dimensional settings.
method Stochastic Iterative Momentum for Shapley Value Approximation (SIM-Shapley).
result Reduced computation time by up to 85% while maintaining feature attribution quality.

The paper addresses numerical integration issues in SV models, proposing a fast regime switching algorithm.

problem Numerical integration challenges in SV models, especially with high precision and low computational time.
method Proposes a fast regime switching algorithm to determine when higher precision arithmetic is needed.
result Shows that numerical quadratures need to be carefully chosen based on model parameters and parameter values.

Scalable model checking for stochastic systems using Gaussian Processes and Bayesian Neural Networks.

problem Efficiently verifying properties of stochastic systems with high-dimensional parameter spaces.
method Stochastic Variational Smoothed Model Checking (SV-smMC) using Gaussian Processes and Bayesian Neural Networks.
result SV-smMC scales to larger datasets and enables application to high-dimensional parameter spaces.

Researchers compute Greeks for rough Volterra SV models using Malliavin calculus.

problem Computing Greeks under rough Volterra stochastic volatility models.
method Malliavin calculus techniques, extending integration by parts to non-square integrable functionals.
result Formulas for computing Greeks (Delta, Gamma, Rho, Vega) under various rough Volterra SV models.

Mathematical construction of vertex algebra representations from integrable G2 structures.

problem Constructing representations of a specific vertex algebra from geometric input.
method Integrable G2 structures with closed torsion on group manifolds, embedding into superaffine vertex algebra and chiral de Rham complex.
result Embeddings of deformed Shatashvili-Vafa vertex algebra in the chiral algebra of heterotic G2 backgrounds.

RKHS-SHAP uses Shapley values for kernel methods to provide feature attributions.

problem Feature attribution for kernel methods is often heuristic and not individualised.
method RKHS-SHAP uses Shapley values from coalition game theory to compute feature attributions for kernel machines efficiently.
result RKHS-SHAP can compute both Interventional and Observational Shapley values.

Approximate Bayesian Computation (ABC) is a framework for performing likelihood-free posterior inference for simulation models. Stochastic Variational inference (SVI) is an appealing alternative to the inefficient sampling approaches commonly used in ABC. However, SVI is highly sensitive to the variance of the gradient…

2016-06-28abs ↗pdf ↗

The paper optimizes financial derivatives for market completion in SV models.

problem Optimizing financial derivatives for market completion in stochastic volatility models.
method Simulation-based method to approximate optimal portfolio strategy, using double optimization approach (utility maximization and risk exposure minimization).
result Strangle options are the best choices for market completion in equity options.

The paper compares three option pricing models with varying volatility dynamics.

problem Comparing the accuracy and efficiency of different option pricing models with changing volatility.
method Used stochastic volatility models including Heston and MSV, and compared them with existing models on 15 index option datasets.
result Stochastic volatility models achieve comparable accuracy to existing models and are faster to calibrate.