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

Linan Zheng

dblp:260/7738 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0004-4437-1556ORCID · 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 2021Applied, interdisciplinary, general and emerging computing · 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.

Artificial intelligence
1 paper
Efficient and distributed learning · 40% Trustworthy machine learning · 40% Optimization for machine learning · 20%
Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
data-efficient learning
0.912025
Two Birds with One Stone: Efficient Deep Learning over Mislabeled Data through Subset Selection · Proc. ACM Manag. Data 2025
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels
0.912025
Two Birds with One Stone: Efficient Deep Learning over Mislabeled Data through Subset Selection · Proc. ACM Manag. Data 2025
Machine learning › Trustworthy machine learning › robustness › learning with noisy labels
noisy label detection
0.912025
Two Birds with One Stone: Efficient Deep Learning over Mislabeled Data through Subset Selection · Proc. ACM Manag. Data 2025
Machine learning › Optimization for machine learning › combinatorial optimization
submodular optimization
0.912025
Two Birds with One Stone: Efficient Deep Learning over Mislabeled Data through Subset Selection · Proc. ACM Manag. Data 2025
Machine learning › Efficient and distributed learning
subset selection
0.912025
Two Birds with One Stone: Efficient Deep Learning over Mislabeled Data through Subset Selection · Proc. ACM Manag. Data 2025
High-performance computing › data-intensive computing
large-scale data analytics
0.312026
MetaStore: A system for effectively analyzing deep learning meta-data at scale · VLDB J. 2026

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

submodular optimization · 0.9soft labels · 0.9gradient approximation · 0.9
YearPublicationVenuePosition
2026 MetaStore: A system for effectively analyzing deep learning meta-data at scale
Linan Zheng, Huayi Zhang, Samuel Madden 0001, Elke A. Rundensteiner, Lei Cao 0004
VLDB J.1
2025 Two Birds with One Stone: Efficient Deep Learning over Mislabeled Data through Subset Selection
abstract
Using a large training dataset to train a big and powerful model -- a typical practice in modern deep learning, often suffers from two major problems: the expensive and slow training process and the error-prone labels. The existing approaches, targeting either speeding up the training by selecting a subset of representative training instances (subset selection) or eliminating the negative effect of mislabels during training (mislabel detection), do not perform well in this scenario due to overlooking one of these two problems. To fill this gap, we propose Deem, a novel data-efficient framework that selects a subset of representative training instances under label uncertainty. The key idea is to leverage the metadata produced during deep learning training, e.g., training losses and gradients, to estimate the label uncertainty and select the representative instances. In particular, we model the problem of subset selection under uncertainty as a problem of finding a subset that closely approximates the gradient of the whole training data set derived on soft labels. We show that it is an NP-hard problem with submodular property and propose a low complexity algorithm to solve this problem with an approximate ratio. Training on this small subset thus improves the training efficiency while guaranteeing the model's accuracy. Moreover, we propose an efficient strategy to dynamically refine this subset during the iterative training process. Extensive experiments on 6 datasets and 10 baselines demonstrate that Deem accelerates the training process up to 10X without sacrificing the model accuracy.
Chengliang Chai, Kaisen Jin, Linan Zheng, Lei Cao 0004, Ye Yuan 0001, Guoren Wang
Proc. ACM Manag. Data4
2024 Enhancing Recommendation with Denoising Auxiliary Task
Peng-Sheng Liu, Linan Zheng, Jia-Le Chen, Guang-Fa Zhang, Jin-Yun Fang
J. Comput. Sci. Technol.2