Many signals on Cartesian product graphs appear in the real world, such as digital images, sensor observation time series, and movie ratings on Netflix. These signals are "multi-dimensional" and have directional characteristics along each factor graph. However, the existing graph Fourier transform does not distinguish …
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,657 papers · 148 categories
Trend · papers per month
48 results for “Graph Fourier Transform”
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.
We present graph wavelet neural network (GWNN), a novel graph convolutional neural network (CNN), leveraging graph wavelet transform to address the shortcomings of previous spectral graph CNN methods that depend on graph Fourier transform. Different from graph Fourier transform, graph wavelet transform can be obtained …
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.
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.
We introduce a novel harmonic analysis for functions defined on the vertices of a strongly connected directed graph of which the random walk operator is the cornerstone. As a first step, we consider the set of eigenvectors of the random walk operator as a non-orthogonal Fourier-type basis for functions over directed gr…
Constructing fast approximate eigenspaces with application to the fast graph Fourier transformscs.LG
We investigate numerically efficient approximations of eigenspaces associated to symmetric and general matrices. The eigenspaces are factored into a fixed number of fundamental components that can be efficiently manipulated (we consider extended orthogonal Givens or scaling and shear transformations). The number of the…
A new graph signature invariant to graph automorphisms.
problem Graph symmetry and feature generation.
method Power spectrum signature derived from squared graph Fourier transform.
result Power spectrum signature is stable under graph perturbations.
The paper connects quantum -symbols to tetrahedra volumes via discrete Fourier transforms.
problem Understanding the asymptotic behavior of quantum -symbols and their relation to 3-manifold invariants.
method Proposing and proving a conjecture linking discrete Fourier transforms of quantum -symbols to the volumes of deeply truncated tetrahedra.
result Supporting evidence for the conjecture in specific cases, with numerical calculations for larger dihedral angles.
A common assumption in semi-supervised learning with graph models is that the class label function varies smoothly on the data graph, resulting in the rather strict prior that the label function has low-frequency content. Meanwhile, in many classification problems, the label function may vary abruptly in certain graph …
The paper detects changes in graph signal means offline.
problem Segmenting and detecting changes in multivariate signals over graph nodes.
method Model selection approach exploiting sparsity in spectral domain.
result Proof of non-asymptotic oracle inequality for change-point detection.
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.
Graph Signal Processing improves stock market volatility forecasting.
problem Forecasting realized volatility in a global stock market context.
method Integrating Graph Signal Processing into the HAR model.
result The proposed model outperforms HAR-type benchmarks.
We find a closed-form determinant for a specific sparse covariance matrix model.
problem Finding the determinant of a specific class of sparse positive definite matrices.
method Using Fourier transform of local factors, Normal Factor Graph Duality Theorem, and Matrix Determinant Lemma.
result We derive a closed-form expression for the determinant.
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.
We give a detailed microlocal study of X-ray transforms over geodesics-like families of curves with conjugate points of fold type. We show that the normal operator is the sum of a pseudodifferential operator and a Fourier integral operator. We compute the principal symbol of both operators and the canonical relation as…
Structured CNN designed using the prior information of problems potentially improves efficiency over conventional CNNs in various tasks in solving PDEs and inverse problems in signal processing. This paper introduces BNet2, a simplified Butterfly-Net and inline with the conventional CNN. Moreover, a Fourier transform i…
FreST Loss decorrelates spatio-temporal dependencies in graph signals.
problem Complex spatio-temporal dependencies in graph-structured signals are not well captured by standard forecasting models.
method FreST Loss extends supervision to the joint spatio-temporal spectrum using Joint Fourier Transform (JFT).
result FreST Loss reduces estimation bias and improves forecasting accuracy on real-world datasets.
Paper computes link determinants using Fourier-Hadamard transforms.
problem Computing determinants of complex link structures.
method Fourier-Hadamard transforms of Boolean functions.
result Determinant of centrally symmetric links with even components equals zero.
Machine learning methods such as convolutional neural networks (CNNs) are becoming an integral part of scientific research in many disciplines, spatial vector data often fail to be analyzed using these powerful learning methods because of its irregularities. With the aid of graph Fourier transform and convolution theor…
This letter extends the concept of graph-frequency to graph signals that evolve with time. Our goal is to generalize and, in fact, unify the familiar concepts from time- and graph-frequency analysis. To this end, we study a joint temporal and graph Fourier transform (JFT) and demonstrate its attractive properties. We b…
Local mappings relate dual and primal factor graphs for efficient marginal probability estimation.
problem Efficient estimation of marginal probabilities in statistical physics models.
method Local mappings based on Fourier transform of local factors, applied to Ising, Potts, and clock models.
result Local extrema of fixed points are at phase transition points, and the mapping facilitates efficient estimation.
The Fourier transform of Heegaard Floer d-invariants helps classify 3-manifolds.
problem Classifying 3-manifolds up to integer homology cobordism.
method Exploring the Fourier transform of Heegaard Floer d-invariants.
result Lens spaces are cancellable in the monoid of 3-manifolds up to integer homology cobordism.
The sub-Riemannian X-ray Transform on H-type groups: Fourier-Slice Theorems and Injectivity setsmath.DG
X-ray transform on H-type groups solved, revealing function injectivity.
problem Injectivity in sub-Riemannian geometry.
method Fourier Slice Theorem adapted to H-type groups.
result Integrable functions on H-type groups are uniquely determined by their integrals over geodesics.
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.
Quasi-Monte Carlo with Domain Transformation for Efficient Fourier Pricing of Multi-Asset Optionsq-fin.CP
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.
Algorithm describes Fourier transform of Stokes data at infinity.
problem Understanding the Fourier transform of Stokes data at infinity.
method Topological description and algorithmic approach using recent results and language of Stokes local systems.
result Explicit isomorphisms between wild character varieties are induced.
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.
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 queries for non-zero Fourier coefficients.
In this paper, we study robust tensor completion by using transformed tensor singular value decomposition (SVD), which employs unitary transform matrices instead of discrete Fourier transform matrix that is used in the traditional tensor SVD. The main motivation is that a lower tubal rank tensor can be obtained by usin…
The Plancherel theorem for Fourier--Laplace--Nahm transform for connections on the projective linemath.DG
We prove that the Fourier--Laplace--Nahm transform for connections on the projective line is a hyper-Kähler isometry.
Transformers improve with Fourier integral attentions.
problem Inefficiency of dot-product attention in capturing feature dependencies.
method Interpreted attention as kernel regression, proposed FourierFormer with generalized Fourier integral kernels.
result FourierFormer achieves better accuracy and reduces redundancy.
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.
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.
In this paper we prove a new inversion theorem and a refinement of an old support theorem for two Radon transforms on a symmetric space. Included are some new identities for the Abel transform and some results about the Fourier transform from a joint work with Rawat, Sengupta and Sitaram.
Given two compact hyperkähler surfaces and and a holomorphic vector bundle on , which is a generalized instanton, one can define a Fourier-Mukai transform, which, under suitable assumptions, maps vector bundles on to vector bundles on . If and are dual complex tori, this transform …
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.
We propose Gaussian processes for signals over graphs (GPG) using the apriori knowledge that the target vectors lie over a graph. We incorporate this information using a graph- Laplacian based regularization which enforces the target vectors to have a specific profile in terms of graph Fourier transform coeffcients, fo…
The paper derives and proves the Helgason Fourier transform for vector bundle-valued differential forms on homogeneous spaces.
problem Deriving the Helgason Fourier transform for vector bundle-valued differential forms on homogeneous spaces.
method Employing the perspective of the functional equation satisfied by the classical Fourier transform, the paper derives the Helgason Fourier transform map and proves its properties.
result The Fourier transform is explicitly given and proven to be a map from vector bundle-valued differential forms to another vector bundle-valued differential form on the product space.
Controlling Statistical, Discretization, and Truncation Errors in Learning Fourier Linear Operatorsstat.ML
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 study establishes uncertainty principles on harmonic manifolds of rank one.
problem Developing uncertainty principles for harmonic manifolds of rank one.
method Derivation of various uncertainty principles including Heisenberg, Morgen, Schrödinger, and Hömanders principles.
result Generalization of Hausdorff-Young inequality to harmonic manifolds of rank one.
We conjecture an upper bound on the growth of the Yokota invariant of polyhedral graphs, extending a previous result on the growth of the -symbol. Using Barrett's Fourier transform we are able to prove this conjecture in a large family of examples. As a consequence of this result, we prove the Turaev-Viro Volume Co…
FourNet approximates financial transition densities using Fourier transforms.
problem Approximating transition densities in finance with high accuracy.
method FourNet is a novel FFNN with Gaussian activation, learning from characteristic functions.
result FourNet can approximate transition densities arbitrarily well with finite neurons.
Infrastructure monitoring is critical for safe operations and sustainability. Water distribution networks (WDNs) are large-scale networked critical systems with complex cascade dynamics which are difficult to predict. Ubiquitous monitoring is expensive and a key challenge is to infer the contaminant dynamics from parti…
Computing accurate estimates of the Fourier transform of analog signals from discrete data points is important in many fields of science and engineering. The conventional approach of performing the discrete Fourier transform of the data implicitly assumes periodicity and bandlimitedness of the signal. In this paper, we…
Many neural speech enhancement and source separation systems operate in the time-frequency domain. Such models often benefit from making their Short-Time Fourier Transform (STFT) front-ends trainable. In current literature, these are implemented as large Discrete Fourier Transform matrices; which are prohibitively inef…
Monotone 2D Integration Scheme for Mean-CVaR Optimization via Fourier-Trained Transition Kernelsmath.OC
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.
Quantum Fourier Transform aids machine learning inference.
problem Generalizing from finite data samples to ground truth.
method Inspired by quantum algorithms, uses Quantum Fourier Transform to expose invariant subspace for data comparison.
result Proposes a concrete implementation for machine learning applications leveraging symmetries.