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

60120180240 · Jun 202019922001200920172026
48 results for Fourier continuation

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 paper analyzes SHAP values using Fourier expansions for model interpretability.

problem Understanding and interpreting SHAP values in complex models.
method Developed a spectral framework using Fourier expansions for SHAP values in various model regimes.
result SHAP values are Lipschitz continuous in the deterministic regime and converge to Gaussian process values in the probabilistic regime.

Study Fourier estimator for spot volatility with unbounded coefficients and jumps.

problem Estimating spot volatility with unbounded coefficients and jumps in price process.
method Fourier estimator for spot volatility, convergence analysis for unbounded coefficients and jumps.
result Convergence of trigonometric polynomial to volatility's path, almost sure convergence of reconstructed volatility.

We extend the Fourier cosine method to discrete probability distributions, achieving faster convergence rates.

problem Extending Fourier cosine method to discrete probability distributions.
method Spectral filters and convergence rates analysis.
result Spectral filters achieve one order faster convergence rates than previously recognized.

Proposes a differentiable STFT for more efficient optimization of hop length.

problem Efficient optimization of hop length in STFT for better temporal control.
method Introduces a differentiable version of STFT with continuous hop length.
result Improves optimization methods like gradient descent for STFT.

NFM models time-series data directly in the Fourier domain, achieving state-of-the-art performance.

problem Traditional time-series analysis focuses on the time domain, limiting flexibility.
method NFM models time-series data in the Fourier domain, using frequency extrapolation and interpolation.
result NFM achieves state-of-the-art performance on various time-series tasks.

Study evolution equations on Lie groupoids using Fourier integral operators.

problem Solving evolution equations on Lie groupoids.
method Developed calculus of Fourier integral operators and used them to study the fundamental solution of the evolution equation.
result Developed a method to find the fundamental solution of the evolution equation on Lie groupoids.

A new CNN-based algorithm improves Fourier ptychography for faster, more robust image reconstruction.

problem Slow and inefficient Fourier ptychography reconstruction under system aberrations.
method A CNN-based iterative phase retrieval algorithm trained on GPUs.
result Significantly faster and more robust image reconstruction under system aberrations.

The paper proposes a method to learn the structure of continuous-action games with non-parametric utilities using a limited number of samples.

problem Learning the exact structure of continuous-action games with non-parametric utility functions.
method An 1\ell_1 regularized method that encourages sparsity of the Fourier transform coefficients of the utility functions, accessed via a few Nash equilibria and their noisy utilities.
result The method recovers the exact structure of the utility functions and the game structure with provable theoretical guarantees.

Analytical pricing formulas and Greeks are obtained for European and American basket put options using Mellin transforms. We assume assets are driven by geometric Brownian motion which exhibit correlation and pay a continuous dividend rate. A novel approach to numerical Mellin inversion is achieved via the fast Fourier…

2014-03-15abs ↗pdf ↗

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.

We apply a new numerical method, the singular Fourier-Padé (SFP) method invented by Driscoll and Fornberg (2001, 2011), to price European-type options in Lévy and affine processes. The motivation behind this application is to reduce the inefficiency of current Fourier techniques when they are used to approximate piecew…

2017-06-21abs ↗pdf ↗

Develops a new method for pricing GMWBs with jumps and stochastic interest rates.

problem Pricing guaranteed minimum withdrawal benefits (GMWBs) with jumps and stochastic interest rates.
method Combines semi-Lagrangian method with Fourier pricing and Green's function.
result Mathematically demonstrates convergence to the viscosity solution of the HJB-QVI.

Random Fourier features is a widely used, simple, and effective technique for scaling up kernel methods. The existing theoretical analysis of the approach, however, remains focused on specific learning tasks and typically gives pessimistic bounds which are at odds with the empirical results. We tackle these problems an…

2018-06-24abs ↗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.

Three RFF-based methods for nonlinear causal discovery in mixed data.

problem Nonlinear causal discovery in mixed data with computational constraints.
method FFML, TRFF, and FFCI methods for score-based, constraint-based, and hybrid causal discovery.
result FFML and TRFF methods provide complementary performance in causal discovery.

We consider the semi-classical Dirac operator coupled to a magnetic potential on a large class of manifolds including all metric contact manifolds. We prove a sharp local Weyl law and a bound on its eta invariant. In the absence of a Fourier integral parametrix, the method relies on the use of almost analytic continuat…

2015-11-27abs ↗pdf ↗

Proposes a new tensor decomposition method for functional temporal data with adaptive complexity.

problem Challenges in temporal tensor decomposition for general tensor data with continuous indexes.
method Encodes continuous spatial indexes as learnable Fourier features and uses neural ODEs for temporal trajectories. Introduces a sparsity-inducing prior for complexity adaptation.
result Significantly outperforms existing methods in prediction performance and robustness against noise.

Determinantal point processes (DPPs) are random point processes well-suited for modeling repulsion. In machine learning, the focus of DPP-based models has been on diverse subset selection from a discrete and finite base set. This discrete setting admits an efficient sampling algorithm based on the eigendecomposition of…

2013-11-12abs ↗pdf ↗

In this paper we introduce a new family of operator-valued distributions on Euclidian space acting by convolution on differential forms. It provides a natural generalization of the important Riesz distributions acting on functions, where the corresponding operators are (Δ)α/2(-Δ)^{-α/2}, and we develop basic analogous prop…

2017-02-03abs ↗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.

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.

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.

Improved electrical load forecasting model using Fourier-enhanced RNN.

problem Electrical load time series downscaling with high accuracy and low error.
method Combines recurrent neural network with Fourier seasonal embeddings and self-attention.
result Significantly reduces RMSE across different time horizons compared to existing methods.

We characterize stationary solutions to McKean-Vlasov equations on the circle.

problem Stationary solutions of McKean-Vlasov equations on the circle.
method Exact equivalence to an infinite-dimensional quadratic system of equations over Fourier coefficients, leading to explicit characterization of stationary states.
result Analytic expressions for the emergence, form, and shape of bifurcations involving multiple Fourier modes, and connections with discontinuous phase transitions.

RNNs solve modular addition tasks using low rank and sparse Fourier structures.

problem Solving modular addition tasks with recurrent neural networks.
method Identified low rank structures and sparse Fourier representations in RNN weights.
result RNNs robust to removing individual frequencies but degrade with more ablation.

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.

New Fourier metrics equivalent to Wasserstein distances in image processing.

problem Equivalence of Fourier-based and Wasserstein metrics in imaging problems.
method Extensions of Fourier-based metrics to handle different centers of mass and discrete measures, showing equivalence to Wasserstein distances.
result New Fourier metrics are equivalent to Wasserstein distances with explicit constants, improving runtime in image processing.

Framework combines random features with CDEs for efficient time-series learning.

problem Efficient training of time-series models with strong inductive bias.
method Random Fourier CDEs and Random Rough DEs using continuous-time reservoirs and log-ODE discretization.
result Unified perspective on random-feature reservoirs and path-signature theory.

This paper proposes a new class of copulas which characterize the set of all twice continuously differentiable copulas. We show that our proposed new class of copulas is a new generalized copula family that include not only asymmetric copulas but also all smooth copula families available in the current literature. Spea…

2012-10-08abs ↗pdf ↗

The paper introduces new estimators for multivariate functions using Fourier methods.

problem Estimating multivariate functions like densities and regression functions.
method Monte Carlo estimators based on the Fourier integral theorem.
result Established rates of convergence for new estimators, often superior to existing methods.

New discrepancy function compares discrete probability measures considering space geometry.

problem Comparing discrete probability measures in a geometrically meaningful way.
method Proposes the Fourier Discrepancy Function, proving convexity, differentiability, and providing gradient formula.
result Proves the Fourier Discrepancy is convex, twice differentiable, and provides an explicit gradient formula.