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

Yidan Song

dblp:316/7868 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 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
1 paper
Security and privacy of machine learning · 100%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%
Artificial intelligence
1 paper
Graph learning · 100%

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

TopicWeightPapersLastEvidence papers
Security and privacy of machine learning › model stealing
data-free model stealing
0.912025
Data-Free Model Extraction for Black-box Recommender Systems via Graph Convolutions · NeurIPS 2025
Security and privacy of machine learning
model stealing
0.912025
Data-Free Model Extraction for Black-box Recommender Systems via Graph Convolutions · NeurIPS 2025
Machine learning › Graph learning › graph neural network
graph convolution
0.312025
Data-Free Model Extraction for Black-box Recommender Systems via Graph Convolutions · NeurIPS 2025

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

interaction generator · 2.6graph convolution · 2.6data-free learning · 2.6
YearPublicationVenuePosition
2025 Data-Free Model Extraction for Black-box Recommender Systems via Graph Convolutions
abstract
Privacy and security concerns are becoming increasingly critical for recommender systems, as model extraction attack provides an effective way to probe system robustness by replicating the model’s recommendation logic — potentially exposing sensitive user preferences and proprietary algorithmic knowledge. Despite the promising performance of existing model extraction methods, they still face two key challenges: unrealistic assumptions on the requirement of accessible member or surrogate data and generalization problem where surrogate model architecture constraints lead to overfitting on generated data. To tackle these challenges, in this paper, we first thoroughly analyze how the architecture of surrogate models influences extraction attack performance, highlighting the superior effectiveness of the graph convolution architecture. Based on this, we propose a novel Data-free Black-box Graph convolution-based Recommender Model Extraction method, dubbed DBGRME. Specifically, DBGRME contains: (1) an interaction generator to alleviate the need for member data requirements in a data-free scenario; and (2) a generalization-aware graph convolution-based surrogate model to capture diverse and complex recommender interaction patterns for mitigating the overfitting issue. Experimental results on various datasets and victim models demonstrate the superiority of our attack in data-free scenarios (e.g., surpassing PTQ data-require methods with 17.4% improvement on LightGCN). Code is available: \url{https://github.com/Vencent-Won/DBGRME.git}.
Zeyu Wang 0011, Yidan Song, Shihao Qin, Shanqing Yu, Yujin Huang, Qi Xuan 0001, Xin Zheng 0008
NeurIPS2