paper-with-me

Papers

Multi-task Self-distillation for Graph-based Semi-Supervised Learning

2021-12-02 · Yating Ren, Junzhong Ji, Lingfeng Niu, Minglong Lei

Graph convolutional networks have made great progress in graph-based semi-supervised learning. Existing methods mainly assume that nodes connected by graph edges are prone to have similar attributes and labels, so that the features smoothed by local graph structures can reveal the class similarities. However, there often exist mismatches between graph structures and labels in many real-world scenarios, where the structures may propagate misleading features or labels that eventually affect the model performance. In this paper, we propose a multi-task self-distillation framework that injects self-supervised learning and self-distillation into graph convolutional networks to separately address the mismatch problem from the structure side and the label side. First, we formulate a self-supervision pipeline based on pre-text tasks to capture different levels of similarities in graphs. The feature extraction process is encouraged to capture more complex proximity by jointly optimizing the pre-text task and the target task. Consequently, the local feature aggregations are improved from the structure side. Second, self-distillation uses soft labels of the model itself as additional supervision, which has similar effects as label smoothing. The knowledge from the classification pipeline and the self-supervision pipeline is collectively distilled to improve the generalization ability of the model from the label side. Experiment results show that the proposed method obtains remarkable performance gains under several classic graph convolutional architectures.

📄 PDF Abstract BibTeX arXiv:2112.01174

Code (0)

등록된 구현이 없습니다.

Tasks

Node Classification

Similar Papers 제목 키워드 기반

Iterative Graph Self-Distillation

2020-10-23 · HANLIN ZHANG, Shuai Lin, Weiyang Liu, Pan Zhou 외

Recently, there has been increasing interest in the challenge of how to discriminatively vectorize graphs. To address this, we propose a method called Iterative Graph Self-Distillation (IGSD) which learns graph-level rep…

Contrastive LearningGraph LearningKnowledge Distillation

CXR Segmentation by AdaIN-based Domain Adaptation and Knowledge Distillation

2021-04-13 · Yujin Oh, Jong Chul Ye

As segmentation labels are scarce, extensive researches have been conducted to train segmentation networks with domain adaptation, semi-supervised or self-supervised learning techniques to utilize abundant unlabeled data…

Domain AdaptationKnowledge DistillationSegmentationSelf-Supervised Learning

A Self-Paced Mixed Distillation Method for Non-Autoregressive Generation

2022-05-23 · Weizhen Qi, Yeyun Gong, Yelong Shen, Jian Jiao 외

Non-Autoregressive generation is a sequence generation paradigm, which removes the dependency between target tokens. It could efficiently reduce the text generation latency with parallel decoding in place of token-by-tok…

Question GenerationQuestion-GenerationText Generation

Dynamic Sub-graph Distillation for Robust Semi-supervised Continual Learning

2023-12-27 · Yan Fan, Yu Wang, Pengfei Zhu, QinGhua Hu

Continual learning (CL) has shown promising results and comparable performance to learning at once in a fully supervised manner. However, CL strategies typically require a large number of labeled samples, making their re…

Continual Learninggraph constructionKnowledge Distillation

Multi-Scale Contrastive Siamese Networks for Self-Supervised Graph Representation Learning

2021-05-12 · Ming Jin, Yizhen Zheng, Yuan-Fang Li, Chen Gong 외

Graph representation learning plays a vital role in processing graph-structured data. However, prior arts on graph representation learning heavily rely on labeling information. To overcome this problem, inspired by the r…

Contrastive LearningGraph Representation LearningRepresentation Learning