Contrastive Learning Research Articles

Unsupervised Domain Adaptation with Contrastive Learning-Based Discriminative Feature Augmentation for RS Image Classification

High- and very high-resolution (HR, VHR) remote sensing (RS) images can provide comprehensive and intricate spatial information for land cover classification, which is particularly crucial when analyzing complex built-up environments. However, the application of HR and VHR images to large-scale and detailed land cover mapping is always constrained by the intricacy of land cover classification models, the exorbitant cost of collecting training samples, and geographical changes or acquisition conditions. To overcome this limitation, we propose an unsupervised domain adaptation (UDA) with contrastive learning-based discriminative feature augmentation (CLDFA) for RS image classification. In detail, our method first utilizes contrastive learning (CL) through a memory bank in order to memorize sample features and improve model performance, where the approach employs an end-to-end Siamese network and incorporates dynamic pseudo-label assignment and class-balancing strategies for adaptive domain joint learning. By transferring classification models trained on a source domain (SD) to an unlabeled target domain (TD), our proposed UDA method enables large-scale land cover mapping. We conducted experiments using a massive five billion-pixels dataset as the SD and tested the HR and VHR RS images of five typical Chinese cities as the TD and applied the method on the completely unlabeled world view 3 (WV3) image of Urumqi city. The experimental results demonstrate that our method excels in large-scale HR and VHR RS image classification tasks, highlighting the advantages of semantic segmentation based on end-to-end deep convolutional neural networks (DCNNs).

Dual Information Enhanced Multiview Attributed Graph Clustering.

Multiview attributed graph clustering is an important approach to partition multiview data based on the attribute characteristics and adjacent matrices from different views. Some attempts have been made in using graph neural network (GNN), which have achieved promising clustering performance. Despite this, few of them pay attention to the inherent specific information embedded in multiple views. Meanwhile, they are incapable of recovering the latent high-level representation from the low-level ones, greatly limiting the downstream clustering performance. To fill these gaps, a novel dual information enhanced multiview attributed graph clustering (DIAGC) method is proposed in this article. Specifically, the proposed method introduces the specific information reconstruction (SIR) module to disentangle the explorations of the consensus and specific information from multiple views, which enables graph convolutional network (GCN) to capture the more essential low-level representations. Besides, the contrastive learning (CL) module maximizes the agreement between the latent high-level representation and low-level ones and enables the high-level representation to satisfy the desired clustering structure with the help of the self-supervised clustering (SC) module. Extensive experiments on several real-world benchmarks demonstrate the effectiveness of the proposed DIAGC method compared with the state-of-the-art baselines.

Generalized zero-shot learning for classifying unseen wafer map patterns

A data-driven approach for classifying defect patterns in wafer maps is crucial for automating the quality assurance process during semiconductor fabrication. Existing works have proposed machine learning-based methods to accomplish this important problem. However, many of these approaches assume model training from a supervised learning perspective, in which a substantial number of annotated wafer maps, each with its actual defect pattern, need to be available. Due to the cost and time required to generate such an annotated dataset, recently a few works started to explore the problem of identifying previously unseen defect patterns. However, the methods proposed in those works are able to only detect the presence of unseen defect patterns without identifying what those defect patterns are. To address this issue, this paper introduces a generalized zero-shot learning (GZSL)-based framework capable of classifying and identifying both seen and unseen defect patterns. It consists of a visual feature extraction phase based on semi-supervised contrastive learning (CL), a clustering phase using distance-based initialization, and an alignment phase based on the Wasserstein-Distance-based Visual Structure Constraint method. Our framework further reduces the need for expensive annotated datasets previously required to train supervised learning-based models, thereby improving the practicality of the data-driven approach for wafer map pattern classification. Furthermore, our framework introduces an effective way of incorporating additional semantic information in wafer map pattern classification that traditionally relied on training models solely from wafer maps. To the best of the authors’ knowledge, our work is the first work to adopt GZSL in wafer map pattern classification.

HICL: Hierarchical Intent Contrastive Learning for sequential recommendation

Users’ diverse intentions drive the subsequent interaction based on users’ dynamic behavior trajectories. Despite the impressive progress of existing work on capturing the user’s intent, these methods still have the following challenges: (1) How can the intent effectively be exploited in sparse and long-distance interacted items? (2) How to improve the performance of a recommendation system by fusing spatial and temporal information? To further exploit the intent from local and global contexts, we present a novel recommendation framework, namely hierarchical intent Contrastive Learning (HICL) for SR. First, a graph encoder is employed to enhance item embedding by incorporating global context information. And then, the sequential encoder is leveraged as a prediction baseline from a historical perspective. Moreover, diverse intent Contrastive Learning branches are integrated to model user latent by utilizing a new loss function. Specifically, sequence contrastive learning (CL) employs sequence augment to model the users’ local intent, while graph CL employs graph augment and feature clustering to model the users’ global latent from semantic and structural graph views. Extensive experiments are conducted on four real-world datasets, including highly sparse datasets, and the experiment results demonstrate the superiority of our model over the state-of-the-art.

Coarse-to-Fine Contrastive Learning on Graphs.

Inspired by the impressive success of contrastive learning (CL), a variety of graph augmentation strategies have been employed to learn node representations in a self-supervised manner. Existing methods construct the contrastive samples by adding perturbations to the graph structure or node attributes. Although impressive results are achieved, it is rather blind to the wealth of prior information assumed: with the increase of the perturbation degree applied on the original graph: 1) the similarity between the original graph and the generated augmented graph gradually decreases and 2) the discrimination between all nodes within each augmented view gradually increases. In this article, we argue that both such prior information can be incorporated (differently) into the CL paradigm following our general ranking framework. In particular, we first interpret CL as a special case of learning to rank (L2R), which inspires us to leverage the ranking order among positive augmented views. Meanwhile, we introduce a self-ranking paradigm to ensure that the discriminative information among different nodes can be maintained and also be less altered to the perturbations of different degrees. Experiment results on various benchmark datasets verify the effectiveness of our algorithm compared with the supervised and unsupervised models.

Universal 12-lead ECG representation for signal denoising and cardiovascular disease detection by fusing generative and contrastive learning

With the wide use of electrocardiogram (ECG) technology, more and more ECGs have been collected and stored. However, ECG labeling is costly and laborious, the utilization of unlabeled ECG is still a critical challenge. Self-supervised learning (SSL) is a way to deal with this problem, which can learn representations from unlabeled ECG and use them for downstream tasks. In this study, a novel SSL model that fuses generative learning (denoising autoencoder, DAE) and contrastive learning (CL) is proposed to learn robust representations from unlabeled ECG for downstream denoising and classification. The 12-lead ECGs are separated into one-dimensional single-lead ECGs and ECG-specific noises are added to the original ECGs as the data augmentation method. To improve the model's denoising and feature extraction abilities, the reconstruction loss and contrastive loss are combined during the pretraining phase. In the downstream classification task, a multi-branch network is used to enhance the correlation between different ECG leads. As a result, it improves the denoising performance over the standard DAE by an average of 5.20%. In the classification tasks for the Chapman, PTB-XL, and CPSC2018 databases, compared to existing work, the accuracies in linear probe are increased by at least 2.49%, 1.09%, and 2.61%, respectively. In addition, an SoC (system-on-a-chip) based heterogeneous deployment scheme is designed. It is 13.69–14.26 times faster in inference than pure software deployment and enables real-time detection of ECG signals. The proposed method provides a good way to utilize unlabeled ECG, and the designed deployment scheme has great potential for medical applications.

Contrastive Masked Autoencoders are Stronger Vision Learners.

Masked image modeling (MIM) has achieved promising results on various vision tasks. However, the limited discriminability of learned representation manifests there is still plenty to go for making a stronger vision learner. Towards this goal, we propose Contrastive Masked Autoencoders (CMAE), a new self-supervised pre-training method for learning more comprehensive and capable vision representations. By elaboratively unifying contrastive learning (CL) and masked image model (MIM) through novel designs, CMAE leverages their respective advantages and learns representations with both strong instance discriminability and local perceptibility. Specifically, CMAE consists of two branches where the online branch is an asymmetric encoder-decoder and the momentum branch is a momentum updated encoder. During training, the online encoder reconstructs original images from latent representations of masked images to learn holistic features. The momentum encoder, fed with the full images, enhances the feature discriminability via contrastive learning with its online counterpart. To make CL compatible with MIM, CMAE introduces two new components, i.e., pixel shifting for generating plausible positive views and feature decoder for complementing features of contrastive pairs. Thanks to these novel designs, CMAE effectively improves the representation quality and transfer performance over its MIM counterpart. CMAE achieves the state-of-the-art performance on highly competitive benchmarks of image classification, semantic segmentation and object detection. Notably, CMAE-Base achieves 85.3% top-1 accuracy on ImageNet and 52.5% mIoU on ADE20k, surpassing previous best results by 0.7% and 1.8% respectively.

Self-Supervised Learning and Multisource Heterogeneous Information Fusion Based Quality Anomaly Detection for Heavy-Plate Shape

Plate shape quality anomaly detection suffers from the problems of less labeled and multisource heterogeneous (MSH) data due to the complex production process with multi-process and multi-equipment. To address these problems, this paper proposes a self-supervised learning framework based on MSH contrastive learning (MSH-CL). In the proposed framework, an encoder is designed to extract the MSH information, which contains an MSH feature extract network (MSH-FEN) and an MSH feature fusion network (MSH-FFN). In MSH-FEN, a two-pathway CNN network is employed to extract the MSH feature. Then, a cross-MSH (CMSH) data fusion strategy based on the attention mechanism is designed to characterize the relationship between the MSH data in the MSH-FFN. The learning process consists of two phases, namely the self-supervised feature learning phase based on the contrastive learning (CL) and the supervised fine-tuning phase. The former phase is responsible for training the encoder with massive unlabeled data. Then, a classifier followed by the encoder is built with less labeled data in the supervised fine-tuning phase, which is applied to plate shape quality anomaly detection. Finally, the experiments are carried out on the real-world data set collected from a heavy-plate production process. The experimental results demonstrate the effectiveness and superiority of the proposed approach. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Note to Practitioners</i> —This paper focuses on the problem of shape quality anomaly detection for the heavy-plate production process, which is crucial to steel-making. However, the most quality-relevant data-driven modeling approaches suffer from the problem of requiring massive labeled data. In addition, the data generated in the practice heavy-plate production process have the characteristics of multisource heterogeneous (MSH). Motivated by the challenge of the less labeled and MSH data modeling, this paper proposed a self-supervised feature learning approach to learn a feature encoder to model the MSH data. Then, fine-tuning is used to obtain the model to detect the plate shape quality. In the feature encoder, a cross-MSH (CMSH) data fusion strategy is proposed. Finally, the effectiveness of the proposed approach is demonstrated by comparing it with other advanced algorithms. The proposed approach can be extended to other heavy-plate quality anomaly detection problems with less labeled and MSH data.

Sequential Contrastive and Deep Learning Models to Identify Selective Butyrylcholinesterase Inhibitors.

Butyrylcholinesterase (BChE) is a target of interest in late-stage Alzheimer's Disease (AD) where selective BChE inhibitors (BIs) may offer symptomatic treatment without the harsh side effects of acetylcholinesterase (AChE) inhibitors. In this study, we explore multiple machine learning strategies to identify BIs in silico, optimizing for precision over all other metrics. We compare state-of-the-art supervised contrastive learning (CL) with deep learning (DL) and Random Forest (RF) machine learning, across single and sequential modeling configurations, to identify the best models for BChE selectivity. We used these models to virtually screen a vendor library of 5 million compounds for BIs and tested 20 of these compounds in vitro. Seven of the 20 compounds displayed selectivity for BChE over AChE, reflecting a hit rate of 35% for our model predictions, suggesting a highly efficient strategy for modeling selective inhibition.

GLSEC: Global and local semantic-enhanced contrastive framework for knowledge graph completion

Knowledge graph completion (KGC) aims to infer missing links between entities in knowledge graphs (KGs). Recently, models based on graph neural networks (GNNs) have gained widespread attention due to their effectiveness in leveraging the topological structure information of entities. Meanwhile, contrastive learning (CL) has been employed in GNNs-based models to provide more supervised signals for better entity representation in a self-supervised manner. However, existing methods overlook the potential global semantic collaboration among entities within the entire KG. And the application of CL in KGC models often adopt random graph augmentation or basic node structure contrast, leading to suboptimal performance. To tackle them, we propose a Global and Local Semantic-Enhanced Contrastive Framework (GLSEC) for KGC. Specifically, we develop a global Attribute-aware encoder to capture the global semantic features of entities based on an entity-entity Attribute Interaction Graph (AIG). Additionally, we design a Light Graph Aggregation Network (Light-GAN) that innovatively updates the global semantic features using the AIG, combining both efficiency and a lightweight design. Furthermore, we introduce a Global-Local cross-view Contrastive Learning (GLCL) method that contrasts embeddings from global and local views, thereby improving contrastive sample quality and boosting the model’s understanding of entities in various contexts. Extensive experiments show that our model outperforms state-of-the-art KGC methods on benchmark datasets FB15k-237 and WN18RR.

Graph Disentangled Contrastive Learning with Personalized Transfer for Cross-Domain Recommendation

Cross-Domain Recommendation (CDR) has been proven to effectively alleviate the data sparsity problem in Recommender System (RS). Recent CDR methods often disentangle user features into domain-invariant and domain-specific features for efficient cross-domain knowledge transfer. Despite showcasing robust performance, three crucial aspects remain unexplored for existing disentangled CDR approaches: i) The significance nuances of the interaction behaviors are ignored in generating disentangled features; ii) The user features are disentangled irrelevant to the individual items to be recommended; iii) The general knowledge transfer overlooks the user's personality when interacting with diverse items. To this end, we propose a Graph Disentangled Contrastive framework for CDR (GDCCDR) with personalized transfer by meta-networks. An adaptive parameter-free filter is proposed to gauge the significance of diverse interactions, thereby facilitating more refined disentangled representations. In sight of the success of Contrastive Learning (CL) in RS, we propose two CL-based constraints for item-aware disentanglement. Proximate CL ensures the coherence of domain-invariant features between domains, while eliminatory CL strives to disentangle features within each domains using mutual information between users and items. Finally, for domain-invariant features, we adopt meta-networks to achieve personalized transfer. Experimental results on four real-world datasets demonstrate the superiority of GDCCDR over state-of-the-art methods.

Web Semantic-Based Robust Graph Contrastive Learning for Recommendation via Invariant Learning

The use of contrastive learning (CL) in recommendation has advanced significantly. Recently, some works use perturbations in the embedding space to obtain enhanced views of nodes. This makes the representation distribution of nodes more even and then improve recommendation effectiveness. In this article, the authors provide an explanation on the role of added noises in the embedding space from the perspective of invariant learning and feature selection. Guided by this thinking, the authors devise a more reasonable method for generating random noises and put forward web semantic based robust graph contrastive learning for recommendation via invariant learning, a novel graph CL-based recommendation model, named RobustGCL. RobustGCL, randomly zeros the values of certain dimensions in the noise vectors at a fixed ratio. In this way, RobustGCL can identify invariant and variant features and then learn invariant and variant representations. Tests on publicly available datasets show that our proposed approach can learn invariant representations and achieve better performance.

NNC-GCN: Neighbours-to-Neighbours Contrastive Graph Convolutional Network for Semi-Supervised Classification

Contrastive learning (CL) is a popular learning paradigm in deep learning, which uses contrastive principle to learn low-dimensional embeddings, and has been applied in Graph Neural Networks (GNNs) successfully. Existing works of contrastive multi-view GNNs usually focus on point-to-point contrastive learning strategies. However, they neglect the local information in neighbors, which brings isolated positive samples. The quality of selected positive samples is hard to evaluate, and these samples may lead to invalid contrastiveness. Therefore, we propose a simple and efficient neighbors-to-neighbors contrastive graph neural network (NNC-GCN), which constructs a consistent multi-view by using the topologies of original input graphs. Moreover, we raise a new learning problem of unlabeled data base on these constructed multi-view topologies and propose a loss function NNC-InfoNCE to guide its learning process. The NNC-InfoNCE is an improved version of InfoNCE, which can be adapted to neighborhood-level contrast learning. Specifically, the neighborhoods and the remaining nodes of the selected anchor are weighted and treated as positive and negative sample sets. The experimental results show that our method is effective on public benchmark datasets.

Heterogeneous Information Crossing on Graphs for Session-Based Recommender Systems

Recommender systems are fundamental information filtering techniques to recommend content or items that meet users’ personalities and potential needs. As a crucial solution to address the difficulty of user identification and unavailability of historical information, session-based recommender systems provide recommendation services that only rely on users’ behaviors in the current session. However, most existing studies are not well-designed for modeling heterogeneous user behaviors and capturing the relationships between them in practical scenarios. To fill this gap, in this article, we propose a novel graph-based method, namely H eterogeneous I nformation C rossing on G raphs (HICG). HICG utilizes multiple types of user behaviors in the sessions to construct heterogeneous graphs, and captures users’ current interests with their long-term preferences by effectively crossing the heterogeneous information on the graphs. In addition, we also propose an enhanced version, named HICG-CL, which incorporates the contrastive learning (CL) technique to enhance item representation ability. By utilizing the item co-occurrence relationships across different sessions, HICG-CL improves the recommendation performance of HICG. We conduct extensive experiments on three real-world recommendation datasets, and the results verify that (i) HICG achieves state-of-the-art performance by utilizing multiple types of behaviors on the heterogeneous graph. (ii) HICG-CL further significantly improves the recommendation performance of HICG by the proposed contrastive learning module.

Multi-Modal Contrastive Learning for LiDAR Point Cloud Rail-Obstacle Detection in Complex Weather

Obstacle intrusion is a serious threat to the safety of railway traffic. LiDAR point cloud 3D semantic segmentation (3DSS) provides a new method for unmanned rail-obstacle detection. However, the inevitable degradation of model performance occurs in complex weather and hinders its practical application. In this paper, a multi-modal contrastive learning (CL) strategy, named DHT-CL, is proposed to improve point cloud 3DSS in complex weather for rail-obstacle detection. DHT-CL is a camera and LiDAR sensor fusion strategy specifically designed for complex weather and obstacle detection tasks, without the need for image input during the inference stage. We first demonstrate how the sensor fusion method is more robust under rainy and snowy conditions, and then we design a Dual-Helix Transformer (DHT) to extract deeper cross-modal information through a neighborhood attention mechanism. Then, an obstacle anomaly-aware cross-modal discrimination loss is constructed for collaborative optimization that adapts to the anomaly identification task. Experimental results on a complex weather railway dataset show that with an mIoU of 87.38%, the proposed DHT-CL strategy achieves better performance compared to other high-performance models from the autonomous driving dataset, SemanticKITTI. The qualitative results show that DHT-CL achieves higher accuracy in clear weather and reduces false alarms in rainy and snowy weather.

Contrastive Transfer Learning for Prediction of Adverse Events in Hospitalized Patients.

Deterioration index (DI) is a computer-generated score at a specific frequency that represents the overall condition of hospitalized patients using a variety of clinical, laboratory and physiologic data. In this paper, a contrastive transfer learning method is proposed and validated for early prediction of adverse events in hospitalized patients using DI scores. An unsupervised contrastive learning (CL) model with a classifier is proposed to predict adverse outcome using a single temporal variable (DI scores). The model is pretrained on an unsupervised fashion with large-scale time series data and fine-tuned with retrospective DI score data. The performance of this model is compared with supervised deep learning models for time series classification. Results show that unsupervised contrastive transfer learning with a classifier outperforms supervised deep learning solutions. Pretraining of the proposed CL model with large-scale time series data and fine-tuning that with DI scores can enhance prediction accuracy. A relationship exists between longitudinal DI scores of a patient and the corresponding outcome. DI scores and contrastive transfer learning can be used to predict and prevent adverse outcomes in hospitalized patients. This paper successfully developed an unsupervised contrastive transfer learning algorithm for prediction of adverse events in hospitalized patients. The proposed model can be deployed in hospitals as an early warning system for preemptive intervention in hospitalized patients, which can mitigate the likelihood of adverse outcomes.

Boosting Graph Contrastive Learning via Adaptive Sampling.

Contrastive learning (CL) is a prominent technique for self-supervised representation learning, which aims to contrast semantically similar (i.e., positive) and dissimilar (i.e., negative) pairs of examples under different augmented views. Recently, CL has provided unprecedented potential for learning expressive graph representations without external supervision. In graph CL, the negative nodes are typically uniformly sampled from augmented views to formulate the contrastive objective. However, this uniform negative sampling strategy limits the expressive power of contrastive models. To be specific, not all the negative nodes can provide sufficiently meaningful knowledge for effective contrastive representation learning. In addition, the negative nodes that are semantically similar to the anchor are undesirably repelled from it, leading to degraded model performance. To address these limitations, in this article, we devise an adaptive sampling strategy termed "AdaS." The proposed AdaS framework can be trained to adaptively encode the importance of different negative nodes, so as to encourage learning from the most informative graph nodes. Meanwhile, an auxiliary polarization regularizer is proposed to suppress the adverse impacts of the false negatives and enhance the discrimination ability of AdaS. The experimental results on a variety of real-world datasets firmly verify the effectiveness of our AdaS in improving the performance of graph CL.

Beyond Pattern Variance: Unsupervised 3-D Action Representation Learning With Point Cloud Sequence.

This work pays the first research effort to address unsupervised 3-D action representation learning with point cloud sequence, which is different from existing unsupervised methods that rely on 3-D skeleton information. Our proposition is built on the state-of-the-art 3-D action descriptor 3-D dynamic voxel (3DV) with contrastive learning (CL). The 3DV can compress the point cloud sequence into a compact point cloud of 3-D motion information. Spatiotemporal data augmentations are conducted on it to drive CL. However, we find that existing CL methods (e.g., SimCLR or MoCo v2) often suffer from high pattern variance toward the augmented 3DV samples from the same action instance, that is, the augmented 3DV samples are still of high feature complementarity after CL, while the complementary discriminative clues within them have not been well exploited yet. To address this, a feature augmentation adapted CL (FACL) approach is proposed, which facilitates 3-D action representation via concerning the features from all augmented 3DV samples jointly, in spirit of feature augmentation. FACL runs in a global-local way: one branch learns global feature that involves the discriminative clues from the raw and augmented 3DV samples, and the other focuses on enhancing the discriminative power of local feature learned from each augmented 3DV sample. The global and local features are fused to characterize 3-D action jointly via concatenation. To fit FACL, a series of spatiotemporal data augmentation approaches is also studied on 3DV. Wide-range experiments verify the superiority of our unsupervised learning method for 3-D action feature learning. It outperforms the state-of-the-art skeleton-based counterparts by 6.4% and 3.6% with the cross-setup and cross-subject test settings on NTU RGB + D 120, respectively. The source code is available at https://github.com/tangent-T/FACL.

Deep Multiview Clustering by Pseudo-Label Guided Contrastive Learning and Dual Correlation Learning.

Deep multiview clustering (MVC) is to learn and utilize the rich relations across different views to enhance the clustering performance under a human-designed deep network. However, most existing deep MVCs meet two challenges. First, most current deep contrastive MVCs usually select the same instance across views as positive pairs and the remaining instances as negative pairs, which always leads to inaccurate contrastive learning (CL). Second, most deep MVCs only consider learning feature or cluster correlations across views, failing to explore the dual correlations. To tackle the above challenges, in this article, we propose a novel deep MVC framework by pseudo-label guided CL and dual correlation learning. Specifically, a novel pseudo-label guided CL mechanism is designed by using the pseudo-labels in each iteration to help removing false negative sample pairs, so that the CL for the feature distribution alignment can be more accurate, thus benefiting the discriminative feature learning. Different from most deep MVCs learning only one kind of correlation, we investigate both the feature and cluster correlations among views to discover the rich and comprehensive relations. Experiments on various datasets demonstrate the superiority of our method over many state-of-the-art compared deep MVCs. The source implementation code will be provided at https://github.com/ShizheHu/Deep-MVC-PGCL-DCL.

Select Your Own Counterparts: Self-Supervised Graph Contrastive Learning With Positive Sampling.

Contrastive learning (CL) has emerged as a powerful approach for self-supervised learning. However, it suffers from sampling bias, which hinders its performance. While the mainstream solutions, hard negative mining (HNM) and supervised CL (SCL), have been proposed to mitigate this critical issue, they do not effectively address graph CL (GCL). To address it, we propose graph positive sampling (GPS) and three contrastive objectives. The former is a novel learning paradigm designed to leverage the inherent properties of graphs for improved GCL models, which utilizes four complementary similarity measurements, including node centrality, topological distance, neighborhood overlapping, and semantic distance, to select positive counterparts for each node. Notably, GPS operates without relying on true labels and enables preprocessing applications. The latter aims to fuse positive samples and enhance representative selection in the semantic space. We release three node-level models with GPS and conduct extensive experiments on public datasets. The results demonstrate the superiority of GPS over state-of-the-art (SOTA) baselines and debiasing methods. In addition, the GPS has also been proven to be versatile, adaptive, and flexible.