The Plancherel theorem for Fourier--Laplace--Nahm transform for connections on the projective linemath.DG
We prove that the Fourier--Laplace--Nahm transform for connections on the projective line is a hyper-Kähler isometry.
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,657 papers · 148 categories
Trend · papers per month
48 results for “Fourier-Laplace transforms”
The paper studies Fourier-Laplace transforms in polynomial OU volatility models for option pricing.
problem Calibrating and pricing options in polynomial Ornstein-Uhlenbeck volatility models.
method Analyzes Fourier-Laplace transforms, connects to Riccati equations, and develops numerical schemes.
result Establishes existence and solution for Riccati equations and provides efficient numerical methods.
Extend classical theory of affine processes to path-dependent setting
problem Path-dependent affine processes
method Introduce path-dependent coefficients and provide analytic formulas for their Fourier--Laplace transform
result Define path-dependent affine processes through their exponential-affine Fourier--Laplace transform and establish a characterization theorem
Derives an index formula for families of end-periodic Dirac operators.
problem Calculating the index of families of end-periodic Dirac operators.
method Using the renormalized Chern character and Fourier-Laplace transform of the Bismut superconnection.
result Establishes an index formula involving a new end-periodic eta form.
The Volterra Heston model is used to price American options.
problem Pricing American options in the Volterra Heston model.
method Kernel-based approximations and simulation techniques.
result Convergence of American option prices in approximating models to the Volterra Heston model.
New SDEs from affine and polynomial perspectives for path-dependent processes.
problem Characterizing path-dependent stochastic processes.
method Affine and polynomial processes, signature SDEs, Fourier-Laplace transform, Riccati and linear ODEs.
result Explicit formulas for the Fourier-Laplace transform and expected values of entire functions of signature processes.
The square root of Fredholm determinants causes numerical instabilities in option pricing models.
problem Numerical instabilities in Fourier-based option pricing for the Volterra Stein-Stein model.
method Characterization of determinant crossing behavior, derivation of transform to handle crossings, efficient algorithms.
result Significant improvement in accuracy and reduction in computational cost for Fourier-based pricing.
We study tt*-geometry on the classifying space for regular singular TERP-structures, e.g., Fourier-Laplace transformations of Brieskorn lattices of isolated hypersurface singularities. We show that (a part of) this classifying space can be canonically equipped with a hermitian structure. We derive an estimate for the h…
We provide a new proof for regularity of affine processes on general state spaces by methods from the theory of Markovian semimartingales. On the way to this result we also show that the definition of an affine process, namely as stochastically continuous time-homogeneous Markov process with exponential affine Fourier-…
Efficient inverse -transform and pricing barrier and lookback options with discrete monitoringmath.NA
The paper derives formulas for option pricing and random walk expectations.
problem Calculating the price of barrier and lookback options.
method Inverse Z-transform, Fourier/Laplace inversion, Wiener-Hopf factorization, and numerical methods.
result Efficient numerical methods for option pricing are developed.
In equity and foreign exchange markets the risk-neutral dynamics of the underlying asset are commonly represented by stochastic volatility models with jumps. In this paper we consider a dense subclass of such models and develop analytically tractable formulae for the prices of a range of first-generation exotic derivat…
We provide existence, uniqueness and stability results for affine stochastic Volterra equations with -kernels and jumps. Such equations arise as scaling limits of branching processes in population genetics and self-exciting Hawkes processes in mathematical finance. The strategy we adopt for the existence part is b…
Fluctuation identities with continuous monitoring and their application to price barrier optionsq-fin.CP
We present a numerical scheme to calculate fluctuation identities for exponential Lévy processes in the continuous monitoring case. This includes the Spitzer identities for touching a single upper or lower barrier, and the more difficult case of the two-barriers exit problem. These identities are given in the Fourier-L…
Using the interpretation of certain generalised Donaldson-Thomas invariants, including stable pairs curve counts, as the monodromy of a flat connection on a formal principal bundle, we show that the conjectural Gopakumar-Vafa contributions of all genera to the Gromov-Witten partition function appear in the asymptotics …
Consistent Pricing of VIX and Equity Derivatives with the 4/2 Stochastic Volatility Plus Jumps Modelq-fin.CP
In this paper, we develop a 4/2 stochastic volatility plus jumps model, namely, a new stochastic volatility model including the Heston model and 3/2 model as special cases. Our model is highly tractable by applying the Lie symmetries theory for PDEs, which means that the pricing procedure can be performed efficiently. …
Model captures rough volatility and jump clustering in stock vol dynamics.
problem Capturing the joint evolution of S&P 500 and VIX implied vol smiles.
method Rough Hawkes Heston model with affine Volterra dynamics, power kernel, and exponential jump law.
result Model accurately captures S&P 500 and VIX implied vol smiles with low power kernel.
We consider the pricing of derivatives written on the discretely sampled realized variance of an underlying security. In the literature, the realized variance is usually approximated by its continuous-time limit, the quadratic variation of the underlying log-price. Here, we characterize the small-time limits of options…
Study extends geodesic ray transform results to orientable surfaces.
problem Characterize and stabilize mixed and transverse ray transforms on surfaces.
method Algebraic arguments applied to various geometries and ray transforms.
result Characterization of kernel and stability for mixed and transverse ray transforms on orientable surfaces.
We analyze Darboux transformations in very general settings for multidimensional linear partial differential operators. We consider all known types of Darboux transformations, and present a new type. We obtain a full classification of all operators that admit Wronskian type Darboux transformations of first order and a …
Introduces pseudo-codecomposition of transformation groups.
problem Understanding and categorizing transformation groups.
method Introduces pseudo-codecomposition and analyzes properties of transformation groups.
result The class of pseudo-codecomposable transformation groups is a proper intermediate class.
This paper investigates efficient Transformers and finds they scale with problem size.
problem Finding suitable replacements for standard Transformers in large-scale tasks.
method Modeling efficient Transformers (Sparse and Linear) as Dynamic Programming problems and analyzing their reasoning capabilities.
result Efficient Transformers scale with problem size, but can be more efficient for certain DP problems.
The conformal geometry of spacelike surfaces in 4-dimensional Lorentzian space forms has been studied by the authors in a previous paper, where the so-called polar transform was introduced. Here it is shown that this transform preserves spacelike conformal isothermic surfaces. We relate this new transform with the know…
Learning Generalized Transformation Equivariant Representations via Autoencoding Transformationscs.CV
Transformation Equivariant Representations (TERs) aim to capture the intrinsic visual structures that equivary to various transformations by expanding the notion of {\em translation} equivariance underlying the success of Convolutional Neural Networks (CNNs). For this purpose, we present both deterministic AutoEncoding…
Data is said to follow the transform (or analysis) sparsity model if it becomes sparse when acted on by a linear operator called a sparsifying transform. Several algorithms have been designed to learn such a transform directly from data, and data-adaptive sparsifying transforms have demonstrated excellent performance i…
Transforms classical connections using pushforwards and gauge transformations.
problem Transforming classical connections in categorical settings.
method Constructing pushforwards and applying gauge transformations to decorated path spaces.
result Combines traditional gauge transformation with affine translation.
Transformers interpret as probabilistic mixtures, offering new insights.
problem Understanding Transformers from a probabilistic perspective.
method Modeling Transformers as mixtures of Gaussian models.
result Transformers can be seen as maximum posterior probability estimators.
Study normal operators of double fibration transforms with conjugate points.
problem Normal operators of double fibration transforms with conjugate points.
method Stable conditions on the distribution of conjugate points, splitting into elliptic and Fourier integral operators.
result Normal operator splits into an elliptic pseudodifferential operator and Fourier integral operators.
Transformer-MGK replaces redundant heads with Gaussian key mixtures, improving efficiency and performance.
problem Redundant attention heads in transformers degrade performance and efficiency.
method Transformer-MGK replaces redundant heads with a mixture of Gaussian keys.
result Transformer-MGK accelerates training and inference, reduces parameters and FLOPs, and achieves comparable or better accuracy.
B-cos transformers explain Vision Transformers' decisions.
problem Lack of holistic explanations for transformer outputs.
method Formulate each component as dynamic linear, allowing a single linear transform for summarization.
result Bcos-ViTs are highly interpretable and competitive on ImageNet.
A Power Transformcs.LG
Novel power transform unifies various mathematical functions.
problem Normalizing and standardizing datasets.
method Presented a novel power transform.
result Unified various mathematical functions.
Algorithm finds optimal affine transformation to minimize overall distortion.
problem Minimizing distortion in affine transformations.
method Riemannian geometry approach to define and minimize distortion.
result Mean distorting transformation found for minimizing overall distortion.
XR-Transformer accelerates XMC by recursively fine-tuning on multi-resolution objectives.
problem Efficiently classifying texts with large label sets.
method Recursive multi-resolution fine-tuning of transformers.
result XR-Transformer achieves 20x faster training time and 54% Precision@1 on Amazon-3M.
We study the dynamics of the discrete bicycle (Darboux, Backlund) transformation of polygons in n-dimensional Euclidean space. This transformation is a discretization of the continuous bicycle transformation, recently studied by Foote, Levi, and Tabachnikov. We prove that the respective monodromy is a Moebius transform…
Data augmentation (DA) is fundamental against overfitting in large convolutional neural networks, especially with a limited training dataset. In images, DA is usually based on heuristic transformations, like geometric or color transformations. Instead of using predefined transformations, our work learns data augmentati…
We propose a new class of transforms that we call {\it Lehmer Transform} which is motivated by the {\it Lehmer mean function}. The proposed {\it Lehmer transform} decomposes a function of a sample into their constituting statistical moments. Theoretical properties of the proposed transform are presented. This transform…
Transformers struggle to approximate smooth functions, relying on piecewise constant approximations.
problem Understanding the expressivity of Transformers for function approximation.
method Theoretical analysis and experimental validation of Transformer's ability to approximate smooth functions.
result Transformers cannot reliably approximate smooth functions, relying on piecewise constant approximations.
The Weyl transform is introduced as a rich framework for data representation. Transform coefficients are connected to the Walsh-Hadamard transform of multiscale autocorrelations, and different forms of dyadic periodicity in a signal are shown to appear as different features in its Weyl coefficients. The Weyl transform …
We define a transformation on harmonic maps from a Riemann surface into the 2-sphere which depends on a complex parameter, the so-called mu-Darboux transformation. In the case when the harmonic map N is the Gauss map of a constant mean curvature surface f and the parameter is real, the mu-Darboux transformation of -N i…
In this paper, we study robust tensor completion by using transformed tensor singular value decomposition (SVD), which employs unitary transform matrices instead of discrete Fourier transform matrix that is used in the traditional tensor SVD. The main motivation is that a lower tubal rank tensor can be obtained by usin…
One of the most challenging problems in the domain of 2-D image or 3-D shape is to handle the non-rigid deformation. From the perspective of transformation groups, the conformal transformation is a key part of the diffeomorphism. According to the Liouville Theorem, an important part of the conformal transformation is t…
Geometric characterization and classification of Bäcklund transformations of sine-Gordon typemath.DG
We begin by considering several properties commonly (but not universally) possessed by Bäcklund transformations between hyperbolic Monge-Ampère equations: wavelike nature of the underlying equations, preservation of independent variables, quasilinearity of the transformation, and autonomy of the transformation. We show…
Geometric approach uses Bäcklund transformations to create integrable discrete analogs of surface nets.
problem Creating integrable discrete analogs of surface nets and conjugate nets.
method Interpreting classical differential geometry results through Bäcklund transformations and applying permutability properties.
result Integrable discrete analogs of asymptotic and conjugate nets are constructed.
New geometric transformations link discrete and continuous curve motions.
problem Establishing a connection between discrete and continuous curve motions.
method Infinitesimal Darboux transformations of smooth curves.
result Alternate geometric interpretation for semi-discrete mKdV equation.
SPTN uses invertible transformations to improve sum-product networks.
problem Improving inference efficiency and tractability in sum-product networks.
method Integrates invertible transformations into sum-product networks (SPNs).
result SPTNs with Gaussian leaves and affine transformations are as tractable as SPNs.
FEDformer combines Transformer with seasonal-trend decomposition for efficient long-term forecasting.
problem Transformer's inefficiency and inability to capture global time series views.
method Combines seasonal-trend decomposition with Transformer, exploiting Fourier basis for frequency enhancement.
result Reduces prediction error by 14.8% and 22.6% for multivariate and univariate time series, respectively.
One-layer transformers can't solve induction heads task efficiently.
problem Solving the induction heads task efficiently with one-layer transformers.
method Communication complexity argument showing exponential size requirement.
result No one-layer transformer can solve the induction heads task efficiently.
BoostTransformer uses boosting to improve transformer efficiency and accuracy.
problem Heavy computational resources and hyperparameter tuning in transformer architectures.
method Augments transformers with boosting principles through subgrid token selection and importance-weighted sampling, incorporating a least square boosting objective directly into the pipeline.
result BoostTransformer demonstrates faster convergence and higher accuracy compared to standard transformers.
We study an analogue of the classical Bianchi-Darboux transformation for L-isothermic surfaces in Laguerre geometry, the Bianchi-Darboux transformation. We show how to construct the Bianchi-Darboux transforms of an L-isothermic surface by solving an integrable linear differential system. We then establish a permutabili…