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

Trend · papers per month

54108162216 · Jun 202019922001200920172026
48 results for Fourier metrics

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.

Study examines the geometry of a group of Fourier-integral operators related to Diff(S^1).

problem Investigating the geometry of a specific group of Fourier-integral operators.
method Defined a right-invariant pseudo-Riemannian metric on the group using renormalized traces of pseudo-differential operators.
result Extended the Hilbert-Schmidt Riemannian metric to the group.

The paper connects 3D manifold invariants to hyperbolic cone metrics and discrete Fourier transforms.

problem Volume conjecture for Reshetikhin-Turaev invariants of 3-manifolds with links.
method Volume conjecture, hyperbolic cone metrics, discrete Fourier transforms, change-of-pair operations.
result Volume conjecture proven for specific cases, provides approach to solving Volume Conjecture for hyperbolic 3-manifolds.

Study approximates operator learning for PDEs using Fourier multipliers.

problem Approximating operator behavior for PDE simulations.
method Approximation of operator symbols in Fourier domain using semi-norms.
result Identifies conditions for achieving predefined approximation error.

We study estimation of (semi-)inner products between two nonparametric probability distributions, given IID samples from each distribution. These products include relatively well-studied classical L2\mathcal{L}^2 and Sobolev inner products, as well as those induced by translation-invariant reproducing kernels, for whic…

2018-03-30abs ↗pdf ↗

The paper proposes a novel method for optimizing bounded functions using Fourier series and Ricci flow.

problem Optimizing bounded functions using Fourier series and Ricci flow.
method Approximating the initial manifold using Fourier series and center/boundary sampling. Iteratively evolving the manifold using geodesic hyper-spheres and inverse Ricci flow.
result The method allows for the optimization of high curvature regions and achieves potential global optima.

Supervised learning based on a deep neural network recently has achieved substantial improvement on speech enhancement. Denoising networks learn mapping from noisy speech to clean one directly, or to a spectrum mask which is the ratio between clean and noisy spectra. In either case, the network is optimized by minimizi…

2019-01-26abs ↗pdf ↗

We propose the Wasserstein-Fourier (WF) distance to measure the (dis)similarity between time series by quantifying the displacement of their energy across frequencies. The WF distance operates by calculating the Wasserstein distance between the (normalised) power spectral densities (NPSD) of time series. Yet this ratio…

2019-12-11abs ↗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.

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.

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.

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.

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.

This work proves convergence of adaptive resampling for random Fourier features.

problem Sampling Fourier frequencies well for high-dimensional data.
method Data adaptive resampling of Fourier frequencies, asymptotically optimal.
result Proves convergence of adaptive resampling method for regression and classification problems.

We show that every knot has a checkerbord diagram and that every knot is the closure of a rosette braid. We define Fourier knots of type (n_1, n_2, n_3) as knots which have parametrizations where each coordinate function x_i(t) is a finite Fourier series of length n_i, and conclude that every knot is a Fourier knot of …

2012-10-16abs ↗pdf ↗

Proves existence of Yamabe metrics on conical manifolds with conical points and links.

problem Existence of Yamabe metrics on singular manifolds with conical points and links.
method Derives a counterpart of Aubin's result, uses conical links and Fourier analysis, adds lower-order correction to standard bubbles.
result Derives asymptotic expansions on the Yamabe quotient for generic type metrics.

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.

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.

Spectral methods predict long-term signals from linear and nonlinear systems.

problem Forecasting temporal signals from linear and nonlinear systems with arbitrary sampling.
method Introduces a spectral algorithm for linear signals and extends it to nonlinear systems using Koopman theory.
result The spectral methods achieve high accuracy in forecasting and uncertainty quantification.

We study the monopole Floer homology of a SOLV rational homology sphere Y from the point of view of spectral theory. Applying ideas of Fourier analysis on solvable groups, we show that for suitable SOLV metrics on Y, small regular perturbations of the Seiberg-Witten equations do not admit irreducible solutions; in part…

2018-12-28abs ↗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.

Improved Gaussian Process regression using TQFF over RFF and Gaussian QFF.

problem Limited performance of Quadrature Fourier Features (QFF) in approximating highly oscillatory functions.
method Developed Trigonometric Quadrature Fourier Features (TQFF) using a novel non-Gaussian quadrature rule.
result TQFF provides better approximation accuracy and fewer features compared to RFF and Gaussian QFF.

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.

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.

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.