Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xuan Li 0005

dblp:64/5016-5 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
0009-0002-1590-2966ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Security and privacy of machine learning · 67% Privacy and data protection · 33%
Artificial intelligence
1 paper
Graph learning · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph neural network
0.812024
Neural Atoms: Propagating Long-range Interaction in Molecular Graphs through Efficient Communication Channel · ICLR 2024
Security and privacy of machine learning
graph neural network privacy
0.712023
On Strengthening and Defending Graph Reconstruction Attack with Markov Chain Approximation · ICML 2023
Security and privacy of machine learning › graph neural network privacy
graph reconstruction attack
0.712023
On Strengthening and Defending Graph Reconstruction Attack with Markov Chain Approximation · ICML 2023
Privacy and data protection › privacy-preserving machine learning
privacy-preserving graph learning
0.712023
On Strengthening and Defending Graph Reconstruction Attack with Markov Chain Approximation · ICML 2023
Bioinformatics and computational biology
molecular property prediction
0.212024
Neural Atoms: Propagating Long-range Interaction in Molecular Graphs through Efficient Communication Channel · ICLR 2024

Methods — techniques the papers use, named apart from their topics

graph neural network · 1.5ewald summation · 1.5markov chain approximation · 0.7information-theoretic analysis · 0.7
YearPublicationVenuePosition
2024 Neural Atoms: Propagating Long-range Interaction in Molecular Graphs through Efficient Communication Channel
abstract
Graph Neural Networks (GNNs) have been widely adopted for drug discovery with molecular graphs. Nevertheless, current GNNs mainly excel in leveraging short-range interactions (SRI) but struggle to capture long-range interactions (LRI), both of which are crucial for determining molecular properties. To tackle this issue, we propose a method to abstract the collective information of atomic groups into a few $\textit{Neural Atoms}$ by implicitly projecting the atoms of a molecular. Specifically, we explicitly exchange the information among neural atoms and project them back to the atoms’ representations as an enhancement. With this mechanism, neural atoms establish the communication channels among distant nodes, effectively reducing the interaction scope of arbitrary node pairs into a single hop. To provide an inspection of our method from a physical perspective, we reveal its connection to the traditional LRI calculation method, Ewald Summation. The Neural Atom can enhance GNNs to capture LRI by approximating the potential LRI of the molecular. We conduct extensive experiments on four long-range graph benchmarks, covering graph-level and link-level tasks on molecular graphs. We achieve up to a 27.32% and 38.27% improvement in the 2D and 3D scenarios, respectively. Empirically, our method can be equipped with an arbitrary GNN to help capture LRI. Code and datasets are publicly available in https://github.com/tmlr-group/NeuralAtom.
Xuan Li 0005, Zhanke Zhou, Jiangchao Yao, Yu Rong 0001, Lu Zhang 0060, Bo Han 0003
ICLR1
2023 On Strengthening and Defending Graph Reconstruction Attack with Markov Chain Approximation
abstract
Although powerful graph neural networks (GNNs) have boosted numerous real-world applications, the potential privacy risk is still underexplored. To close this gap, we perform the first comprehensive study of graph reconstruction attack that aims to reconstruct the adjacency of nodes. We show that a range of factors in GNNs can lead to the surprising leakage of private links. Especially by taking GNNs as a Markov chain and attacking GNNs via a flexible chain approximation, we systematically explore the underneath principles of graph reconstruction attack, and propose two information theory-guided mechanisms: (1) the chain-based attack method with adaptive designs for extracting more private information; (2) the chain-based defense method that sharply reduces the attack fidelity with moderate accuracy loss. Such two objectives disclose a critical belief that to recover better in attack, you must extract more multi-aspect knowledge from the trained GNN; while to learn safer for defense, you must forget more link-sensitive information in training GNNs. Empirically, we achieve state-of-the-art results on six datasets and three common GNNs. The code is publicly available at: https://github.com/tmlr-group/MC-GRA.
Zhanke Zhou, Xuan Li 0005, Jiangchao Yao, Quanming Yao, Bo Han 0003
ICML3