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

15.0%30.0%45.0%60.0% · Aug 199419922001200920172026
48 results for Fourier complexity

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.

New bounds on ReLU networks for low-regular functions.

problem Bounding approximation error for ReLU networks on low-regular functions.
method Complexity analysis of Fourier features residual networks to ReLU networks.
result Approximation error bound proportional to target function norm and inversely proportional to network width and depth.

DAFNO learns surrogates for complex systems on irregular geometries.

problem Learning accurate surrogates for complex physical systems on irregular geometries.
method DAFNO incorporates a smoothed characteristic function in the integral layer architecture of FNOs, leveraging FFT for rapid computations.
result DAFNO achieves state-of-the-art accuracy on material modeling and airfoil simulation datasets.

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.

Sp(n)-instantons linked to complex Lagrangian graphs via Fourier-Mukai transform.

problem Understanding Sp(n)-instantons on hyperkahler manifolds with conical singularities.
method Relating Sp(n)-instantons to deformed instantons and studying their properties on hyperkahler manifolds.
result Sp(n)-instantons on hyperkahler manifolds correspond to tri-contact instantons on the 3-Sasakian link.

Enhances DGPs with adaptive RKHS Fourier features for better non-stationary pattern modeling.

problem Capturing complex non-stationary patterns in non-linear dynamical systems.
method Integrates ODE-based RKHS Fourier features into DGPs using convolution operations for adaptive amplitude and phase modulation. Uses a doubly stochastic variational inference framework.
result Improved predictive performance across various regression tasks.

New method uses tensor decompositions to overcome the curse of dimensionality for large-scale learning.

problem Large-scale machine learning problems with kernel methods.
method Deterministic Fourier features combined with low-rank tensor decomposition for tensor product structure.
result Demonstrated consistent performance and superior results compared to random Fourier features.

Scalable kernel methods for large datasets using Fourier representations and NUFFT.

problem Cubic complexity in kernel methods limits their use on large-scale datasets.
method Fourier representation of kernels combined with NUFFT for O(n log n) complexity.
result Achieves minimax convergence rates and processes up to tens of billions of samples.

A new method optimizes Fourier pricing for multi-asset options using adaptive quadrature.

problem Efficiently pricing multi-asset options in Lévy models.
method Optimized damping parameters and hierarchical adaptive quadrature.
result Significant speed-up in computational time for up to six dimensions.

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 ↗

This paper optimizes Gaussian mixture model learning with optimal sampling complexity.

problem Learning the number of components and mixing distribution in 1D Gaussian mixtures.
method Fourier-based approach to estimate model order and mixing distribution.
result The proposed method matches the optimal sampling complexity and outperforms conventional techniques.

Develops Active Fourier Auditor to estimate ML model properties without reconstructing them.

problem Verifying and auditing properties of Machine Learning models in real-world applications.
method A new framework that quantifies ML model properties using Fourier coefficients, without reconstructing the model.
result Active Fourier Auditor (AFA) is more accurate and sample-efficient than baselines for estimating robustness, individual fairness, and group fairness.

We systematically develop a transform of the Fourier-Mukai type for sheaves on symplectic manifolds XX of any dimension fibred in Lagrangian tori. One obtains a bijective correspondence between unitary local systems supported on Lagrangian submanifolds of XX and holomorphic vector bundles with compatible unitary conn…

2001-05-24abs ↗pdf ↗

EFiGP uses Fourier and eigen-decomposition for efficient ODE parameter estimation.

problem Parameter estimation and trajectory reconstruction for noisy, sparse, nonlinear ODE systems.
method EFiGP integrates Fourier transformation and eigen-decomposition into a physics-informed Gaussian Process framework.
result EFiGP efficiently estimates ODE parameters and recovers trajectories from noisy data.

New algorithm trains deep neural networks without global optimization.

problem Training deep neural networks efficiently and without global optimization.
method Uses random complex exponential activation functions and Markov Chain Monte Carlo sampling.
result Consistently attains theoretical approximation rate for residual networks.

Random Fourier features classification achieves fast learning rates with fewer features.

problem Improving classification efficiency with fewer features.
method Utilizing Lipschitz continuous loss functions and regularity conditions, the study reduces the number of features required for classification.
result Random Fourier features classification can achieve O(1/n)O(1/\sqrt{n}) learning rate with only Ω(nlogn)Ω(\sqrt{n} \log n) features.

The covariance of a stationary process XX is diagonalized by a Fourier transform. It does not take into account the complex Fourier phase and defines Gaussian maximum entropy models. We introduce a general family of phase harmonic covariance moments, which rely on complex phases to capture non-Gaussian properties. The…

2019-11-22abs ↗pdf ↗

We present a novel attention-based model for discrete event data to capture complex non-linear temporal dependence structures. We borrow the idea from the attention mechanism and incorporate it into the point processes' conditional intensity function. We further introduce a novel score function using Fourier kernel emb…

2020-02-17abs ↗pdf ↗

A new method computes Greeks for multi-asset options using tensor trains and Fourier transforms.

problem Efficient computation of Greeks for multi-asset options with high accuracy and low sample complexity.
method Tensor train (TT) representations of Fourier-based pricing functions, combined with numerical differentiation or analytical approaches.
result Significant speed-ups of up to 105imes10^{5} imes over Monte Carlo simulations while maintaining comparable accuracy.

Fourier Neural Operators accurately predict dynamics of high-dimensional ionic models.

problem Approximating stiff, multiscale ionic models using neural networks.
method Fourier Neural Operators for learning dynamics of high-dimensional ionic models.
result Fourier Neural Operators can accurately predict dynamics of high-dimensional ionic models.

A new method for nonstationary Gaussian processes using Fourier features.

problem Efficient simulation of nonstationary Gaussian processes with high-dimensional distributions.
method Discretizes the spectral representation of nonstationary processes, avoiding probability measure assumptions.
result An efficient low-rank approximation of nonstationary spectral densities, consistent and positive semi-definite.

FNSDA adapts to new dynamics via Fourier space adaptation.

problem Generalizing to unseen dynamical systems with limited data.
method Automatic partitioning of known environments in Fourier modes and adaptation of specific modes for new environments.
result FNSDA achieves superior or competitive generalization performance with reduced parameter cost.

FNOs learn solution operators of dissipative equations efficiently via spectral methods.

problem Learning and approximation of solution operators for dissipative equations.
method Introducing spectral methods and deriving FNO approximation bounds and sample complexity guarantees.
result Polynomial sample complexity guarantees for FNOs learning solution operators of dissipative equations.

We propose a Fourier-based approach for optimization of several clustering algorithms. Mathematically, clusters data can be described by a density function represented by the Dirac mixture distribution. The density function can be smoothed by applying the Fourier transform and a Gaussian filter. The determination of th…

2019-04-29abs ↗pdf ↗

Sharp inequalities on Siegel domains and complex hyperbolic spaces established.

problem Establishing inequalities on complex hyperbolic spaces and Siegel domains.
method Helgason-Fourier analysis, Kunze-Stein phenomenon, factorization theorem.
result Sharp Hardy-Adams and Adams type inequalities on Sobolev spaces of any positive fractional order on complex hyperbolic spaces.

Efficiently approximates eigenspaces for symmetric and general matrices.

problem Fast computation of eigenspaces for large matrices.
method Factor eigenspaces into fundamental components using transformations, solve minimization problems, and iteratively update.
result Improved computational efficiency for eigenspace approximation.

New integral theorems improve density function estimations.

problem Improving density function estimations.
method Integrals based on cyclic functions and Riemann sums, Fourier integral theorem, Monte Carlo methods, variational approach, Cauchy residue theorem.
result Optimal cyclic functions minimize square integrals, improving density estimations.

Quantum method improves neural density estimation in high dimensions.

problem High-dimensional density estimation with poor performance and high computational complexity.
method Adaptive Fourier features based on quantum density matrices, integrated with neural networks.
result Competitive performance compared to state-of-the-art methods in various datasets.

A neural network method estimates densities from characteristic functions.

problem Estimating fixed-horizon probability densities from empirical characteristic functions.
method Data-driven Fourier-mixture neural-network method trained in Fourier space.
result Competitive performance and clear gains on heavy-tailed targets.

Improved MMD test for two-sample testing with random Fourier features.

problem Quadratic-time complexity of MMD test for large-scale analysis.
method Approximated MMD test using random Fourier features, investigating time-power trade-off.
result Sub-quadratic time complexity with same minimax separation rates as MMD test.

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.

Study explores how neural networks and Transformers learn modular arithmetic with multiple inputs.

problem Understanding how neural networks and Transformers learn modular arithmetic with multiple inputs.
method Analytical characterization of features learned by neural networks and Transformers, focusing on margin maximization and Fourier spectra.
result Neural networks and Transformers require a minimum neuron count of \( m \geq 2^{2k-2} \cdot (p-1) \) to solve modular addition problems with \( k \) inputs and modulus \( p \).

Gaussian process modulated Poisson processes provide a flexible framework for modelling spatiotemporal point patterns. So far this had been restricted to one dimension, binning to a pre-determined grid, or small data sets of up to a few thousand data points. Here we introduce Cox process inference based on Fourier feat…

2018-04-03abs ↗pdf ↗

Quantum-assisted Gaussian process speeds up data regression.

problem High computational complexity of Gaussian process regression for large datasets.
method Quantum-assisted sparse Gaussian process regression using random Fourier features.
result Achieves polynomial-order computational speedup compared to classical methods.

Quantum ELMs use a quantum reservoir to learn from data, with limits on expressivity and scalability.

problem Understanding the limits of quantum ELMs for machine learning tasks.
method Decomposed QELM predictions into Fourier series to analyze expressivity and scalability.
result Expressivity of QELMs is limited by the number of Fourier frequencies and observables, and scalability is hindered by hardware noise and entanglement.

Quantum algorithm for pricing European call options.

problem Accurate valuation of financial derivatives, especially for complex models and options.
method Transforms classical FFT into quantum QFT for pricing European call options.
result Quantum algorithm outperforms classical Monte Carlo simulation in NISQ era.