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.

Junyuan Pang

dblp:374/6863 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0009-0004-2653-2811ORCID · corroborated

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

Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Security and privacy · 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.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 70% Mathematical optimization · 30%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%
Network and information security
1 paper
Digital forensics and information hiding · 50% Security and privacy of machine learning · 50%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization
least squares
0.912025
Shapley Value Estimation based on Differential Matrix · Proc. ACM Manag. Data 2025
Algorithmic game theory and mechanism design › cooperative game theory › solution concepts
shapley value
0.912025
Shapley Value Estimation based on Differential Matrix · Proc. ACM Manag. Data 2025
Algorithmic game theory and mechanism design › cooperative game theory › solution concepts › shapley value
shapley value approximation
0.912025
Shapley Value Estimation based on Differential Matrix · Proc. ACM Manag. Data 2025
Machine learning › Trustworthy machine learning › Data-centric AI
data valuation
0.812024
P-Shapley: Shapley Values on Probabilistic Classifiers · Proc. VLDB Endow. 2024
Machine learning › Trustworthy machine learning
interpretability
0.812024
P-Shapley: Shapley Values on Probabilistic Classifiers · Proc. VLDB Endow. 2024
Machine learning › Trustworthy machine learning › interpretability
shapley value
0.812024
P-Shapley: Shapley Values on Probabilistic Classifiers · Proc. VLDB Endow. 2024
Security and privacy of machine learning
model intellectual property protection
0.812024
TabularMark: Watermarking Tabular Datasets for Machine Learning · CCS 2024
Digital forensics and information hiding
watermarking
0.812024
TabularMark: Watermarking Tabular Datasets for Machine Learning · CCS 2024
Algorithmic game theory and mechanism design
cooperative game theory
0.312025
Shapley Value Estimation based on Differential Matrix · Proc. ACM Manag. Data 2025

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

stratified sampling · 0.9monte carlo · 0.9least-squares optimization · 0.9watermark embedding · 0.8shapley value · 0.8probability calibration · 0.8machine learning utility preservation · 0.8
YearPublicationVenuePosition
2025 Shapley Value Estimation based on Differential Matrix
abstract
The Shapley value has been extensively used in many fields as the unique metric to fairly evaluate player contributions in cooperative settings. Since the exact computation of Shapley values is \#P-hard in the task-agnostic setting, many studies have been developed to utilize the Monte Carlo method for Shapley value estimation. The existing methods estimate the Shapley values directly. In this paper, we explore a novel idea-inferring the Shapley values by estimating the differences between them. Technically, we estimate a differential matrix consisting of pairwise Shapley value differences to reduce the variance of the estimated Shapley values. We develop a least-squares optimization solution to derive the Shapley values from the differential matrix, minimizing the estimator variances. Additionally, we devise a Monte Carlo method for efficient estimation of the differential matrix and introduce two stratified Monte Carlo methods for further variance reduction. Our experimental results on real and synthetic data sets demonstrate the effectiveness and efficiency of the differential-matrix-based sampling approaches.
Junyuan Pang, Jian Pei 0001, Haocheng Xia, Xiang Li 0001, Jinfei Liu
Proc. ACM Manag. Data1
2024 TabularMark: Watermarking Tabular Datasets for Machine Learning
abstract
Watermarking is broadly utilized to protect ownership of shared data while preserving data utility. However, existing watermarking methods for tabular datasets fall short on the desired properties (detectability, non-intrusiveness, and robustness) and only preserve data utility from the perspective of data statistics, ignoring the performance of downstream ML models trained on the datasets. Can we watermark tabular datasets without significantly compromising their utility for training ML models while preventing attackers from training usable ML models on attacked datasets?
Yihao Zheng 0001, Haocheng Xia, Junyuan Pang, Jinfei Liu, Kui Ren 0001, Lingyang Chu, Yang Cao 0011, Li Xiong 0001
CCS3
2024 P-Shapley: Shapley Values on Probabilistic Classifiers
abstract
The Shapley value provides a unique approach to equitably gauge each player's contribution within a coalition and has extensive applications with various utility functions. In data valuation for machine learning, particularly for classification tasks, using classification accuracy as the utility function has become a de facto standard. However, accuracy can be an imprecise metric, potentially missing finer details crucial for valuation. In this paper, we propose the probability-based Shapley (P-Shapley) value, which leverages predicted probabilities to heighten utility differentiation. Several convex calibration functions are further incorporated for probability calibration. We prove that the P-Shapley value outperforms Shapley values based on accuracy or other coarse metrics in approximation stability and the discrimination of marginal utility change can be further improved by convex calibration functions. Extensive experiments on four real-world datasets demonstrate the effectiveness of our approaches.
Haocheng Xia, Xiang Li 0001, Junyuan Pang, Jinfei Liu, Kui Ren 0001, Li Xiong 0001
Proc. VLDB Endow.3