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.

169,181 papers · 148 categories

Trend · papers per month

0111 · Nov 201619922001200920182026
11 results for graph-wavelet

We propose a new framework for manifold denoising based on processing in the graph Fourier frequency domain, derived from the spectral decomposition of the discrete graph Laplacian. Our approach uses the Spectral Graph Wavelet transform in order to per- form non-iterative denoising directly in the graph frequency domai…

2016-11-29abs ↗pdf ↗

Graph scattering transforms are stable to metric perturbations of network topology.

problem Stability of graph data representations under metric perturbations.
method Extending scattering transforms to network data using multiresolution graph wavelets and graph convolutions.
result Graph scattering transforms are stable to metric perturbations of the underlying network topology.

Proposes a new dictionary learning method for high-dimensional graph signals.

problem Challenges of traditional sparse representation methods in high-dimensional graph signals.
method Integrates graph topology implicitly through sparse combinations of graph-wavelet functions and explicitly through graph constraints.
result Demonstrates effectiveness in high-dimensional graph signal processing.

New spectral triples for higher-rank graphs linked to wavelet decompositions.

problem Creating spectral triples for higher-rank graph CC^*-algebras.
method Generalizing spectral triples from Cuntz-Krieger algebras to higher-rank graph CC^*-algebras and connecting them to wavelet decompositions.
result Wavelet decompositions describe eigenspaces of Dirac operators in these spectral triples.

A new GNN module learns geometric scattering features for better graph classification and feature exploration.

problem Learning long-range graph relations and extracting meaningful features from graphs.
method Proposes a learnable geometric scattering (LEGS) module in graph neural networks (GNNs), incorporating wavelet filters.
result LEGS-based GNNs outperform existing methods in graph classification and feature extraction tasks.

Graph classification improved using spectral features and wavelet filters.

problem Categorizing graphs based on their structure and node attributes.
method Derived spectral features from graph signal processing, designed two Gaussian process models: one simple and one sophisticated.
result Simple and sophisticated Gaussian process models yield competitive performance, including well-calibrated uncertainty estimates.

Harmonic analysis on directed graphs for signal modeling and semi-supervised learning.

problem Signal analysis on directed graphs.
method Introduced a Fourier-type basis using eigenvectors of the random walk operator, developed wavelet transforms for multi-scale analysis.
result Efficiency of the proposed framework for semi-supervised learning and signal modeling on directed graphs.

SpGAT learns graph representations using spectral attention for efficiency.

problem Efficiently capturing global graph patterns with minimal parameters.
method Introduces Spectral Graph Attention Network (SpGAT) using spectral domain attention mechanisms and a fast Chebychev approximation.
result SpGAT achieves better global pattern recognition with fewer parameters compared to GAT.