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

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for replication formula

The article provides formulas to hedge impermanent loss in decentralized markets.

problem Impermanent loss in concentrated liquidity provision in decentralized markets.
method Analytical characterizations and static replication formulas using European calls or puts.
result Static replication formulas accurately hedge impermanent loss.

In this note we show how to replicate a stylized CDS with a repurchase agreement and an asset swap. The latter must be designed in such a way that, on default of the issuer, it is terminated with a zero close-out amount. This break clause can be priced using the well known unilateral credit/debit valuation adjustment f…

2013-04-30abs ↗pdf ↗

We introduce a new model for pricing corporate bonds, which is a modification of the classical model of Merton. In this new model, we drop the liquidity assumption of the firm's asset value process, and assume that there is a liquidly traded asset in the market whose value is correlated with the firm's asset value, and…

2019-10-18abs ↗pdf ↗

We discuss and clarify the XVA modelling framework specified in the paper "MVA by replication and regression" (Risk Magazine, May 2015) for including bilateral credit risk and funding costs in derivative pricing, and in doing so we rectify two key errors in the valuation adjustments accounting for costs of capital and …

2018-07-28abs ↗pdf ↗

The paper prices and replicates various financial contracts on a risky asset with stochastic volatility and jumps.

problem Pricing and replicating financial contracts on assets with stochastic volatility and jumps.
method Develops pricing and hedging formulas for various financial contracts, independent of the volatility process dynamics.
result Pricing and hedging formulas for financial contracts are derived without dependence on the volatility process dynamics.

We study the set of marginal utility-based prices of a financial derivative in the case where the investor has a non-replicable random endowment. We provide an example showing that even in the simplest of settings - such as Samuelson's geometric Brownian motion model - the interval of marginal utility-based prices can …

2017-02-07abs ↗pdf ↗

This work analyzes impermanent loss in decentralized markets and provides a hedging strategy.

problem Impermanent loss in automated market makers (AMMs).
method Analytical derivation of a static replication formula using European options, and numerical example with real data.
result Guaranteed hedging coverage for all final prices within a predefined interval.

We examine in this article the pricing of target volatility options in the lognormal fractional SABR model. A decomposition formula by Ito's calculus yields a theoretical replicating strategy for the target volatility option, assuming the accessibilities of all variance swaps and swaptions. The same formula also sugges…

2018-01-24abs ↗pdf ↗

The paper examines fair pricing and hedging stability under small numéraire perturbations.

problem Fair pricing and hedging stability under numéraire perturbations.
method Reformulating the stochastic control problem to show stability and deriving asymptotic formulas.
result Fair price and hedging strategy are stable with small numéraire perturbations.

New study on replicability and stability in machine learning algorithms.

problem Ensuring consistent results in machine learning models without fixing randomness.
method Introduced global stability and list replicability concepts, proving their equivalence and boosting list replicability.
result Global stability can only be achieved weakly, while list replicability can be boosted to achieve high probability of consistent results.

Study on computational aspects of replicable learning, bridging statistical and algorithmic perspectives.

problem Understanding the computational connections between replicability and various learning paradigms.
method Design of replicable learners, lifting framework, and transformation techniques.
result Efficient replicable learners for specific learning problems under various distributions.

We propose a model to study the effects of delayed information on option pricing. We first talk about the absence of arbitrage in our model, and then discuss super replication with delayed information in a binomial model, notably, we present a closed form formula for the price of convex contingent claims. Also, we addr…

2017-07-06abs ↗pdf ↗

We present an approach to market-consistent multi-period valuation of insurance liability cash flows based on a two-stage valuation procedure. First, a portfolio of traded financial instrument aimed at replicating the liability cash flow is fixed. Then the residual cash flow is managed by repeated one-period replicatio…

2016-07-14abs ↗pdf ↗

New algorithm prevents strategic replication in multi-armed bandit problems.

problem Strategic replication by agents can exploit bandit algorithms' balance.
method Designs Hierarchical UCB (H-UCB) and Robust Hierarchical UCB (RH-UCB) algorithms.
result Achieves O(lnT)O(\ln T)-regret and sublinear regret in realistic scenarios.

We consider the problem of option hedging in a market with proportional transaction costs. Since super-replication is very costly in such markets, we replace perfect hedging with an expected loss constraint. Asymptotic analysis for small transactions is used to obtain a tractable model. A general expansion theory is de…

2013-09-19abs ↗pdf ↗

Extends super-replication theorem with dynamic strategies and transaction costs.

problem Dynamic super-replication under proportional transaction costs.
method Generalizes admissible strategies and defines a well-defined super-replication price process.
result Well-defined super-replication price process in dynamic setting.

Study replicability in high-dimensional statistics, resolving open problems.

problem Ensuring consistent results in high-dimensional statistical tasks.
method Introduced replicable learning algorithms and established computational and statistical equivalence with high-dimensional isoperimetric tilings.
result Matching sample complexity upper and lower bounds for replicable mean estimation and coin problem.

Derives pricing formulas for perpetual futures contracts.

problem Ensuring fair pricing of perpetual futures contracts without expiration.
method Explicit expressions derived for various types of perpetual contracts, including linear, inverse, and quantos futures.
result Futures price is the risk-neutral expectation of the spot price sampled at a random time reflecting funding payments.

This paper investigates market-consistent valuation of insurance liabilities in the context of, for instance, Solvency II and to some extent IFRS 4. We propose an explicit and consistent framework for the valuation of insurance liabilities which incorporates the Solvency II approach as a special case. The proposed fram…

2010-12-30abs ↗pdf ↗

In this work we introduce the notion of fully incomplete markets. We prove that for these markets the super-replication price coincide with the model free super-replication price. Namely, the knowledge of the model does not reduce the super-replication price. We provide two families of fully incomplete models: stochast…

2015-08-21abs ↗pdf ↗

We study super--replication of contingent claims in markets with fixed transaction costs. This can be viewed as a stochastic impulse control problem with a terminal state constraint. The first result in this paper reveals that in reasonable continuous time financial market models the super--replication price is prohibi…

2016-10-28abs ↗pdf ↗

Optimizing expensive black-box systems with limited data is an extremely challenging problem. As a resolution, we present a new surrogate optimization approach by addressing two gaps in prior research -- unimportant input variables and inefficient treatment of uncertainty associated with the black-box output. We first …

2019-11-06abs ↗pdf ↗

Adaptive replication improves stochastic function optimization.

problem Challenges in accurately estimating functions with high variance.
method Trust-region-based Bayesian optimization with adaptive replication.
result Adaptive replication substantially improves solution accuracy and efficiency.

Replicable clustering algorithms for k-medians, k-means, and k-centers are proposed.

problem Designing clustering algorithms that produce the same partition on repeated runs under the same distribution.
method Utilizing approximation routines for combinatorial clustering problems in a black-box manner.
result Replicable algorithms for statistical kk-medians, kk-means, and kk-centers with specified approximation and sample complexities.

Researchers find a timing error in Black-Scholes-Merton option pricing model.

problem Timing error in Black-Scholes-Merton option pricing model.
method Discovered a timing mistake in Merton's 1971 model and showed misspecification in continuous and discrete time.
result Invalidates seminal contributions to the literature including Black-Scholes (1973) and Merton (1971).

The paper prices long-term options with a reflecting barrier model.

problem Pricing long-term options with asset price limits.
method Model asset price as geometric Brownian motion with a lower reflecting barrier, pricing options using compound options.
result Option prices can be determined using standard risk-neutral arguments, and hedging strategies are available.

Efficient algorithms improve learning of large-margin halfspaces.

problem Learning large-margin halfspaces efficiently and reproducibly.
method Design of efficient, dimension-independent, polynomial-time algorithms; SGD-based approach; DP-to-Replicability reduction.
result Improved sample complexity compared to previous algorithms, with optimal sample complexity for one algorithm.

This paper studies robust payoff allocation in submodular games, especially against replication.

problem Payoff allocation in submodular games, especially robustness against replication.
method Systematically studied replication manipulation in submodular games, introduced replication robustness metric, and validated with empirical ML data market.
result Conditions characterizing robustness of semivalues in submodular games.

We describe TF-Replicator, a framework for distributed machine learning designed for DeepMind researchers and implemented as an abstraction over TensorFlow. TF-Replicator simplifies writing data-parallel and model-parallel research code. The same models can be effortlessly deployed to different cluster architectures (i…

2019-02-01abs ↗pdf ↗