all AI news
Rethinking the Graph Polynomial Filter via Positive and Negative Coupling Analysis
April 17, 2024, 4:41 a.m. | Haodong Wen, Bodong Du, Ruixun Liu, Deyu Meng, Xiangyong Cao
cs.LG updates on arXiv.org arxiv.org
Abstract: Recently, the optimization of polynomial filters within Spectral Graph Neural Networks (GNNs) has emerged as a prominent research focus. Existing spectral GNNs mainly emphasize polynomial properties in filter design, introducing computational overhead and neglecting the integration of crucial graph structure information. We argue that incorporating graph information into basis construction can enhance understanding of polynomial basis, and further facilitate simplified polynomial filter design. Motivated by this, we first propose a Positive and Negative Coupling Analysis …
abstract analysis arxiv computational cs.lg cs.si design filter filters focus gnns graph graph neural networks information integration negative networks neural networks optimization polynomial positive research the graph type via
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Risk Management - Machine Learning and Model Delivery Services, Product Associate - Senior Associate-
@ JPMorgan Chase & Co. | Wilmington, DE, United States
Senior ML Engineer (Speech/ASR)
@ ObserveAI | Bengaluru