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

3978116155 · Jun 202019922001200920172026
48 results for second-order Taylor series

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.

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.

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.

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.

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 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 ↗

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.

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.

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 ↗

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.

Efficient method classifies locally stationary time series based on second-order characteristics.

problem Classifying locally stationary time series for various applications.
method Autoregressive approximation, ensemble aggregation, distance-based threshold.
result Zero misclassification error rate asymptotically for mildly differing second-order characteristics.

Agents learn state ambiguity from non-linear sensor data using Gaussian approximations.

problem Learning state representation from non-linear sensor data.
method Second-order Taylor approximation of Gaussian distribution for non-linear measurement functions.
result Induces a preference for states based on inferability from observations.

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 ↗

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.

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.

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.

In many compressive sensing problems today, the relationship between the measurements and the unknowns could be nonlinear. Traditional treatment of such nonlinear relationships have been to approximate the nonlinearity via a linear model and the subsequent un-modeled dynamics as noise. The ability to more accurately ch…

2013-01-29abs ↗pdf ↗

Structural pruning of neural network parameters reduces computation, energy, and memory transfer costs during inference. We propose a novel method that estimates the contribution of a neuron (filter) to the final loss and iteratively removes those with smaller scores. We describe two variations of our method using the …

2019-06-25abs ↗pdf ↗

Paper proposes a new method for efficient second-order neural network training.

problem Infeasibility of Hessian calculation and noisy second-order information in deep learning.
method Adopting complex-step directional derivative (CSFD) for accurate Hessian computation and designing an effective Newton Krylov procedure.
result Our method outperforms existing methods and often converges one-order faster.

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.

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.