Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2309.14907

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2309.14907 (cs)
[Submitted on 26 Sep 2023 (v1) , last revised 3 Jun 2025 (this version, v2)]

Title: Label Deconvolution for Node Representation Learning on Large-scale Attributed Graphs against Learning Bias

Title: 对抗学习偏差的大规模属性图的节点表示学习的标签去卷积

Authors:Zhihao Shi, Jie Wang, Fanghua Lu, Hanzhu Chen, Defu Lian, Zheng Wang, Jieping Ye, Feng Wu
Abstract: Node representation learning on attributed graphs -- whose nodes are associated with rich attributes (e.g., texts and protein sequences) -- plays a crucial role in many important downstream tasks. To encode the attributes and graph structures simultaneously, recent studies integrate pre-trained models with graph neural networks (GNNs), where pre-trained models serve as node encoders (NEs) to encode the attributes. As jointly training large NEs and GNNs on large-scale graphs suffers from severe scalability issues, many methods propose to train NEs and GNNs separately. Consequently, they do not take feature convolutions in GNNs into consideration in the training phase of NEs, leading to a significant learning bias relative to the joint training. To address this challenge, we propose an efficient label regularization technique, namely Label Deconvolution (LD), to alleviate the learning bias by a novel and highly scalable approximation to the inverse mapping of GNNs. The inverse mapping leads to an objective function that is equivalent to that by the joint training, while it can effectively incorporate GNNs in the training phase of NEs against the learning bias. More importantly, we show that LD converges to the optimal objective function values by the joint training under mild assumptions. Experiments demonstrate LD significantly outperforms state-of-the-art methods on Open Graph Benchmark datasets.
Abstract: 属性图上的节点表示学习——其中的节点与丰富的属性(例如文本和蛋白质序列)相关联——在许多重要的下游任务中起着至关重要的作用。 为了同时编码属性和图结构,近期的研究将预训练模型与图神经网络(GNNs)相结合,其中预训练模型作为节点编码器(NEs)来编码属性。 由于在大规模图上联合训练大型NEs和GNNs存在严重的可扩展性问题,许多方法提出分别训练NEs和GNNs。 因此,在NEs的训练阶段没有考虑GNNs中的特征卷积,导致相对于联合训练有显著的学习偏差。 为了解决这一挑战,我们提出了一种高效的标签正则化技术,即标签解卷积(LD),通过一种新颖且高度可扩展的GNN逆映射近似来减轻学习偏差。 逆映射导致的目标函数等效于联合训练的结果,同时可以在NEs的训练阶段有效结合GNNs以对抗学习偏差。 更重要的是,我们证明了在轻度假设下,LD收敛到联合训练下的最优目标函数值。 实验表明,LD在Open Graph Benchmark数据集上显著优于最先进的方法。
Subjects: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI)
Cite as: arXiv:2309.14907 [cs.LG]
  (or arXiv:2309.14907v2 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2309.14907
arXiv-issued DOI via DataCite

Submission history

From: Zhihao Shi [view email]
[v1] Tue, 26 Sep 2023 13:09:43 UTC (10,295 KB)
[v2] Tue, 3 Jun 2025 12:43:20 UTC (10,337 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.LG
< prev   |   next >
new | recent | 2023-09
Change to browse by:
cs
cs.AI

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号