聊城网站建设百度账号申诉
POLYGCL: GRAPH CONTRASTIVE LEARNING VIA LEARNABLE SPECTRAL POLYNOMIAL filters
今天由于开了一天的积极分子会议以及要写汇报，因此，只来得及学一会。
摘要
第一步，设定背景
Recently, Graph Contrastive Learning (GCL) has achieved significantly superior performance in self-supervised graph representation learning.
这句话确立了索要解决问题的背景和重要性。他指明了对比学习在无监督图表示学习的重要性
第二步，提出问题：
However, the existing GCL technique has inherent smooth characteristics because of its low-pass GNN encoder and objective based on homophily assumption, which poses a challenge when applied to heterophilic graphs.
在这里，作者详细的介绍了传统方法的挑战或者缺点，其标明传统GCN使用的低频GNN的假设在异配图上不成立
第三步，引入有监督学习的方法：
In supervised learning tasks, spectral GNNs with polynomial approximation excel in both homophilic and heterophilic settings by adaptively fitting graph filters of arbitrary shapes.
在监督领域，自适应匹配任意形状滤波器的谱GNN表现情况很出色
第四步，很自然的，他们在无监督领域匮乏
Based on the above analysis, a natural question arises: Can we incorporate the excellent properties of spectral polynomial filters into graph contrastive learning?
那么，有监督领域该如何做呢？
第五步，引入解决方案：
从高通信息来实现解决异配性问题。
第六步，解决方案以及细节
We propose POLYGCL, a GCL pipeline that utilizes polynomial filters to achieve contrastive learning between the low-pass and highpass views. Specifically, POLYGCL utilizes polynomials with learnable filters to generate different spectral views and an objective that incorporates high-pass information through a linear combination.We theoretically prove that POLYGCL outperforms previous GCL paradigms when applied to graphs with varying levels of homophily.