all AI news
Optimizing Polynomial Graph Filters: A Novel Adaptive Krylov Subspace Approach
March 14, 2024, 4:41 a.m. | Keke Huang, Wencai Cao, Hoang Ta, Xiaokui Xiao, Pietro Li\`o
cs.LG updates on arXiv.org arxiv.org
Abstract: Graph Neural Networks (GNNs), known as spectral graph filters, find a wide range of applications in web networks. To bypass eigendecomposition, polynomial graph filters are proposed to approximate graph filters by leveraging various polynomial bases for filter training. However, no existing studies have explored the diverse polynomial graph filters from a unified perspective for optimization.
In this paper, we first unify polynomial graph filters, as well as the optimal filters of identical degrees into the …
abstract applications arxiv cs.lg eess.sp filter filters gnns graph graph neural networks however networks neural networks novel polynomial studies training type web
More from arxiv.org / cs.LG updates on arXiv.org
Digital Over-the-Air Federated Learning in Multi-Antenna Systems
2 days, 11 hours ago |
arxiv.org
Bagging Provides Assumption-free Stability
2 days, 11 hours ago |
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
Research Scientist, Demography and Survey Science, University Grad
@ Meta | Menlo Park, CA | New York City
Computer Vision Engineer, XR
@ Meta | Burlingame, CA