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

88177265353 · Jun 202019922001200920172026
48 results for Fourier representation

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.

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.

Derives representations invariant under crystallographic groups for functions.

problem Representing and learning functions invariant under crystallographic groups.
method Derives linear and nonlinear representations of functions invariant under crystallographic groups.
result Derives orthonormal crystallographically invariant basis functions and embedding maps.

Equivariant neural networks use symmetry to interpret complex data.

problem Interpreting and understanding the behavior of equivariant neural networks.
method Decompose layers into simple representations and analyze nonlinear activation functions.
result Equivariant neural networks can be interpreted using a filtration generalizing Fourier series.

We provide an integral representation for the (implied) copulas of dependent random variables in terms of their moment generating functions. The proof uses ideas from Fourier methods for option pricing. This representation can be used for a large class of models from mathematical finance, including Lévy and affine proc…

2011-08-04abs ↗pdf ↗

Neural networks learn spectral representations for group composition.

problem Understanding structured emergence in neural network training.
method Lifting gradient flow to Fourier domain, proving convergence to irreducible representations.
result Neurons converge to single irreducible representations, cross-layer coefficients align.

Every torus knot can be represented as a Fourier-(1,1,2) knot which is the simplest possible Fourier representation for such a knot. This answers a question of Kauffman and confirms the conjecture made by Boocher, Daigle, Hoste and Zheng. In particular, the torus knot T(p,q) can be parameterized as x(t)=cos(pt), y(t)=c…

2007-08-27abs ↗pdf ↗

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.

Fourier representation improves KSD for infinite-dimensional data.

problem Applying KSD to infinite-dimensional data.
method Combining measure equations with kernel methods for a Fourier representation of KSD.
result KSD can separate measures in infinite-dimensional Hilbert spaces.

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.

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.

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.

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.

The expressive power of Gaussian processes depends heavily on the choice of kernel. In this work we propose the novel harmonizable mixture kernel (HMK), a family of expressive, interpretable, non-stationary kernels derived from mixture models on the generalized spectral representation. As a theoretically sound treatmen…

2018-10-10abs ↗pdf ↗

IGT learns graph representations without supervision.

problem Building deep unsupervised graph representations.
method Generic complex-valued spectral graph architecture from Fourier transform generalization, greedy concave objective for discriminative and invariant features.
result IGT learns both discriminative and invariant features from graph topology.

The article provides representations of exchange option prices under SVJD dynamics.

problem Modeling and pricing exchange options under stochastic volatility and jumps.
method Develops representations for European and American exchange options using SVJD dynamics and equivalent martingale measures.
result Derives integro-partial differential equations and representations for exchange option prices.

Unified approach for interpretable regression with flexible modeling.

problem Combining predictive adaptivity with interpretability in heterogeneous data.
method Combining random Fourier features, spectral feature map, principal component analysis, Gaussian mixture model, and cluster-specific generalized additive models.
result Consistently improves upon classical and black-box models across benchmark datasets.

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

We revisit Rahimi and Recht (2007)'s kernel random Fourier features (RFF) method through the lens of the PAC-Bayesian theory. While the primary goal of RFF is to approximate a kernel, we look at the Fourier transform as a prior distribution over trigonometric hypotheses. It naturally suggests learning a posterior on th…

2018-10-30abs ↗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.

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.

New spectral mixture representation for isotropic kernels simplifies random Fourier features.

problem Applying Random Fourier Features to complex kernels.
method Decompose isotropic kernels into scale mixtures of α-stable random vectors.
result Constructive spectral sampling formula for various kernels.

Many theories of deep learning have shown that a deep network can require dramatically fewer resources to represent a given function compared to a shallow network. But a question remains: can these efficient representations be learned using current deep learning techniques? In this work, we test whether standard deep l…

2018-07-17abs ↗pdf ↗

Enhances GPLVM for multi-view data with scalable latent representation learning.

problem Limited kernel expressiveness and computational inefficiency in multi-view GPLVM.
method Introduces a new duality between spectral density and kernel function, uses NG-SM kernel, and applies random Fourier feature approximation for scalability.
result Consistently outperforms state-of-the-art models in learning meaningful latent representations across diverse datasets.

Local norms of Fourier multipliers bounded on discrete subgroups of Lie groups.

problem Bounding LpL_p norms of Fourier multipliers on discrete subgroups of Lie groups.
method Developed tools to find explicit bounds on c(A)c(A), reducing the problem to representations of semisimple and radical parts of Lie algebras.
result Explicit bounds on c(A)c(A) for unimodular connected solvable Lie groups, showing c(G)=1c(G) = 1.

New neural operators learn structured patterns efficiently.

problem Learning and representing complex, structured patterns in data.
method Sparse autoencoder neural operators (SAE-NOs) parameterize concepts as functions, enabling efficient and structured representation.
result SAE-FNOs learn localized patterns and generalize across different scales and discretizations.

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.

These notes are an extended version of a talk given by the author in the seminar "Theorie Spectrale et Geometrie" at the Institut Fourier in No- vember 2016. We present here some aspects of a work in collaboration with B. Collier and N. Tholozan (arXiv:1702.08799). We describe how Higgs bundle theory and pseudo-hyperbo…

2017-09-18abs ↗pdf ↗

We study the geometry and partial differential equations arising from the consideration of group-determinants, and representation theory. The simplest and most striking such example is undoubtedly that of the Humbert operator, associated with the cyclic group Z/3Z. This operator appears as a natural extension of the La…

2019-10-28abs ↗pdf ↗

The presence of non linear instruments is responsible for the emergence of non Gaussian features in the price changes distribution of realistic portfolios, even for Normally distributed risk factors. This is especially true for the benchmark Delta Gamma Normal model, which in general exhibits exponentially damped power…

2010-02-25abs ↗pdf ↗

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.

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.