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,657 papers · 148 categories

Trend · papers per month

51102153204 · Jun 202019922001200920172026
48 results for spherical Fourier transform

Study spherical Fourier transform on hypergeometric type harmonic manifolds.

problem Spherical Fourier transform on harmonic Hadamard manifolds.
method Representation of spherical functions by Gauss hypergeometric functions.
result Inversion formula, convolution rule, and Plancherel theorem are derived.

Injectivity of geodesic ray transform on specific Finsler manifolds proven.

problem Injectivity of geodesic ray transform on spherically symmetric reversible Finsler manifolds.
method Reduction to invertibility of generalized Abel transforms using angular Fourier series and Taylor expansions of geodesics.
result Injectivity of geodesic ray transform proven on specified Finsler manifolds.

Solves wave equation on non-flat harmonic manifolds using Abel transform and Fourier analysis.

problem Wave equation on non-flat harmonic manifolds with specific curvature conditions.
method Explicit representation using inverse dual Abel transform and Fourier transform.
result Shows asymptotic Huygens principle and equidistribution of energy.

In earlier papers, we introduced spherical T-duality, which relates pairs of the form (P,H)(P,H) consisting of an oriented S3S^3-bundle PMP\rightarrow M and a 7-cocycle HH on PP called the 7-flux. Intuitively, the spherical T-dual is another such pair (P^,H^)(\hat P, \hat H) and spherical T-duality exchanges the 7-flux with …

2015-02-16abs ↗pdf ↗

Convolutional Neural Networks (CNNs) have become the method of choice for learning problems involving 2D planar images. However, a number of problems of recent interest have created a demand for models that can analyze spherical images. Examples include omnidirectional vision for drones, robots, and autonomous cars, mo…

2018-01-30abs ↗pdf ↗

The paper derives and proves the Helgason Fourier transform for vector bundle-valued differential forms on homogeneous spaces.

problem Deriving the Helgason Fourier transform for vector bundle-valued differential forms on homogeneous spaces.
method Employing the perspective of the functional equation satisfied by the classical Fourier transform, the paper derives the Helgason Fourier transform map and proves its properties.
result The Fourier transform is explicitly given and proven to be a map from vector bundle-valued differential forms to another vector bundle-valued differential form on the product space.

Study integral kernels on complex symmetric spaces and their Dyson Brownian Motion applications.

problem Analysis of integral kernels on complex symmetric spaces.
method Simple new method of alternating sum formulas to construct WW-invariant kernels and their asymptotic behavior.
result Obtained asymptotic behavior of integral kernels and applied to Dyson Brownian Motion.

We prove new kinematic formulas for tensor valuations and simplify previously known Crofton formulas by using the recently developed algebraic theory of translation invariant valuations. The heart of the paper is the computation of the Alesker-Fourier transform on the large class of spherical valuations, which is achie…

2014-02-12abs ↗pdf ↗

New algorithm for estimating multivariate quantiles using stochastic optimal transport.

problem Estimating multivariate quantiles from data.
method Stochastic algorithm for entropic optimal transport in Banach spaces, using Fourier coefficients.
result Almost sure convergence of the stochastic algorithm in infinite-dimensional Banach spaces.

Developed a diffusion model on spherical data, addressing geometric and stochastic challenges.

problem Diffusion models on spherical data face unique geometric and stochastic issues.
method Extended spectral diffusion to spherical harmonics, introducing modified stochastic differential equations.
result Introduced a geometry-dependent inductive bias in spectral diffusion models.

New Fourier features improve high-precision approximation in large-scale problems.

problem Designing scalable, high-precision Fourier features for large-scale kernel methods.
method Introducing a new family of quadrature rules that accurately approximate the Gaussian measure in higher dimensions.
result Improved approximation bounds with new Fourier features.

Fourier PCA is Principal Component Analysis of a matrix obtained from higher order derivatives of the logarithm of the Fourier transform of a distribution.We make this method algorithmic by developing a tensor decomposition method for a pair of tensors sharing the same vectors in rank-11 decompositions. Our main appli…

2013-06-25abs ↗pdf ↗

Paper proves Fourier transform for valuations, simplifying previous work.

problem Existence of isomorphism for translation-invariant smooth valuations.
method Directly describes Alesker's isomorphism in terms of Fourier transform on functions.
result Simple proofs of Alesker's Fourier transform properties, including a previously conjectured result.

Efficient algorithm learns mixture models of heavy-tailed distributions.

problem Learning mixture models of heavy-tailed distributions.
method Efficient high-dimensional sparse Fourier transforms.
result Algorithm succeeds for heavy-tailed distributions, including Laplace but excluding Gaussians.

A new algorithm computes Fourier coefficients for a specified range efficiently.

problem Inefficiency in FFT due to fixed output size for all applications.
method Fast Partial Fourier Transform (PFT) that allows specifying the range of Fourier coefficients to compute.
result PFT achieves significant speedup over state-of-the-art FFT algorithms for small output sizes.

Proves conditions for Fourier transforms in rank 1 symmetric spaces.

problem Understanding Fourier transform bounds in symmetric spaces.
method Proves sufficient and necessary conditions using Lipschitz and Fourier type integral conditions.
result Establishes bounds for Fourier transforms in rank 1 symmetric spaces with specific moduli of continuity.

This work improves Fourier pricing for multi-asset options using RQMC with domain transformation.

problem Efficiently pricing multi-asset options in high dimensions with Fourier methods.
method Randomized quasi-Monte Carlo (RQMC) with domain transformation to handle singularities.
result RQMC with domain transformation provides accurate and scalable Fourier pricing for multi-asset options.

Algorithm describes Fourier transform of Stokes data at infinity.

problem Understanding the Fourier transform of Stokes data at infinity.
method Topological description and algorithmic approach using recent results and language of Stokes local systems.
result Explicit isomorphisms between wild character varieties are induced.

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.

New algorithms learn sparse set functions in non-orthogonal Fourier bases.

problem Learning sparse set functions in non-orthogonal Fourier bases.
method Novel algorithms using non-orthogonal Fourier transforms.
result At most nkklog2k+knk - k \log_2 k + k queries for kk non-zero Fourier coefficients.

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…

2019-07-02abs ↗pdf ↗

The paper derives statistics of multi-factor functions from their Fourier transforms.

problem Deriving statistics of multi-factor functions from Fourier transforms.
method Developed an m-Coefficient/Index Annihilation Theorem to analyze the moments of a function from its Fourier transform.
result The mth moment of a function becomes a series of terms, each with precisely m Fourier coefficients, and the indices sum to zero.

In this paper we prove a new inversion theorem and a refinement of an old support theorem for two Radon transforms on a symmetric space. Included are some new identities for the Abel transform and some results about the Fourier transform from a joint work with Rawat, Sengupta and Sitaram.

2005-06-02abs ↗pdf ↗

Given two compact hyperkähler surfaces XX and YY and a holomorphic vector bundle QQ on X×YX\times Y, which is a generalized instanton, one can define a Fourier-Mukai transform, which, under suitable assumptions, maps vector bundles on XX to vector bundles on YY. If XX and YY are dual complex tori, this transform …

1994-07-15abs ↗pdf ↗

Enhances Fourier estimator performance for asynchronous event-data.

problem Improving correlation and covariance estimation on event-data.
method Implement and test NUFFT methods with different averaging kernels.
result Demonstrates improved performance and relationship between averaging scales.

Many signals on Cartesian product graphs appear in the real world, such as digital images, sensor observation time series, and movie ratings on Netflix. These signals are "multi-dimensional" and have directional characteristics along each factor graph. However, the existing graph Fourier transform does not distinguish …

2017-12-21abs ↗pdf ↗

RP-GFRFT unifies fractional order and rotation control for graph signals.

problem Lack of rotation-based spectral control in GFRFT and zero-angle degeneracy in AGFT.
method Rotation-parameterized graph fractional Fourier transform (RP-GFRFT) with degeneracy preserving rotation matrix.
result RP-GFRFT improves spectral filtering performance over existing methods.

Study identifies and analyzes three types of errors in learning Fourier operators.

problem Statistical, discretization, and truncation errors in learning Fourier operators.
method Analysis of a Discrete Fourier Transform (DFT) based least squares estimator.
result Established upper and lower bounds on statistical, discretization, and truncation errors.

The study establishes uncertainty principles on harmonic manifolds of rank one.

problem Developing uncertainty principles for harmonic manifolds of rank one.
method Derivation of various uncertainty principles including Heisenberg, Morgen, Schrödinger, and Hömanders principles.
result Generalization of Hausdorff-Young inequality to harmonic manifolds of rank one.

FourNet approximates financial transition densities using Fourier transforms.

problem Approximating transition densities in finance with high accuracy.
method FourNet is a novel FFNN with Gaussian activation, learning from characteristic functions.
result FourNet can approximate transition densities arbitrarily well with finite neurons.

The paper connects quantum 6j6j-symbols to tetrahedra volumes via discrete Fourier transforms.

problem Understanding the asymptotic behavior of quantum 6j6j-symbols and their relation to 3-manifold invariants.
method Proposing and proving a conjecture linking discrete Fourier transforms of quantum 6j6j-symbols to the volumes of deeply truncated tetrahedra.
result Supporting evidence for the conjecture in specific cases, with numerical calculations for larger dihedral angles.

Many neural speech enhancement and source separation systems operate in the time-frequency domain. Such models often benefit from making their Short-Time Fourier Transform (STFT) front-ends trainable. In current literature, these are implemented as large Discrete Fourier Transform matrices; which are prohibitively inef…

2020-02-20abs ↗pdf ↗

New method for optimizing risk in financial models using Fourier transforms.

problem Optimizing risk in financial models with multi-period mean-CVaR.
method Strictly monotone 2D integration scheme via Fourier-trained transition kernels.
result Established robust and accurate optimization method for financial models.

Quantum Fourier Transform aids machine learning inference.

problem Generalizing from finite data samples to ground truth.
method Inspired by quantum algorithms, uses Quantum Fourier Transform to expose invariant subspace for data comparison.
result Proposes a concrete implementation for machine learning applications leveraging symmetries.