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

5101520 · Oct 201919922001200920172026
48 results for vanilla

This paper uses basket option formulas to price vanilla options with discrete dividends.

problem Pricing vanilla options on stocks with discrete cash dividends.
method Uses existing basket option formulas for European options on a single asset with cash dividends in the piecewise lognormal model.
result Explains the use of basket option formulas for a specific problem in the piecewise lognormal model.

DDSME outperforms SME in estimating multimodal distributions.

problem Efficiency of score matching in multimodal distributions.
method Diffusion-based denoising score matching (DDSME) compared to vanilla score matching (SME).
result DDSME avoids the error bound deterioration of SME with increasing mode separation.

Deep vanilla transformers trained without shortcuts achieve similar performance to standard models.

problem Training deep vanilla transformers without shortcuts and normalizations.
method Parameter initializations, bias matrices, and location-dependent rescaling.
result Deep vanilla transformers can train at similar speeds and performance to standard models.

Vanilla Bayesian optimization performs well in high dimensions.

problem Bayesian optimization's poor performance in high-dimensional problems.
method Identified and addressed degeneracies, proposed scaling of Gaussian process lengthscale prior.
result Vanilla Bayesian optimization outperforms existing algorithms in high-dimensional tasks.

Vanilla SGD learns SIM from anisotropic data without explicit covariance estimation.

problem Learning SIM from anisotropic Gaussian inputs.
method Vanilla Stochastic Gradient Descent (SGD) trained on SIM with anisotropic input.
result Vanilla SGD adapts to anisotropic data's covariance structure.

Algorithm improves vanilla option pricing accuracy during and before COVID-19.

problem Improving vanilla option pricing accuracy during and before the pandemic.
method Combinational Mutation Strategy of Differential Evolution (CmDE) algorithm for bi-objective optimization.
result Algorithm approximates real market vanilla option prices more accurately than Black-Scholes.

The Bass model is calibrated to vanilla options using a fixed-point equation.

problem Calibration of the Bass local volatility model to vanilla options.
method Solving a fixed-point equation to achieve calibration.
result Existence and uniqueness of the solution to the fixed-point equation, and linear convergence of the fixed-point iteration scheme.

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 ↗

This paper examines Bachelier implied volatility at extreme strikes.

problem Investigates appropriate implied volatility extrapolation at extreme strikes.
method Compares Bachelier and Black-Scholes models, focusing on normal distribution and vanilla options.
result Bachelier implied variance grows at most linearly in log-moneyness, similar to Black-Scholes.

Quantization algorithms have been successfully adopted to option pricing in finance thanks to the high convergence rate of the numerical approximation. In particular, very recently, recursive marginal quantization has been proven to be a flexible and versatile tool when applied to stochastic volatility processes. In th…

2017-10-31abs ↗pdf ↗

The paper finds optimal strategies for hedging in incomplete markets using derivatives.

problem Optimal static hedging in incomplete markets with two underlying assets and vanilla options.
method Formulated as a utility maximization problem, solved through variational methods and fixed point analysis.
result Semi-analytical solutions for exponential, power/logarithmic, and quadratic utilities, with convergence to a fixed point for exponential utility.

Paper examines fairness of data augmentation methods, finding vanilla Mixup outperforms Fair Mixup.

problem Improving fairness in classification models with limited minority data.
method Uses multicalibration to rigorously evaluate and improve data augmentation methods for classification fairness.
result Vanilla Mixup outperforms Fair Mixup and baseline methods in fairness and accuracy, especially with small minority groups.

Study utility indifference pricing in a Bachelier model with small linear price impact.

problem Utility indifference pricing in a model with linear price impact.
method Analyzes the Bachelier model with exponential utility indifference prices for vanilla European options.
result Computes the scaling limit of utility indifference prices for a vanishing price impact inversely proportional to risk aversion.

Study optimizes option pricing with robust strategies, ensuring consistency with vanilla option prices.

problem Optimizing exotic option pricing with robust strategies.
method Introduces semistatic strategies and robust convex integral functionals on bounded continuous functions.
result Consistent indifference prices with observed vanilla option prices.

A new relaxed framework for pricing illiquid derivatives using bid-ask spreads.

problem Pricing illiquid derivatives with realistic bounds and hedging prices.
method Introducing Bid--Ask Martingale Optimal Transport (BAMOT) that relaxes the exact calibration of model marginals to mid-prices of vanilla options.
result BAMOT yields realistic price bounds and superhedging prices for illiquid derivatives.

We introduce Negative Sampling in Semi-Supervised Learning (NS3L), a simple, fast, easy to tune algorithm for semi-supervised learning (SSL). NS3L is motivated by the success of negative sampling/contrastive estimation. We demonstrate that adding the NS3L loss to state-of-the-art SSL algorithms, such as the Virtual Adv…

2019-11-12abs ↗pdf ↗

Deep RL policies are vulnerable to adversarial perturbations, but vanilla training yields more robust policies.

problem Vulnerability of deep reinforcement learning policies to adversarial perturbations.
method Analysis of deep reinforcement learning policy landscape and comparison of vanilla vs. adversarial training.
result Vanilla training yields more robust policies compared to adversarial training.

Study optimal liquidation under high risk aversion and small price impact.

problem Optimal liquidation of options under high risk aversion and linear price impact.
method Analyzes Bachelier model with linear price impact, computes utility indifference prices, and finds asymptotically optimal portfolios.
result Establishes a scaling limit for vanishing price impact and computes corresponding utility indifference prices.

New analysis improves sample complexity for vanilla policy gradient methods.

problem Improving sample complexity guarantees for vanilla policy gradient methods.
method Adapting tools from SGD analysis to policy gradient methods, with smoothness and gradient approximation assumptions.
result Established improved sample complexity bounds for convergence and global optimum.

Motivated by the model- independent pricing of derivatives calibrated to the real market, we consider an optimization problem similar to the optimal Skorokhod embedding problem, where the embedded Brownian motion needs only to reproduce a finite number of prices of Vanilla options. We derive in this paper the correspon…

2017-01-27abs ↗pdf ↗

We describe a method for unmixing mixtures of freely independent random variables in a manner analogous to the independent component analysis (ICA) based method for unmixing independent random variables from their additive mixtures. Random matrices play the role of free random variables in this context so the method we…

2019-05-05abs ↗pdf ↗

Stein variational gradient descent (SVGD) is a particle-based inference algorithm that leverages gradient information for efficient approximate inference. In this work, we enhance SVGD by leveraging preconditioning matrices, such as the Hessian and Fisher information matrix, to incorporate geometric information into SV…

2019-10-28abs ↗pdf ↗

Improved Gaussian process inference for spatio-temporal data.

problem Cubic computational costs in Gaussian process inference, especially in spatio-temporal settings.
method Proposes the Vanilla-SPDE Exchange, leveraging an equivalence between standard and SPDE formulations to achieve improved computational cost.
result Demonstrates improved computational efficiency through complexity analysis and numerical experiments.

Fourier methods fail to accurately approximate option Greeks in realistic market conditions.

problem Failure of Fourier pricing techniques to approximate Greeks in realistic market parameters.
method Used Fourier techniques like Carr-Madan formula, COS method, and Lewis formula to approximate Greeks, which failed in some market conditions.
result Empirically showed that Fourier methods completely fail to approximate Greeks in realistic market environments.

It is well known that any sufficiently regular one-dimensional payoff function has an explicit static hedge by bonds, forward contracts and lots of vanilla options. We show that the natural extension of the corresponding representation leads to a static hedge based on the same instruments along with traffic light optio…

2010-11-22abs ↗pdf ↗

Model-free approach to hedge path-dependent options using min-max optimization.

problem Hedging path-dependent options with maturity T using a static portfolio of vanilla options.
method Model-free approach based on primal-dual Martingale Optimal Transport (MOT) problem, solving a min-max optimization problem.
result Provides theoretical bounds on hedging error at maturity T.

The crisis that affected financial markets in the last years leaded market practitioners to revise well known basic concepts like the ones of discount factors and forward rates. A single yield curve is not sufficient any longer to describe the market of interest rate products. On the other hand, using different yield c…

2010-06-24abs ↗pdf ↗

A new offline RL framework unifies imitation learning and vanilla offline RL.

problem Learning from expert datasets without active data collection.
method A new offline RL framework that interpolates between imitation learning and vanilla offline RL, using a weak concentrability coefficient and a lower confidence bound algorithm.
result LCB algorithm achieves a faster rate of 1/N1/N for nearly-expert datasets, and is adaptively optimal for the entire data composition range.

Geometric interpretation improves VAE performance and robustness.

problem Improving Variational Autoencoder performance and robustness.
method Introducing a geometric perspective on VAEs, sampling from the Riemannian latent space.
result Improved generation and interpolations with competitive or better performance on benchmark datasets.