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

1122 · Oct 202219922001200920172026
7 results for oversquashing

We analyze oversquashing in topological message-passing using relational structures.

problem Oversquashing in topological message-passing remains understudied.
method A unifying axiomatic framework that bridges graph and topological message-passing.
result Potential to advance topological deep learning.

FoSR adds edges to graphs to prevent oversquashing and oversmoothing in GNNs.

problem Oversquashing and oversmoothing in graph neural networks (GNNs).
method First-order spectral rewiring to add edges based on spectral expansion, combined with a relational architecture.
result Our algorithm outperforms existing graph rewiring methods in graph classification tasks.

MFNs parameterize non-local interactions through matrix equivariant functions, improving graph neural network performance.

problem Challenges in modeling non-local interactions in graphs, such as oversmoothing and oversquashing.
method Matrix Function Neural Networks (MFNs) using resolvent expansions for non-local interactions.
result Achieves state-of-the-art performance in graph benchmarks and captures intricate non-local interactions.

SCNode improves node embeddings for GNNs in both homophilic and heterophilic graphs.

problem Challenges in node representation quality and generalization in GNNs, especially in heterophilic graphs.
method SCNode integrates spatial and contextual information to create more discriminative and structurally aware node embeddings.
result SCNode achieves superior performance over conventional GNN models on benchmark datasets.

MPNNs struggle with class-bottlenecks and heterophily, leading to performance limitations.

problem Performance limitations of MPNNs under heterophily and structural bottlenecks.
method A statistical framework decomposing model performance into SNR components and proving bounds on sensitivity.
result Optimal graph structures for maximizing higher-order homophily are disjoint unions of single-class and two-class-bipartite clusters.