AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

SWING: Unlocking Implicit Graph Representations for Graph Random Features

Alessandro Manenti, Kumar Avinava Dubey, Arijit Sehanobish, Cesare Alippi, Krzysztof Marcin Choromanski

ICML 2026 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
add SWING-approximated graph-kernel soft attention maskViT · ImageNet valtop-1 accuracy: 80.10 -> 80.34Improved
add SWING-approximated graph-kernel soft attention maskViT · Places365 valtop-1 accuracy: 55.78 -> 55.97Improved
add standard GRF graph-kernel soft attention maskViT · ImageNet valtop-1 accuracy: 80.10 -> 80.09No clear effect
add standard GRF graph-kernel soft attention maskViT · Places365 valtop-1 accuracy: 55.78 -> 55.39Hurt
replace GRF node walks with SWING space walksGRFs · Thingi10K vertex normal predictioncosine similarityNo clear effect
replace GRF node walks with SWING space walksGRFs · synthetic point clouds kernel approximationFrobenius norm errorImproved
replace GRF node walks with SWING space walksGRFs · synthetic point cloudsinference timeImproved
increase number of random features (ablation)SWING · synthetic point cloudsFrobenius norm errorImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy