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

12.5%25.0%37.5%50.0% · Dec 199319922001200920172026
48 results for Delta method

New methods for delta-moves on algebraically split links identified.

problem Understanding delta-moves on algebraically split links.
method Introducing self and mixed delta-moves, proving equivalence, and calculating delta-splitting numbers.
result Two links are mixed delta-equivalent if they have the same pairwise linking number and components.

Delta method vs Bootstrap for deep learning classification shows strong linear relationship and faster computation.

problem Validating the Delta method for deep learning classification.
method Comparison of Delta method and Bootstrap on LeNet-based neural networks using MNIST and CIFAR-10 datasets.
result The Delta method provides a five times faster computation with strong linear predictive uncertainty relationship.

We introduce a new method of delta hedging. In many cases, this method results in a lower cost than the Black-Scholes method. To calculate the cost of hedging, we develop a Mathematica program that include the two-dimensional Newton-Raphson method.

2007-03-26abs ↗pdf ↗

Deep BSDE method for pricing and hedging complex financial portfolios.

problem Simultaneous pricing and delta-gamma hedging of large portfolios of multi-asset Bermudan options.
method Discretely reflected BSDEs, One Step Malliavin scheme, neural network regression Monte Carlo method.
result Efficient and accurate pricing and hedging strategies for high-dimensional portfolios.

Delta-unlinking number measures how to unlink algebraically split links.

problem Measuring unlinking complexity of algebraically split links.
method Defining delta-unlinking number as minimum delta-moves to unlink, proving bounds and calculating specific values.
result Precise delta-unlinking numbers for algebraically split prime links up to 9 crossings, and 4-genus values for most.

We develop techniques for studying fundamental groups and integral singular homology of symmetric Delta-complexes, and apply these techniques to study moduli spaces of stable tropical curves of unit volume, with and without marked points. As one application, we show that Delta_g and Delta_{g,n} are simply connected, fo…

2019-08-22abs ↗pdf ↗

A Delta-groupoid is an algebraic structure which axiomitizes the combinatorics of a truncated tetrahedron. It is shown that there are relations of Delta-groupoids to rings, group pairs, and (ideal) triangulations of three-manifolds. In particular, one can associate a Delta-groupoid to ideal triangulations of knot compl…

2009-08-10abs ↗pdf ↗

We refine the analysis of hedging strategies for options under the SABR model carried out in [2]. In particular, we provide a theoretical justification of the empirical observation made in [2] that the modified delta ("Bartlett's delta") introduced there provides a more accurate and robust hedging strategy than the con…

2017-04-11abs ↗pdf ↗

A Delta-groupoid is an algebraic structure which axiomatizes the combinatorics of a truncated tetrahedron. By considering two simplest examples coming from knot theory, we illustrate how can one associate a Delta-groupoid to an ideal triangulation of a three-manifold. We also describe in detail the rings associated wit…

2010-01-18abs ↗pdf ↗

Delta finite-type invariants are defined analogously to finite-type invariants, using delta moves instead of crossing changes. We show that they are closely related to the lower central series of the commutator subgroup of the pure braid group.

1999-07-12abs ↗pdf ↗

We call a Delta Diagram any diagram of a knot or link whose regions (including the unbounded one) have 3, 4, or 5 sides. We prove that any knot or link admits a delta diagram. We define and estimate combinatorial link invariants stemming from this definition.

2015-12-20abs ↗pdf ↗

This paper presents a Bayesian optimization method with exponential convergence without the need of auxiliary optimization and without the delta-cover sampling. Most Bayesian optimization methods require auxiliary optimization: an additional non-convex global optimization problem, which can be time-consuming and hard t…

2016-04-05abs ↗pdf ↗

The paper classifies pretzel links with 2 components and gives conditions for those with 3 or more.

problem Classifying pretzel links based on their self delta-equivalence.
method Using Conway polynomials to determine self delta-equivalence for links with 2 or more components.
result Necessary and sufficient conditions for self delta-equivalence of pretzel links with 3 or more components.

KrigHedge uses Gaussian processes to approximate option Greeks efficiently.

problem Computing option Greeks in complex models is computationally expensive or inexact.
method Gaussian process surrogates trained on noisy option prices, with analytical differentiation for sensitivities.
result The method provides accurate Delta approximations and quantifies hedging loss.

We study generalizations of finite-type knot invariants obtained by replacing the crossing change in the Vassiliev skein relation by some other local move, analyzing in detail the band-pass and doubled-delta moves. Using braid-theoretic techniques, we show that, for a large class of local moves, generalized Goussarov's…

2005-11-08abs ↗pdf ↗

New quantization methods improve accuracy of Random Fourier Features.

problem Improving accuracy of Random Fourier Features for machine learning.
method Sigma-Delta and distributed noise-shaping quantization methods for 1-bit and low bit-depth quantization.
result Quantized RFFs allow high accuracy approximation of underlying kernels with polynomial error decay.

Study calculates liquidity costs for delta hedging of European options.

problem Determining expected liquidity costs in delta hedging.
method Derives an integration formula for liquidity costs, including option prices and delta process.
result Expected liquidity costs can be calculated faster than Monte Carlo simulations.

This paper uses Malliavin calculus to price and compute delta of financial derivatives in jump-diffusion models.

problem Pricing and delta computation of financial derivatives in jump-diffusion models with stochastic intensity.
method Utilizes Malliavin calculus to price and compute delta, applying the Euler scheme for convergence analysis.
result Established the convergence of approximated solution, financial derivative, and its delta Greeks.

Modelling stock prices via jump processes is common in financial markets. In practice, to hedge a contingent claim one typically uses the so-called delta-hedging strategy. This strategy stems from the Black--Merton--Scholes model where it perfectly replicates contingent claims. From the theoretical viewpoint, there is …

2011-03-25abs ↗pdf ↗

We generalize the Manolescu-Owens smooth concordance invariant delta(K) of knots K in the 3-sphere to invariants delta_{p^n}(K) obtained by considering covers of order p^n, with p prime. Our main result shows that for any odd prime p, the direct sum of delta_{p^n} as n ranges through the natural numbers, yields a homom…

2008-09-05abs ↗pdf ↗

We consider a strictly pathwise setting for Delta hedging exotic options, based on Föllmer's pathwise Itō calculus. Price trajectories are dd-dimensional continuous functions whose pathwise quadratic variations and covariations are determined by a given local volatility matrix. The existence of Delta hedging strategie…

2015-10-30abs ↗pdf ↗

Study pairs of subspaces with or without a common complement in Hilbert spaces.

problem Characterize pairs of subspaces with or without a common complement in Hilbert spaces.
method Analyze pairs of subspaces (S, T) in the Grassmann manifold Gr(H) of a Hilbert space H, identifying Delta and Gamma based on the existence of a common complement.
result Delta is open and its connected components are parametrized by dimension and codimension. Gamma is a C^\infty submanifold characterized by dimensions and semi-Fredholm indices.

Characterizes smiles in delta satisfying specific conditions.

problem Characterizing no butterfly arbitrage smiles in delta.
method Using parametrization of the smile in delta, we characterize the set of smiles.
result Obtained a parametrization of the set via one real number and three positive functions.

Theoretical limits on verifying self-improving systems without risking unbounded utility.

problem Formalizing and proving the limits of safety verification for self-improving systems.
method Developed dual conditions and used Holder's inequality, NP counting method, and Lipschitz bounds to establish impossibility and ceiling results.
result A classifier-based safety gate cannot simultaneously permit unbounded beneficial self-modification and bounded cumulative risk.

Study delta invariant of minimal generic curves on rational surfaces.

problem Recover delta invariant of curve germs from surface singularity topology.
method Explicit formulae for minimal generic curves on rational surfaces, proving delta invariant values for quotient singularities.
result Explicit formulae and values for delta invariant of minimal generic curves on rational surfaces.

We derive variance-optimal hedging strategies for SABR and rough Bergomi models.

problem Finding efficient hedging strategies in lognormal SABR and rough Bergomi models.
method Analytic expressions for variance-optimal hedging strategies and mean-square hedging errors.
result The variance-optimal hedging strategy in SABR coincides with Delta adjustment.

This paper improves bounds on how many Delta-moves are needed to trivialize a link.

problem Counting the minimum number of Delta-moves to make a link homotopy trivial.
method Classification of link homotopy and extremal graph theory.
result Quadratic and cubic upper bounds on the homotopy trivializing numbers of links.

Partial differential equations with distributional sources---in particular, involving (derivatives of) delta distributions---have become increasingly ubiquitous in numerous areas of physics and applied mathematics. It is often of considerable interest to obtain numerical solutions for such equations, but any singular (…

2018-02-09abs ↗pdf ↗

Paper presents a machine learning-based method for efficiently pricing and hedging autocallable structured notes with multiple underlying assets.

problem Complex pricing and hedging of autocallable notes with multiple underlying assets.
method Machine learning-based pricing method and Distributional Reinforcement Learning (RL) for hedging.
result Significantly improved efficiency in pricing and hedging, with faster computation and better risk management.

The paper improves bounds on knot crossings and tabulates minimal diagrams.

problem Improving bounds on knot crossings and tabulating minimal diagrams.
method Analyzing triple-crossing and delta-crossing numbers, proving tangle existence, generating tables.
result Improved bounds on knot crossings and tabulated minimal diagrams for prime knots up to delta-crossing number 4.