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

3775112149 · Jun 202019922001200920172026
48 results for arbitrage constraints

No-arbitrage constraints on implied variance slope are weak, leading to almost guaranteed arbitrage in many cases.

problem Weak constraints on implied variance slope in the Black-Scholes model lead to arbitrage opportunities.
method Analysis of constraints on implied variance slope and their implications for arbitrage.
result Arbitrage is almost always guaranteed in a wide range of slope values where constraints are enforced.

Deep learning models reconstruct volatility surfaces from noisy data under no-arbitrage constraints.

problem Reconstructing implied volatility surfaces from sparse and noisy option quotes.
method Compared multiple neural architectures including Transformers, U-Nets, and variational autoencoders.
result Transformer and U-Net architectures achieve strong reconstruction accuracy, especially under sparse observation regimes.

We show that coherent risk measures are ineffective in curbing the behaviour of investors with limited liability or excessive tail-risk seeking behaviour if the market admits statistical arbitrage opportunities which we term ρρ-arbitrage for a risk measure ρρ. We show how to determine analytically whether such ρρ-ar…

2019-02-26abs ↗pdf ↗

Two ML approaches learn local volatility surfaces from option prices, with GP being arbitrage-free.

problem Interpolating European vanilla option prices to create a local volatility surface.
method Gaussian process regression and neural net with arbitrage penalties.
result GP approach is arbitrage-free and yields best out-of-sample calibration error.

Deep learning framework for bond and yield curve forecasting with no-arbitrage constraints.

problem Arbitrage-free yield curve and bond price forecasting.
method Combines Kalman, extended Kalman, and particle filters with LSTM/CLSTM, and introduces AER term.
result Arbitrage regularization improves forecast accuracy, especially at short maturities.

The paper applies thermodynamics to financial markets to prove no-arbitrage constraints.

problem No arbitrage in financial markets under price impact.
method Stochastic thermodynamics applied to financial trading cycles.
result Proves any round-trip trading strategy yields non-positive expected profit.

Develops a nonparametric model for arbitrage-free pricing of illiquid derivatives.

problem Modeling joint dynamics of liquid vanilla options for arbitrage-free pricing of illiquid derivatives.
method Derives a state space for prices respecting underlying financial constraints using neural networks and imposes constraints to preserve no-arbitrage conditions.
result Neural SDE models are guaranteed to satisfy a set of linear inequalities and validated with numerical experiments.

A model-free framework extracts risk-neutral densities from short-dated options.

problem Arbitrage and bid-ask spread issues in short-dated options.
method Develops ARIES for filtering static arbitrage and SEDEx for density extraction.
result Robust density extraction across various market conditions and volatility smiles construction.

We apply Gauge Theory of Arbitrage (GTA) {hep-th/9710148} to derivative pricing. We show how the standard results of Black-Scholes analysis appear from GTA and derive correction to the Black-Scholes equation due to a virtual arbitrage and speculators reaction on it. The model accounts for both violation of the no-arbit…

1997-12-03abs ↗pdf ↗

Develops a deep learning method for enforcing no-arbitrage in local volatility surfaces.

problem No-arbitrage conditions not enforced in deep learning approaches for local volatility.
method Jointly interpolates European vanilla option prices, enforcing no-arbitrage through modified loss functions or network architectures.
result Demonstrates the effectiveness of enforcing no-arbitrage in local volatility surfaces using deep learning.

In a discrete-time market, we study model-independent superhedging, while the semi-static superhedging portfolio consists of {\it three} parts: static positions in liquidly traded vanilla calls, static positions in other tradable, yet possibly less liquid, exotic options, and a dynamic trading strategy in risky assets …

2014-02-11abs ↗pdf ↗

This paper provides a neural approach to represent option implied information.

problem Link between implied density and volatility for arbitrage-free modeling.
method Minimalist perspective on implied volatility, neural representation with arbitrage constraints.
result Shallow feedforward network with a single hidden layer effectively approximates implied density and volatility.

Modeling financial markets with sandpile model to understand price volatility and arbitrage constraints.

problem Understanding price volatility and arbitrage constraints in financial markets.
method Uses a sandpile model to represent information and price changes, linking size of price volatility to the scaling law of avalanches.
result Identifies a structural tension between non-arbitrage condition and price adjustments consistent with a constant Sharpe ratio.

Proposes a method to repair arbitrage in option prices data.

problem Arbitrage in option price data can lead to poor performance or failure of financial applications.
method Formulates data repair as a linear programming (LP) problem to minimise price changes within bid and ask price bounds.
result The proposed method gives sparse perturbations on data and improves model calibration with enhanced robustness and reduced calibration error.

In this study we prove the existence of statistical arbitrage opportunities in the Black-Scholes framework by considering trading strategies that consists of borrowing from the risk free rate and taking a long position in the stock until it hits a deterministic barrier level. We derive analytical formulas for the expec…

2014-06-21abs ↗pdf ↗

Graph learning improves FXRP and FXSA with significant statistical arbitrage gains.

problem Improving FXRP and FXSA with complex multi-currency and interest rate relationships.
method Two-step graph learning approach: first, edge-level regression on spatiotemporal graph; second, stochastic optimization with constraints and risk-adjusted return maximization.
result Graph-learning method achieves higher information and Sortino ratios than benchmarks.

In this paper we investigate discrete time trading under integer constraints, that is, we assume that the offered goods or shares are traded in integer quantities instead of the usual real quantity assumption. For finite probability spaces and rational asset prices this has little effect on the core of the theory of no…

2017-08-25abs ↗pdf ↗

Framework predicts implied volatility surface without arbitrage.

problem Predicting implied volatility surface without static arbitrage.
method Two-step framework: feature selection and deep neural network (DNN) construction.
result DNN model for surface construction removes static arbitrage and reduces prediction error.

This paper considers a sequence of discrete-time random walk markets with a safe and a single risky investment opportunity, and gives conditions for the existence of arbitrages or free lunches with vanishing risk, of the form of waiting to buy and selling the next period, with no shorting, and furthermore for weak conv…

2012-06-25abs ↗pdf ↗

We extend the "No-dynamic-arbitrage and market impact"-framework of Jim Gatheral [Quantitative Finance, 10(7): 749-759 (2010)] to the multi-dimensional case where trading in one asset has a cross-impact on the price of other assets. From the condition of absence of dynamical arbitrage we derive theoretical limits for t…

2016-12-22abs ↗pdf ↗

Generative adversarial networks enforce no-arbitrage in volatility surface computation.

problem Efficiently compute volatility surfaces without arbitrage violations.
method Generative adversarial network (GAN) with no-arbitrage constraints.
result Proposed GAN model outperforms ANN approaches in accuracy and computational time.

The paper develops no arbitrage results for trajectory based models by imposing general constraints on the trading portfolios. The main condition imposed, in order to avoid arbitrage opportunities, is a local continuity requirement on the final portfolio value considered as a functional on the trajectory space. The pap…

2014-03-22abs ↗pdf ↗

We prove the superhedging duality for a discrete-time financial market with proportional transaction costs under model uncertainty. Frictions are modeled through solvency cones as in the original model of [Kabanov, Y., Hedging and liquidation under transaction costs in currency markets. Fin. Stoch., 3(2):237-248, 1999]…

2018-09-20abs ↗pdf ↗

We develop a dynamic version of the SSVI parameterisation for the total implied variance, ensuring that European vanilla option prices are martingales, hence preventing the occurrence of arbitrage, both static and dynamic. Insisting on the constraint that the total implied variance needs to be null at the maturity of t…

2019-09-23abs ↗pdf ↗

In this paper, the optimal mean-reverting portfolio (MRP) design problem is considered, which plays an important role for the statistical arbitrage (a.k.a. pairs trading) strategy in financial markets. The target of the optimal MRP design is to construct a portfolio from the underlying assets that can exhibit a satisfa…

2018-03-08abs ↗pdf ↗

We investigate the structure of good deal bounds, which are subintervals of a no-arbitrage pricing bound, for financial market models with convex constraints as an extension of Arai and Fukasawa (2014). The upper and lower bounds of a good deal bound are naturally described by a convex risk measure. We call such a risk…

2015-06-01abs ↗pdf ↗

DCNN improves volatility smile and skewness calibration without arbitrage constraints.

problem Calibrating volatility smile and skewness surfaces with no arbitrage constraints.
method Derivative-Constrained Neural Network (DCNN) incorporating derivatives in the loss function.
result DCNN generates a smooth surface that satisfies no-arbitrage conditions.

Paper uses VAEs to model yield curves without arbitrage violations.

problem Forecasting yield curves across diverse macroeconomic regimes leads to arbitrage violations.
method Proposes a two-stage architecture with CVAEsT+LS and Neural SDEs penalized by No-Arbitrage PDE.
result Significantly reduces forecasting errors and overcomes HJM model limitations.

In commodity markets the convergence of futures towards spot prices, at the expiration of the contract, is usually justified by no-arbitrage arguments. In this article, we propose an alternative approach that relies on the expected profit maximization problem of an agent, producing and storing a commodity while trading…

2015-01-01abs ↗pdf ↗

This paper presents a stochastic model for discrete-time trading in financial markets where trading costs are given by convex cost functions and portfolios are constrained by convex sets. The model does not assume the existence of a cash account/numeraire. In addition to classical frictionless markets and markets with …

2008-07-16abs ↗pdf ↗

This paper studies the optimal investment problem with random endowment in an inventory-based price impact model with competitive market makers. Our goal is to analyze how price impact affects optimal policies, as well as both pricing rules and demand schedules for contingent claims. For exponential market makers prefe…

2018-04-24abs ↗pdf ↗

Unified market making controls risk, arbitrage, and volatility surfaces.

problem Market making risk, arbitrage, and volatility surface consistency.
method Constrained RL and stochastic control for risk-sensitive execution and hedging.
result Agent achieves positive P&L with zero calendar and butterfly violations.

ARTEMIS combines deep learning and symbolic reasoning for financial predictions.

problem Lack of interpretability and economic principles in deep learning models in finance.
method Neuro-symbolic framework combining neural operators, stochastic differential equations, and symbolic distillation.
result ARTEMIS achieves state-of-the-art directional accuracy, outperforming all baselines on synthetic crash regime.

This paper demonstrates a practical method for computing the solution of an expectation-constrained robust maximization problem with immediate applications to model-free no-arbitrage bounds and super-replication values for many financial derivatives. While the previous literature has connected super-replication values …

2016-10-04abs ↗pdf ↗

A constrained informationally efficient market is defined to be one whose price process arises as the outcome of some equilibrium where agents face restrictions on trade. This paper investigates the case of short sale constraints, a setting which despite its simplicity, generates new insights. In particular, it is show…

2014-01-08abs ↗pdf ↗