Efficient method for high-dimensional American option pricing and hedging.
problem High-dimensional American option pricing and hedging.
method Gradient-enhanced sparse Hermite polynomial expansions combined with least squares Monte Carlo.
result Outperforms state-of-the-art methods in high dimensions with comparable computational cost.
Hermite polynomials improve private data generation by reducing feature count.
problem Infinite-dimensional features in kernel mean embedding are impractical for private data generation.
method Replace random features with Hermite polynomial features, leveraging their ordered nature.
result Hermite polynomial features yield a more accurate approximation of kernel mean embedding with fewer features.
Study proposes a method to construct copulas using corrected Hermite polynomial expansion for estimating foreign exchange volatility.
problem Estimating cross foreign exchange volatility with complex correlation structures.
method Applying corrections to the finite sum of multivariate Hermite polynomial expansions to construct copulas.
result The proposed copula method accurately reproduces the volatility smile of cross currency pairs.
In this paper we study both analytic and numerical solutions of option pricing equations using systems of orthogonal polynomials. Using a Galerkin-based method, we solve the parabolic partial diferential equation for the Black-Scholes model using Hermite polynomials and for the Heston model using Hermite and Laguerre p…
Derives a series expansion for Asian option pricing with polynomial jump-diffusion moments.
problem Pricing Asian options with polynomial jump-diffusion processes.
method Uses Hermite polynomials and moments of the underlying process for closed-form computation.
result Explicit computation of Greeks and accurate series expansion for Asian options.
New method uses Hermite polynomials for American option valuation.
problem Valuation of American options with complex jump-diffusion dynamics.
method Hermite polynomial expansions of transition density and early exercise premium.
result Converging approximations to true option prices and exercise boundaries.
The study approximates option prices using Hermite polynomials without assuming a specific distribution.
problem Approximating option prices without assuming a specific distribution of returns.
method Approximating the logarithmic return's density by a linear combination of rescaled Hermite polynomials.
result Empirical results suggest reasonable performance for options with moderate strike prices.
Rectified Linear Units (ReLUs) are among the most widely used activation function in a broad variety of tasks in vision. Recent theoretical results suggest that despite their excellent practical performance, in various cases, a substitution with basis expansions (e.g., polynomials) can yield significant benefits from b…
A method for classifying points with minimal queries using Hermite polynomials.
problem Classifying points from an unknown probability measure with minimal label queries.
method Convex combination of conditional probabilities, Hermite polynomial kernel for hierarchical support estimation.
result The method achieves high F-score for classification in hyper-spectral images and MNIST. New chaos formula simplifies variance calculation for Gaussian nodal volumes.
problem Analyzing the variance of Gaussian nodal volumes on Riemannian manifolds.
method Explicit Wiener-Itô chaos decomposition, reducing complexity from 2+2n to 4 Hermite polynomials. result New exact formula for variance and bounds, valid for arbitrary manifolds.
New algorithm learns PTFs with noisy data efficiently.
problem Learning low-degree PTFs with noisy data efficiently.
method Structural result and novel robust Chow vector estimation.
result PAC learns PTFs with nasty noise using efficient samples.
Polynomial time algorithm learns depth-2 neural networks with ReLU activations.
problem Learning depth-2 neural networks with non-zero bias terms and general ReLU activations.
method Robust tensor decomposition of Hermite expansions.
result Polynomial time and sample efficient learning of depth-2 networks with ReLU activations.
New method uses spherical harmonics to simplify learning single-index models.
problem Learning single-index models with unknown one-dimensional projections.
method Proposes using spherical harmonics instead of Hermite polynomials to capture rotational symmetry.
result Characterizes the complexity of learning single-index models under arbitrary spherically symmetric input distributions.
This paper extends the convergence rate of DEQs with ReLU to any general activation.
problem Proving global convergence rate for DEQs with general activations.
method Developed a novel population Gram matrix and new form of dual activation with Hermite polynomial expansion.
result Gradient descent converges to a globally optimal solution at a linear rate for DEQs with general activations.
Random Transformers behave like polynomial models in ICL with asymptotic growth.
problem Understanding in-context learning capabilities of pretrained Transformers.
method Asymptotic analysis of a random Transformer with a fixed first layer and a trained second layer, considering growth in context length, input dimension, hidden dimension, and training parameters.
result The random Transformer's ICL error is equivalent to a finite-degree Hermite polynomial model.
The paper models asset prices using Wiener chaos expansions for efficient calibration to implied volatility surfaces.
problem Calibrating to implied volatility surfaces using flexible martingale models.
method Constructing an over-parameterized martingale model based on Wiener chaos expansions and conditional expectations.
result The method enables fast calibration to implied volatility surfaces and demonstrates flexibility through numerical experiments.
Study how neural networks learn from non-Gaussian data models.
problem Understanding neural network learning dynamics with non-Gaussian data.
method Developed a two-layer neural network with Hermite polynomial activations to control high-order cumulants.
result Neural networks progressively learn high-order cumulants after capturing low-order statistics.
This work analyzes how different layers in deep neural networks contribute to generalization error.
problem Understanding the role of each layer in deep neural networks for generalization.
method Spectral analysis, Neural Tangent Kernel, Hermite polynomials, Spherical Harmonics.
result Initial layers in deep neural networks have a larger bias towards high-frequency functions.
We introduce Hermite fractional financial markets, where market uncertainties are described by multidimensional Hermite motions. Hermite markets include as particular cases financial markets driven by multivariate fractional Brownian motion and multivariate Rosenblatt motion. Conditions for no-arbitrage and market comp…
This paper presents a method for efficient density estimation in nonlinear systems.
problem Accurate representation of non-Gaussian distributions in nonlinear dynamical systems is challenging.
method Uses Seminonparametric (SNP) densities with probabilists' Hermite polynomial basis and Monte Carlo approximation for maximum likelihood estimation.
result Demonstrates that the method can accurately capture non-Gaussian density structure and compute quantiles using fewer samples than raw Monte Carlo.
New Hermite approximations accelerate convergence with adaptive coordinate transformations.
problem Accelerating convergence of spectral approximations for Hermite expansions.
method Using normalizing flows for adaptive coordinate transformations and deriving error estimates.
result Error estimates for Hermite expansions under adaptive coordinate transformations.
Classified spaces in low dimensions.
problem Irreducible homogeneous almost Hermite-Lorentz spaces in low dimensions.
method Classification through complex dimension 3.
result Classification of spaces in low dimensions.
Geometric equation defines canonical metrics on vector bundle families.
problem Finding canonical metrics on families of holomorphic vector bundles.
method Introducing a geometric partial differential equation for families of holomorphic vector bundles.
result Construction of Hermite--Einstein metrics in adiabatic classes on product manifolds and proof of the existence of a unique solution for the Dirichlet problem.
Study examines tangential real hypersurfaces on Hermite-like manifolds.
problem Characterizing real hypersurfaces on Hermite-like manifolds.
method Introduced tangential real hypersurfaces and derived main identities.
result Discussed contact metric structures in K-contact and cosymplectic cases.
Establishes Hermite-Einstein metrics on complex spaces with singularities.
problem Existence of Hermite-Einstein metrics on complex spaces with singularities.
method Established existence of estimable Hermite-Einstein metrics for stable reflexive coherent sheaves on compact normal Kähler spaces with klt singularities.
result Obtained precise results for varieties with klt singularities.
We analyze a generalized version of the Black-Scholes equation depending on a parameter a∈(−∞,0). It satisfies the martingale condition and coincides with the Black-Scholes equation in the limit case a↗0. We show that the generalized equation is exactly solvable in terms of Hermite polynomials a…
This paper studies symplectic critical surfaces in Hermite surfaces.
problem Generalizing results about Kähler angle to the general case.
method Focuses on symplectic critical surfaces in Hermite surfaces.
result Provides a definition of symplectic critical surfaces in Hermite surfaces.
We present a new framework for Hermite fractional financial markets, generalizing the fractional Brownian motion and fractional Rosenblatt markets. Considering pure and mixed Hermite markets, we introduce a strategy-specific arbitrage tax on the rate of transaction volume acceleration of the hedging portfolio as the pr…
Proves conditions for weighted Hermite-Einstein metrics on vector bundles.
problem Conditions for existence of weighted Hermite-Einstein metrics.
method Introduces weighted Hermite-Einstein equation, stability notions, and proves existence.
result Existence of weighted Hermite-Einstein metrics if and only if slope polystable.
Study efficient estimation of hidden subspaces in Gaussian Multi-index models.
problem Estimating hidden subspaces in Gaussian Multi-index models with low-dimensional projections.
method Introduced the generative leap exponent and developed an agnostic sequential estimation procedure using spectral U-statistics.
result Achieved optimal sample complexity of $n=Θ(d^{1 \vee \k/2})$ for efficient estimation.
Expressivity is one of the most significant issues in assessing neural networks. In this paper, we provide a quantitative analysis of the expressivity for the deep neural network (DNN) from its dynamic model, where the Hilbert space is employed to analyze the convergence and criticality. We study the feature mapping of…
The article completes the research of two-point G2 Hermite interpolation problem with spirals by inversion of conics. A simple algorithm is proposed to construct a family of 4th degree rational spirals, matching given G2 Hermite data. A possibility to reduce the degree to cubic is discussed.
In machine learning, we are given a dataset of the form {(xj,yj)}j=1M, drawn as i.i.d. samples from an unknown probability distribution μ; the marginal distribution for the xj's being μ∗. We propose that rather than using a positive kernel such as the Gaussian for estimation of these…
We give a classification, up to finite cover, of flat compact complete Hermite-Lorentz manifolds up to complex dimension 4.
Wide neural networks learn features under μP, identifying weights and decomposing support.
problem Feature learning in wide neural networks under μP. method Proving mean-field limit, characterizing identifiability, sparse-dictionary decomposition, and feature-learning-error decomposition.
result The triple (w∗,Dorb∗,S∗) identifies the natural learning cell of the architecture-data pair (σ,ρ). We define naturally Hermite-Lorentz metrics on almost-complex manifolds as special case of pseudo-Riemannian metrics compatible with the almost complex structure. We study their isometry groups.
New Hermite series estimator for Spearman rank correlation in non-stationary data.
problem Estimating time-varying Spearman rank correlation efficiently.
method Hermite series based sequential estimator for both stationary and non-stationary settings.
result Competitive performance compared to existing algorithms in simulations and real data.
The paper studies how neural networks evolve representations, finding a unique fixed point for nonlinear activations.
problem Understanding how neural networks transform input data across layers.
method Theoretical framework for the evolution of the kernel sequence, using mean-field regime and Hermite polynomials.
result For nonlinear activations, the kernel sequence converges globally to a unique fixed point.
Study compares parametric and Hermite-based models for option pricing.
problem Empirical performance of option price estimators.
method Examines parametric and nonparametric models, focusing on variance-gamma and Heston models.
result Hermite-based models can outperform Heston model in pricing errors.
Sequential quantile estimation refers to incorporating observations into quantile estimates in an incremental fashion thus furnishing an online estimate of one or more quantiles at any given point in time. Sequential quantile estimation is also known as online quantile estimation. This area is relevant to the analysis …
Theoretical models applied to option pricing should take into account the empirical characteristics of the underlying financial time series. In this paper, we show how to price basket options when assets follow a shifted log-normal process with jumps capable of accommodating negative skewness. Our technique is based on…
RFMs transition from linear to nonlinear under specific input-label correlation.
problem Understanding the transition from linear to nonlinear behavior in RFMs.
method Analyzing RFMs under spiked covariance designs, characterizing the interaction between anisotropy and input-label correlation.
result The RFM generalization error is governed by the strength of input-label correlation, leading to a clear nonlinear advantage above a specific boundary.
This research solves Hermite interpolation on manifolds using retractions.
problem Interpolating data on non-Euclidean spaces with matching derivatives.
method Proposes a novel procedure using retractions for Hermite interpolation on various manifolds.
result Establishes the well-posedness of the method and extends Hermite interpolation results to manifolds.
Study extends convexity in curved spaces using fractional integrals.
problem Extending convexity to curved spaces with nonpositive curvature.
method Introducing (geodesically) h-convex functions and using Katugampola's fractional integrals. result Essentially sharp estimate involving squared distance mappings.
Existence of metrics on non-Kähler varieties, generalizing previous work.
problem Existence of metrics on non-Kähler varieties.
method Definition of slope stability and existence of singular Hermite-Einstein metrics.
result Existence and uniqueness of singular Hermite-Einstein metrics for slope-stable sheaves.
Extends classical stability results to new geometric settings.
problem Stability of holomorphic vector bundles on complex manifolds.
method Introduces (ω,Ω)-Hermite-Einstein and (ω,Ω)-stable conditions. result Generalised Hermite-Einstein condition implies (ω,Ω)-semi-stability. The paper provides an almost optimal learning and testing algorithm for sparse polynomials.
problem Learning and testing sparse multivariate polynomials efficiently.
method The paper presents an algorithm with sublinear query complexity in 1/ε and almost linear in s for learning and testing s-sparse polynomials. result The algorithm achieves almost optimal query complexity, making it the first of its kind.
Two methods for interpolating manifold-valued data are presented.
problem Interpolating manifold-valued functions with derivative constraints.
method Two approaches: weighted Riemannian barycenters and tangent space interpolation.
result Both methods are valid and perform well with numerical examples.