ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “graph convolutional filters”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGcs.AIcs.IREmpiricalRecentJun 19, 2026

Memory Is No Longer a Bottleneck: Memory-Efficient Graph Filtering for Scalable Collaborative Filtering

Jin-Duk Park, Won-Yong Shin

This paper proposes Mem-GF, a memory-efficient graph filtering-based collaborative filtering method that approximates polynomial graph filters using Krylov subspaces, achieving significant memory savi…

View →
cs.LGcs.AIEmpiricalRecentJul 7, 2026

Graph Convolutional Attention: A Spectral Perspective on Graph Denoising and Diffusion

Shervin Khalafi, Igor Krawczuk, Sergio Rozada, Charilaos Kanatsoulis +2 more

This paper introduces Spectral Attention and Graph Convolutional Attention (GCA) for denoising graphs, which outperforms linear attention and provably utilizes the input graph spectrum.

View →
stat.MLcs.LGcs.SITheoreticalRecentJun 25, 2026

Directed Graph Topology Inference via Graph Filter Identification

Rasoul Shafipour, Andrei Buciulea, Santiago Segarra, Antonio G. Marques +1 more

This paper addresses the problem of inferring a directed network from nodal measurements using graph convolutional filters and identifies the diffusion filter and network topology.

View →
cs.AIcs.DBcs.DSEmpiricalRecentJun 23, 2026

Can Aggregate Invariants Accelerate Continuous Subgraph Matching? Limits, Laws, and a Dynamic Spectral Index

Minghao Chen, Jiale Zheng

This paper investigates the use of spectral filtering for continuous subgraph matching over dynamic graphs and presents three key findings.

View →
eess.SPcs.LGEmpiricalRecentJun 22, 2026

Low-rank Updates in Slowly Time-varying Graphs for Spatial-Temporal Signal Interpolation

Saghar Bagheri, Gene Cheung, Tim Eadie, Antonio Ortega

This paper models the changes in graph adjacency matrices over time as a low-rank matrix and develops a method for jointly interpolating signals and estimating graph adjacency matrices using this assu…

View →
cs.LGcs.AIRecentMay 29, 2026

On Efficient Scaling of GNNs via IO-Aware Layers Implementations

Daria Fomina, Daniil Krasylnikov, Alexey Boykov, Andrey Dolgovyazov +2 more

This paper develops specialized, I/O-aware GPU kernels for common GNN layer types, achieving significant speedups and memory reductions compared to existing frameworks.

View →
cs.LGEmpiricalRecentJun 30, 2026

FedLAB: Traceable Semantic Codebooks for Federated Multimodal Graph Foundation Learning

Zekai Chen, Kairui Yang, Xuaner Chen, Xunkai Li +3 more

The paper proposes FedLAB, a traceable semantic codebook framework for federated multimodal graph foundation learning, which organizes multimodal graph knowledge into hierarchical codebooks and refine…

View →
cs.IRcs.AIEmpiricalRecentJun 18, 2026

Structuring and Tokenizing Distributed User Interest Context for Generative Recommendation

Ruizhong Qiu, Yinglong Xia, Dongqi Fu, Hanqing Zeng +5 more

This paper proposes G2Rec, a scalable framework for industrial-scale generative recommendation that unifies graph-based user co-engagement modeling and semantic tokenization.

View →
cs.LGcs.AIRecentJun 1, 2026

GJDNet: Robust Graph Neural Networks via Joint Disentangled Learning Against Adversarial Attacks

Canyixing Cui, Tao Wu, Xingping Xian, Xiao-Ke Xu +2 more

GJDNet proposes a joint disentanglement framework to enhance the robustness of Graph Neural Networks against adversarial attacks by simultaneously stabilizing node representations and decision boundar…

View →
cs.LGstat.MLRecentJun 3, 2026

Graph Cascades: Contagion-Based Mesoscopic Rewiring for Structure-Aware Graph Machine Learning

Meher Chaitanya, My Le, Luana Ruiz

The paper introduces Graph Cascades, a mesoscopic rewiring technique that enhances Graph Neural Networks by promoting node pairs with strong multi-hop connections to direct edges, improving performanc…

View →
cs.CVcs.AIEmpiricalRecentJun 10, 2026

Reroute, Don't Remove: Recoverable Visual Token Routing for Vision-Language Models

Cheng-Yu Yang, Shao-Yuan Lo, Yu-Lun Liu

肖代替了视觉令牌的永久删除,通过可恢复的路由来改进视觉语言模型的性能

View →
cs.LGcs.AIRecentMay 27, 2026

Evolutionary Refinement of Generative Graph Topologies: A Hybrid WGAN-GA Approach

James Sargant, Seyedeh Ava Razi Razavi, Renata Dividino, Sheridan Houghten

The paper introduces a hybrid WGAN-GA framework that uses a Genetic Algorithm (GA) to refine graphs generated by a GAN, significantly reducing structural deviations and improving realism.

View →
stat.MLcs.CYcs.LGEmpiricalRecentJun 16, 2026

Geometrical fairness in graph neural networks

Arturo Pérez-Peralta, Sandra Benítez-Peña, Blas Kolic, Rosa E. Lillo

This paper proposes a fairness-aware adaptation of graph-based diffusion methods by modifying the Laplacian operator to mitigate bias-related components.

View →
cs.LGcs.IREmpiricalRecentJul 20, 2026

ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search

Zheqi Shen, Jingbo Su, Zijin Wan, Yan Gu +1 more

ANNLib is a library for Approximate Nearest Neighbor Search (ANNS) providing high performance and flexible functionality using graph-based algorithms and data structures.

View →
cs.LGcs.AIRecentMay 29, 2026

Scaling Higher-Order Graph Learning with Maximal Clique Complexes

Antoine Vialle, Aref Einizade, Fragkiskos D. Malliaros, Jhony H. Giraldo

This paper proposes a scalable topological learning framework for higher-order graph representation by introducing simplified and factored cellular Weisfeiler Leman tests and a novel random walk metho…

View →
cs.DCcs.LGEmpiricalRecentJul 19, 2026

Taurus: Accelerating Out-of-Core Graph Neural Network Inference on Billion-Scale Graphs

Pranjal Naman, Yogesh Simmhan

Taurus is a single-machine system for efficient Graph Neural Network (GNN) inference on large-scale graphs that do not fit in RAM, using source-centric broadcasts and a pipelined GPU-CPU-SSD hierarchy…

View →
cs.CCTheoreticalRecentJul 21, 2026

On the Complexity of Graph Edit Distance in Restricted Graph Classes

Maximilian Limmer, Nils M. Kriege

The paper investigates the relationship between graph classes, edit cost functions, and computational complexity of the graph edit distance, providing polynomial-time reductions and correspondences.

View →
stat.MLcs.AIcs.LGTheoreticalRecentJul 8, 2026

DiPhon: Diffusion on Graphons for Scalable Graph Generation

Sergio Rozada, Yiming Qin, Manuel Madeira, Pascal Frossard +1 more

This paper introduces DiPhon, a diffusion framework for size-scalable graph generation, using a continuous diffusion process on the graphon space and a discretized graph-level process.

View →