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

316192122 · Jun 202019922001200920172026
48 results for Taylor series

The Adomian decomposition method is shown to be equivalent to the Taylor series approach.

problem Incorrectly perceived complexity of the Adomian decomposition method.
method Demonstrates the Adomian decomposition method as equivalent to the Taylor series approach.
result The Adomian decomposition method is simpler and more straightforward.

In this paper we study the Taylor series of an operator-valued function related to the differential of the exponential map. For a smooth manifold M\mathcal{M} with a torsion-free affine connection the operator Ep(v)\mathcal{E}_p(v) acting on the space TpMT_p\mathcal{M} is defined to be the composition of the differential …

2012-05-13abs ↗pdf ↗

Using classical Taylor series techniques, we develop a unified approach to pricing and implied volatility for European-style options in a general local-stochastic volatility setting. Our price approximations require only a normal CDF and our implied volatility approximations are fully explicit (ie, they require no spec…

2013-08-22abs ↗pdf ↗

Let M and N be smooth manifolds. For an open V of M let emb(V,N) be the space of embeddings from V to N. By results of Goodwillie and Goodwillie-Klein, the cofunctor V |--> emb(V,N) is analytic if dim(N)-dim(M) > 2. We deduce that its Taylor series converges to it. For details about the Taylor series, see Part I.

1999-05-28abs ↗pdf ↗

Let M and N be smooth manifolds without boundary. Immersion theory suggests that an understanding of the space of smooth embeddings emb(M,N) should come from an analysis of the cofunctor V |--> emb(V,N) from the poset O of open subsets of M to spaces. We therefore abstract some of the properties of this cofunctor, and …

1999-05-28abs ↗pdf ↗

In every point of a Kähler manifold there exist special holomorphic coordinates well adapted to the underlying geometry. Comparing these Kähler normal coordinates with the Riemannian normal coordinates defined via the exponential map we prove that their difference is a universal power series in the curvature tensor and…

2017-07-20abs ↗pdf ↗

This paper extends AD techniques to Monte Carlo processes for efficient derivative calculation.

problem Obtaining derivatives of expectation values in Monte Carlo processes.
method Two approaches: reweighting and Hamiltonian extension of HMC.
result Hamiltonian approach as a change of variables simplifies variance reduction.

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 study differential forms and their higher-order generalizations by interpreting them as functions on map spaces. We get a series of approximations of "generalized manifolds" (i.e. of sheaves and stacks) somewhat akin to Taylor series.

2006-06-26abs ↗pdf ↗

This paper provides intuition on the relationship of accrual and mark-to-market valuation for cash and forward interest rate trades. Discounted cashflow valuation is compared to spread-based valuation for forward trades, which explains the trader's view on valuation. This is followed by Taylor series approximation for …

2016-02-18abs ↗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.

Unified framework for imputation and prediction in healthcare time series.

problem Time misalignment and data sparsity in healthcare time series.
method MAGIC (Multi-tAsk Gaussian Process for Imputation and Classification) using hierarchical multi-task Gaussian process and functional logistic regression.
result Superior predictive accuracy compared to existing methods in two healthcare applications.

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.

Kernelized Taylor diagram visualizes data populations with fewer assumptions.

problem Limitations of Taylor diagram in capturing non-linear relationships and sensitivity to outliers.
method Proposes a kernelized version of the Taylor diagram that uses maximum mean discrepancy and kernel mean embedding.
result Kernelized Taylor diagram visualizes data populations with minimal assumptions of data distributions.

Ever since the proof of asymptotic normality of maximum likelihood estimator by Cramer (1946), it has been understood that a basic technique of the Taylor series expansion suffices for asymptotics of MM-estimators with smooth/differentiable loss function. Although the Taylor series expansion is a purely deterministic …

2018-09-13abs ↗pdf ↗

Paper extracts features from time series to improve forecasting accuracy.

problem Forecasting time series generated by Itô-type processes with unknown coefficients.
method Statistical adjustment of mixture-type models to extract features from time series data.
result Additional statistical features enhance time series prediction accuracy.

Improved Frank-Wolfe method reduces dependence on data size for empirical risk minimization.

problem Reducing dependence on number of data observations in Frank-Wolfe methods.
method Taylor-series approximated gradients applied to Frank-Wolfe method.
result Significant speed-ups over existing methods on real-world datasets.

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.

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.

We study inverse scattering for Δg+VΔ_g+V on (X,g)(X,g) a conformally compact manifold with metric g,g, with variable sectional curvature $-\alf^2(y)$ at the boundary and VC(X)V\in C^\infty(X) not vanishing at the boundary. We prove that the scattering matrix at a fixed energies (λ1,(λ_1, λ2)λ_2) in a suitable subset of $\mc$, de…

2008-03-09abs ↗pdf ↗

Study finds Deep Taylor Decomposition is unreliable for explaining neural networks.

problem Reliability of Deep Taylor Decomposition for explaining neural networks.
method Investigated the theoretical foundations of Deep Taylor Decomposition (DTD) and found it under-constrained.
result DTD is unreliable because its theoretical foundations are under-constrained and roots do not align with input.

The first aperiodic monotiling, introduced by Taylor, was based on a trapezoidal prototile equipped with 14 distinct decorations. A presentation of the closely related Taylor-Socolar aperiodic monotiling is based on a hexagonal prototile equipped with 7 decorations. This paper gives decoration-free algebraic descriptio…

2015-04-26abs ↗pdf ↗

Proposes a Taylor framework to unify and analyze attribution methods.

problem Lack of a unified guideline for feature contribution assignment in machine learning models.
method Introduces a Taylor attribution framework to model the attribution problem and reformulates fourteen mainstream methods.
result Empirically validates the Taylor reformulations and reveals a positive correlation between performance and principles followed.

DDD reformulated for sparse matrices, integrating trajectory and snapshot time series data.

problem Efficiently integrate trajectory and snapshot time series data.
method Reformulate DDD to use compact basis functions, reducing parameter scaling.
result Inference of sparse matrices reduces the number of parameters in DDD.

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.

Develops noncommutative Cowen-Douglas theory for noncommuting operators.

problem Exploring noncommutative analogues of classical Cowen-Douglas theory.
method Defining noncommutative Cowen-Douglas class using matricial joint eigenvalues and showing equivalence classes are determined by associated noncommutative vector bundles.
result Unitary equivalence class of a tuple in the noncommutative Cowen-Douglas class is determined by the equivalence class of its associated noncommutative vector bundle.