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

Bolin Shen

dblp:278/8316 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2026
0000-0002-6471-9183ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
3 papers
Security and privacy of machine learning · 73% Cryptographic protocols and secure computation · 27%
Artificial intelligence
3 papers
Graph learning · 90% Language models and text generation · 10%
Databases, data mining, and information retrieval
1 paper
Data integration and cleaning · 100%

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

TopicWeightPapersLastEvidence papers
Security and privacy of machine learning
model stealing
2.732026
Query-Efficient Domain Knowledge Stealing Against Large Language Models · AAAI 2026
ATOM: A Framework of Detecting Query-Based Model Extraction Attacks for Graph Neural Networks · KDD (2) 2025
CEGA: A Cost-Effective Approach for Graph-Based Model Extraction and Acquisition · ICML 2025
Machine learning › Graph learning
graph neural network
1.722025
ATOM: A Framework of Detecting Query-Based Model Extraction Attacks for Graph Neural Networks · KDD (2) 2025
CEGA: A Cost-Effective Approach for Graph-Based Model Extraction and Acquisition · ICML 2025
Cryptographic protocols and secure computation › proof systems
knowledge extraction
1.012026
Query-Efficient Domain Knowledge Stealing Against Large Language Models · AAAI 2026
Machine learning › Graph learning › graph neural network
graph neural network security
0.912025
CEGA: A Cost-Effective Approach for Graph-Based Model Extraction and Acquisition · ICML 2025
Natural language and speech › Language models and text generation
large language model
0.312026
Query-Efficient Domain Knowledge Stealing Against Large Language Models · AAAI 2026
Data integration and cleaning
data acquisition
0.312025
CEGA: A Cost-Effective Approach for Graph-Based Model Extraction and Acquisition · ICML 2025

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

node querying strategy · 2.6active learning · 2.6self-directed exploration · 2.0feedback-driven query control · 2.0sequential modeling · 1.7reinforcement learning · 1.7k-core embedding · 1.7
YearPublicationVenuePosition
2026 Query-Efficient Domain Knowledge Stealing Against Large Language Models
abstract
Large language models (LLMs) concentrate substantial knowledge in specialized domains due to extensive pretraining and instruction tuning, and they are now central to commercial and scientific practice. Yet access is usually limited to costly, rate-limited interfaces, which motivates methods that can extract targeted domain knowledge with minimal querying effort. A further challenge is that the target domain may be unknown in advance, so naive or generic prompts waste queries and fail to expose the underlying concepts and relations that structure the domain. In this work, we introduce a query-efficient approach for domain-specific knowledge stealing from black-box language models. Rather than issuing random questions or generic templates, our framework performs self-directed exploration that lets the model find the direction and mine domain knowledge by itself. Starting from a small and diverse seed, it discovers salient domain entities and induces their relations through structured question families that elicit definitional, functional, and compositional information. A feedback-driven controller analyzes the errors and uncertainty of the extracted surrogate model and uses this signal to refine subsequent queries, all without relying on prior domain knowledge or external resources. We evaluate the method in two expert-centric settings, medicine and finance, and observe consistently better performance while requiring significantly fewer queries.
Zhengao Li, Xiaopeng Yuan, Bolin Shen, Kien Le, Haohan Wang, Xugui Zhou, Shangqian Gao, Yushun Dong
AAAI3
2025 CEGA: A Cost-Effective Approach for Graph-Based Model Extraction and Acquisition
abstract
Graph Neural Networks (GNNs) have demonstrated remarkable utility across diverse applications, and their growing complexity has made Machine Learning as a Service (MLaaS) a viable platform for scalable deployment. However, this accessibility also exposes GNN to serious security threats, most notably model extraction attacks (MEAs), in which adversaries strategically query a deployed model to construct a high-fidelity replica. In this work, we evaluate the vulnerability of GNNs to MEAs and explore their potential for cost-effective model acquisition in non-adversarial research settings. Importantly, adaptive node querying strategies can also serve a critical role in research, particularly when labeling data is expensive or time-consuming. By selectively sampling informative nodes, researchers can train high-performing GNNs with minimal supervision, which is particularly valuable in domains such as biomedicine, where annotations often require expert input. To address this, we propose a node querying strategy tailored to a highly practical yet underexplored scenario, where bulk queries are prohibited, and only a limited set of initial nodes is available. Our approach iteratively refines the node selection mechanism over multiple learning cycles, leveraging historical feedback to improve extraction efficiency. Extensive experiments on benchmark graph datasets demonstrate our superiority over comparable baselines on accuracy, fidelity, and F1 score under strict query-size constraints. These results highlight both the susceptibility of deployed GNNs to extraction attacks and the promise of ethical, efficient GNN acquisition methods to support low-resource research environments. Our implementation is publicly available at [https://github.com/LabRAI/CEGA](https://github.com/LabRAI/CEGA).
Zebin Wang, Menghan Lin, Bolin Shen, Molei Liu, Tianxi Cai, Yushun Dong
ICML3
2025 ATOM: A Framework of Detecting Query-Based Model Extraction Attacks for Graph Neural Networks
abstract
Graph Neural Networks (GNNs) have gained traction in Graph-based Machine Learning as a Service (GMLaaS) platforms, yet they remain vulnerable to graph-based model extraction attacks (MEAs), where adversaries reconstruct surrogate models by querying the victim model. Existing defense mechanisms, such as watermarking and fingerprinting, suffer from poor real-time performance, susceptibility to evasion, or reliance on post-attack verification, making them inadequate for handling the dynamic characteristics of graph-based MEA variants. To address these limitations, we propose ATOM, a novel real-time MEA detection framework tailored for GNNs. ATOM integrates sequential modeling and reinforcement learning to dynamically detect evolving attack patterns, while leveraging k-core embedding to capture the structural properties, enhancing detection precision. Furthermore, we provide theoretical analysis to characterize query behaviors and optimize detection strategies. Extensive experiments on multiple real-world datasets demonstrate that ATOM outperforms existing approaches in detection performance, maintaining stable across different time steps, thereby offering a more effective defense mechanism for GMLaaS environments. Our source code is available at https://github.com/LabRAI/ATOM.
Zhan Cheng, Bolin Shen, Tianming Sha, Yushun Dong
KDD (2)2