3 papers
cs.LG2026
Spectral Limits of Polynomial Graph Filters on the Long-Range Ising Model Benchmark
Amin Najafgholizadeh, Mohsen Afsharchi
The Long-Range Ising Model benchmark (LRIM) guarantees long-range dependence by construction: each label is the node's spin times the spin field convolved with a power-law coupling…
cs.LG2026
PATTERN Can Be Solved from Memory: Generator-Aware Baselines for Synthetic Node Classification
Amin Najafgholizadeh, Mohsen Afsharchi
PATTERN, a synthetic node-classification benchmark still used to rank graph networks, plants a random subgraph in a random host graph and asks which nodes belong to it. Its generat…
cs.LG2026
Fitting Every Hint Is Not Enough: Premature Floods in Recurrent Algorithmic Reasoners
Amin Najafgholizadeh, Mohsen Afsharchi
Recurrent algorithmic reasoners are trained with per-step hints on small graphs and run for many more steps on large ones. On breadth-first search in SALSA-CLRS, we find that a rea…