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

99198296395 · May 202619922001200920172026
48 results for Fourier isocapacitary condition

New learning rates derived for Tikhonov-regularized problems without kernel assumptions.

problem Learning rates for Tikhonov-regularized learning problems.
method Minimax adaptive rates derived using Fourier isocapacitary condition and interpolation theory.
result Derivation of minimax adaptive rates without requiring kernel assumptions.

Study Cheeger inequalities for Riemannian manifolds with boundary.

problem Estimating Steklov eigenvalues on Riemannian manifolds with boundary.
method Establish Cheeger-type inequalities using isocapacitary constants.
result Cheeger inequalities for Steklov eigenvalues on compact and non-compact manifolds.

Estimates eigenvalues and spectrum for graph substructures using isocapacitary constants.

problem Estimating eigenvalues and spectrum for graph substructures.
method Introducing Cheeger type constants via isocapacitary constants to estimate eigenvalues and spectrum.
result Estimates for first Dirichlet, Neumann, and Steklov eigenvalues, as well as the bottom of the spectrum of the Laplace operator and Dirichlet-to-Neumann operator.

The paper studies nonlinear mass concepts in 3-manifolds with nonnegative scalar curvature.

problem Nonlinear isocapacitary mass in 3-manifolds with nonnegative scalar curvature.
method Derives positive mass theorems and shows mass coincides with ADM mass under mild conditions.
result Nonlinear masses coincide with ADM mass and prove the Penrose inequality.

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.

In this article, we propose the notion of the general pp-affine capacity and prove some basic properties for the general pp-affine capacity, such as affine invariance and monotonicity. The newly proposed general pp-affine capacity is compared with several classical geometric quantities, e.g., the volume, the pp-var…

2017-05-21abs ↗pdf ↗

The paper uses Fourier integral theorem for estimating multivariate distributions.

problem Estimating multivariate distributions and conditional distribution functions.
method Natural Monte Carlo and fully nonparametric estimators based on Fourier integral theorem.
result Explicit Monte Carlo estimators without estimated covariance matrix.

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.

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.

The aim of this article is to provide a systematic analysis of the conditions such that Fourier transform valuation formulas are valid in a general framework; i.e. when the option has an arbitrary payoff function and depends on the path of the asset price process. An interplay between the conditions on the payoff funct…

2008-09-19abs ↗pdf ↗

Fourier methods fail to accurately approximate option Greeks in realistic market conditions.

problem Failure of Fourier pricing techniques to approximate Greeks in realistic market parameters.
method Used Fourier techniques like Carr-Madan formula, COS method, and Lewis formula to approximate Greeks, which failed in some market conditions.
result Empirically showed that Fourier methods completely fail to approximate Greeks in realistic market environments.

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.

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.

A new model captures complex event data using attention and Fourier kernels.

problem Capturing complex non-linear temporal dependencies in discrete event data.
method Integrates attention mechanism into point processes' conditional intensity function and uses Fourier kernel embedding.
result Established theoretical properties and demonstrated competitive performance.

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 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 ↗

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.

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.

The paper bounds Fourier integral operators on Hardy spaces with specific conditions.

problem Bounding Fourier integral operators on Hardy spaces with given conditions.
method Using Hörmander classes and phase conditions, the paper establishes boundedness of Fourier integral operators.
result The Fourier integral operator is bounded from local Hardy space hph^p to LpL^p under specified conditions.

The classical shift retrieval problem considers two signals in vector form that are related by a shift. The problem is of great importance in many applications and is typically solved by maximizing the cross-correlation between the two signals. Inspired by compressive sensing, in this paper, we seek to estimate the shi…

2013-03-20abs ↗pdf ↗

In this paper we consider Fourier transform techniques to efficiently compute the Value-at-Risk and the Conditional Value-at-Risk of an arbitrary loss random variable, characterized by having a computable generalized characteristic function. We exploit the property of these risk measures of being the solution of an ele…

2014-07-03abs ↗pdf ↗

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

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.

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 introduce the formalism of generalized Fourier transforms in the context of risk management. We develop a general framework to efficiently compute the most popular risk measures, Value-at-Risk and Expected Shortfall (also known as Conditional Value-at-Risk). The only ingredient required by our approach is the knowle…

2009-09-22abs ↗pdf ↗

New method detects bearing faults using multivariate statistical process control.

problem Early detection of bearing faults in rotating machinery.
method Multivariate statistical process control charts applied to Fourier transform features of fixed-time batches.
result Effectiveness in detecting bearing faults across different conditions.

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.

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.

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.

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.

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.

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.