activity
20242026
most citedLSEnet: Lorentz Structural Entropy Neural Network for Deep Graph Clustering

1 citations · 2 across the 15 of their papers we have counts for

collaborators
Showing 2024Show all

6 papers · 1 filter

cs.AI2024

Structural Entropy Guided Probabilistic Coding

Xiang Huang, Hao Peng, Li Sun +4

Probabilistic embeddings have several advantages over deterministic embeddings as they map each data point to a distribution, which better describes the uncertainty and complexity…

cs.LG2024

Spiking Graph Neural Network on Riemannian Manifolds

Li Sun, Zhenhao Huang, Qiqi Wan +2

Graph neural networks (GNNs) have become the dominant solution for learning on graphs, the typical non-Euclidean structures. Conventional GNNs, constructed with the Artificial Neur…

cs.LG2024★ 1 cited

LSEnet: Lorentz Structural Entropy Neural Network for Deep Graph Clustering

Li Sun, Zhenhao Huang, Hao Peng +3

Graph clustering is a fundamental problem in machine learning. Deep learning methods achieve the state-of-the-art results in recent years, but they still cannot work without predef…

cs.LG2024★ 1 cited

DeepRicci: Self-supervised Graph Structure-Feature Co-Refinement for Alleviating Over-squashing

Li Sun, Zhenhao Huang, Hua Wu +4

Graph Neural Networks (GNNs) have shown great power for learning and mining on graphs, and Graph Structure Learning (GSL) plays an important role in boosting GNNs with a refined gr…

cs.LG2024

Contrastive Sequential Interaction Network Learning on Co-Evolving Riemannian Spaces

Li Sun, Junda Ye, Jiawei Zhang +4

The sequential interaction network usually find itself in a variety of applications, e.g., recommender system. Herein, inferring future interaction is of fundamental importance, an…

cs.LG2024

Motif-aware Riemannian Graph Neural Network with Generative-Contrastive Learning

Li Sun, Zhenhao Huang, Zixi Wang +3

Graphs are typical non-Euclidean data of complex structures. In recent years, Riemannian graph representation learning has emerged as an exciting alternative to Euclidean ones. How…