SLShaoqing Li
Shaoqing Li
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shaoqing Li has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Meng Qin
Department of Strategic and Advanced Interdisciplinary Research, Pengcheng Laboratory, Shenzhen 518055, China
1 shared publication - Wei Li
College of Computer and Information Sciences, Fujian Agriculture and Forestry University, Fuzhou 350002, China
1 shared publication
Latest Publications
- Open Access
Simple Yet Effective Self-Supervised Graph Learning with Inverse Laplacian
Self-supervised learning (SSL) has become a powerful paradigm for graph representation learning. However, most existing methods operate in the graph topology domain and rely on complex data augmentations or contrastive objectives, which constrain them to local structural information and hinder the effective modeling of global or long-range dependencies. In this work, we propose the inverse-filter graph neural network (IF-GNN), an alternative spectral-based method for SSL. IF-GNN employs a fixed spectral operator as a low-pass inverse filter, enabling efficient and label-free node representation learning in the spectral domain. The inverse filter can be interpreted as an infinite-order polynomial filter, allowing the model to aggregate high-order neighborhood information without layer stacking or explicit message passing. This design helps alleviate over-smoothing by avoiding repeated feature averaging and improves the interpretability of spectral SSL models. Extensive experiments on multiple benchmark datasets demonstrate that IF-GNN achieves competitive or superior performance compared to both spectral and self-supervised baselines, establishing inverse filtering as a new and effective spectral SSL paradigm.Open AccessSimple Yet Effective Self-Supervised Graph Learning with Inverse Laplacian
Self-supervised learning (SSL) has become a powerful paradigm for graph representation learning. However, most existing methods operate in the graph topology domain and rely on complex data augmentations or contrastive objectives, which constrain them to local structural information and hinder the effective modeling of global or long-range dependencies. In this work, we propose the inverse-filter graph neural network (IF-GNN), an alternative spectral-based method for SSL. IF-GNN employs a fixed spectral operator as a low-pass inverse filter, enabling efficient and label-free node representation learning in the spectral domain. The inverse filter can be interpreted as an infinite-order polynomial filter, allowing the model to aggregate high-order neighborhood information without layer stacking or explicit message passing. This design helps alleviate over-smoothing by avoiding repeated feature averaging and improves the interpretability of spectral SSL models. Extensive experiments on multiple benchmark datasets demonstrate that IF-GNN achieves competitive or superior performance compared to both spectral and self-supervised baselines, establishing inverse filtering as a new and effective spectral SSL paradigm.