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

10192938 · May 202619922001200920172026
48 results for Taylor Expansion

Paper proposes a new Taylor moment expansion for non-linear Gaussian filtering and smoothing.

problem Non-linear Gaussian filtering and smoothing in continuous-discrete state-space models.
method Taylor moment expansion (TME) for moment functions directly and in time variable.
result Significantly outperforms state-of-the-art methods in terms of estimation accuracy and numerical stability.

New approximations for Asian basket spread options using stochastic Taylor expansions.

problem Pricing Asian basket spread options under the Black-Scholes model.
method Stochastic Taylor expansion applied to a log-normal proxy model.
result Highly accurate approximations for Asian and spread options, without numerical integration.

TaylorPODA uses Taylor expansions to improve feature attributions for opaque models.

problem Lack of systematic framework for quantifying feature contributions in opaque models.
method Taylor expansion framework with postulates (precision, federation, zero-discrepancy, adaptation).
result TaylorPODA achieves competitive results and provides principled explanations.

In this work we consider the Taylor expansion of the exponential map of a submanifold immersed in R^n up to order three, in order to introduce the concepts of lateral and frontal deviation. We compute the directions of extreme lateral and frontal deviation for surfaces in R^3. Also we compute, by using the Taylor expan…

2012-10-22abs ↗pdf ↗

Taylorized training improves neural network training at finite width.

problem Understanding and improving neural network training at finite width.
method Training the k-th order Taylor expansion of the neural network at initialization.
result Taylorized training agrees with full neural network training better as k increases and can significantly close the performance gap.

The paper calculates Bachelier option prices using Taylor expansions and applies it as a variance reduction technique.

problem Calculating Bachelier option prices and variance reduction in correlated cases.
method Taylor expansions and classical Itô calculus to derive option prices, uses negative powers of future mean volatility.
result The paper provides a new method to calculate Bachelier option prices and applies it to reduce variance in Monte Carlo simulations.

Paper develops formulas for shape derivatives in wave scattering.

problem Computing high order shape derivatives for wave scattering is challenging.
method Introduces elegant recurrence formulas using differential forms and Lie derivatives.
result Unified framework for computing high order shape perturbations in scattering problems.

Develops AMITE for analyzing neural network nonlinearities.

problem Addressing difficulties in verification, explainability, and security in neural network analysis.
method Analytically modified integral transform expansion (AMITE) for neural network nonlinearities.
result First to provide six mutually exclusive desired expansion properties.

In this paper we propose a closed-form approximation for the price of basket options under a multivariate Black-Scholes model, based on Taylor expansions and the calculation of mixed exponential-power moments of a Gaussian distribution. Our numerical results show that a second order expansion provides accurate prices o…

2014-04-11abs ↗pdf ↗

9We consider complex structures with totally real zero section of the tangent bundle. We assume that the complex structure tensor is real-analytic along the fibers of the tangent bundle. This assumption is quite natural in view of a well known existence result by Bruhat and Whitney. We provide explicit integrability eq…

2019-04-19abs ↗pdf ↗

This work explores functional expansions to handle path dependence in various fields.

problem Path dependence and infinite-dimensional problems in non-Markovian systems.
method Generalizes Wiener series and functional Taylor expansion to handle static and dynamic functionals.
result Elegant separation of functionals from future trajectories in dynamic cases.

Iterative tilting fine-tunes diffusion models for reward-tilted distributions.

problem Fine-tuning diffusion models for reward-tilted distributions.
method Decomposes large reward tilts into smaller, tractable tilts via first-order Taylor expansion, avoiding backpropagation.
result Validated on a two-dimensional Gaussian mixture, achieving exact closed-form solutions.

By analyzing the affine Taylor expansion of a non-degenerate plane curve, we obtain characterizations of classes of such curves via curvature properties of the gravity curve. The proof is based on an analysis of the degree parity and leading coefficients of polynomials occurring in the expansion.

2011-10-29abs ↗pdf ↗

Approximates option prices in Barndorff-Nielsen and Shephard models using Taylor expansion.

problem Approximating option prices in complex stochastic volatility models.
method Taylor expansion and recursive algorithm for closed-form approximations.
result Explicit results for inverse Gaussian and gamma stationary distributions, with favorable comparisons to characteristic function.

Study on Einstein deformations of negative Kähler Einstein metrics.

problem Understanding Einstein deformations of Kähler Einstein metrics.
method Relate second order Einstein deformation theory to complex geometry, gauge normalise, and use Taylor expansion.
result Taylor expansion to order two of an Einstein deformation is determined by h12h_1^2 and the divergence of the Kodaira-Spencer bracket.

Paper proposes a closed-form formula for geometric Istanbul call options.

problem Pricing geometric Istanbul call options under the Black-Scholes model.
method Second-order Taylor expansion to derive a closed-form approximation.
result The proposed formula accurately approximates GIC values compared to Monte-Carlo simulations.

New formulas for pricing Asian and basket options using stochastic expansion.

problem Pricing Asian and basket options under time-dependent parameters.
method Stochastic Taylor expansion around a log-normal proxy model.
result Highly accurate approximations for Asian options and vanilla options with discrete dividends.

Derives functional Itô formula for non-anticipative maps of rough paths.

problem Functional Itô formula for non-anticipative maps of càdlàg rough paths.
method Approximation properties of the signature and Marcus transformation.
result Functional Taylor expansion for sufficiently regular non-anticipative maps.

TEAM generates more powerful adversarial examples for DNNs.

problem Vulnerability of DNNs to imperceptible adversarial examples.
method TEAM uses Taylor expansion and Lagrangian multiplier method to craft adversarial examples.
result TEAM generates adversarial examples with 100% attack success rate using smaller perturbations.

We consider a financial market with liquidity cost as in Çetin, Jarrow and Protter [2004], where the supply function Sε(s,ν)S^ε(s,ν) depends on a parameter ε0ε\geq 0 with S0(s,ν)=sS^0(s,ν)=s corresponding to the perfect liquid situation. Using the PDE characterization of Çetin, Soner and Touzi [2010] of the super-hedging cost of a…

2012-08-18abs ↗pdf ↗

Unified bounds for neural networks incorporating physical laws.

problem Limitations in existing generalization analyses for PINNs and VPINNs.
method Unified framework using Taylor expansion and Koopman-based analysis.
result High-rank networks can generalize well even with differential operators.

Diffeomorphism freedom induces a gauge dependence in the theory of spacetime perturbations. We derive a compact formula for gauge transformations of perturbations of arbitrary order. To this end, we develop the theory of Taylor expansions for one-parameter families (not necessarily groups) of diffeomorphisms. First, we…

1997-08-28abs ↗pdf ↗

SOAR improves deep networks' robustness against adversarial examples.

problem Improving deep neural networks' robustness against adversarial examples.
method Formulated adversarial robustness problem under robust optimization framework, approximated loss function using second-order Taylor series expansion.
result SOAR significantly improves robustness of networks against adversarial perturbations.

We consider the wave equation on a product cone and find a joint asymptotic expansion for solutions near null and future infinities. The rates of decay seen in the expansion at future infinity are the resonances of a hyperbolic cone and were computed by the authors in a previous paper. The expansion treats an asymptoti…

2019-06-11abs ↗pdf ↗

Neural networks learn higher-order derivatives for physics problems.

problem Lack of higher-order derivatives in neural networks for theoretical physics.
method Graph-theoretical approach to assign diagrams to partial derivatives, iterative NN perturbation theory.
result NNs can learn higher-order derivatives, improving machine-learned approximations.

CO2 algorithm creates coresets for generic smooth divergences efficiently.

problem Efficiently creating coresets for generic smooth divergences.
method CO2 algorithm using functional Taylor expansion and maximum mean discrepancy minimization.
result Poly-logarithmically many data points suffice for Sinkhorn divergence approximation.

A new method reduces variance in training discrete latent variable models.

problem High variance in stochastic gradient estimators for discrete latent variable models.
method Double control variates for score function estimators using Taylor expansions.
result Our method can have lower variance compared to other estimators.

Deep ReLU networks can approximate smooth functions nearly optimally.

problem Approximating smooth functions with deep neural networks.
method Using Taylor expansions and deep ReLU network approximations, the paper establishes optimal approximation error bounds.
result Deep ReLU networks of width and depth O(NlnN)\mathcal{O}(N\ln N) and O(LlnL)\mathcal{O}(L\ln L) can approximate fCs([0,1]d)f\in C^s([0,1]^d) with an error O(fCs([0,1]d)N2s/dL2s/d)\mathcal{O}(\|f\|_{C^s([0,1]^d)}N^{-2s/d}L^{-2s/d}).