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

Qiben Shan

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

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

Artificial intelligence and machine learning · 2 · 2 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.

Artificial intelligence
2 papers
Efficient and distributed learning · 38% Trustworthy machine learning · 26% Learning paradigms · 13%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
dataset distillation
0.912025
Rectifying Soft-Label Entangled Bias in Long-Tailed Dataset Distillation · NeurIPS 2025
Machine learning › Trustworthy machine learning
fairness
0.912025
Rectifying Soft-Label Entangled Bias in Long-Tailed Dataset Distillation · NeurIPS 2025
Machine learning › Efficient and distributed learning › dataset distillation
long-tailed dataset distillation
0.912025
Rectifying Soft-Label Entangled Bias in Long-Tailed Dataset Distillation · NeurIPS 2025
Machine learning › Learning paradigms › class imbalance
long-tailed learning
0.912025
Rectifying Soft-Label Entangled Bias in Long-Tailed Dataset Distillation · NeurIPS 2025
Machine learning › Trustworthy machine learning › robustness › learning with noisy labels
soft labels
0.912025
Rectifying Soft-Label Entangled Bias in Long-Tailed Dataset Distillation · NeurIPS 2025
Machine learning › Efficient and distributed learning › data selection
coreset selection
0.812024
Feature Distribution Matching by Optimal Transport for Effective and Robust Coreset Selection · AAAI 2024
Machine learning › Transfer learning and domain adaptation › distribution matching
feature distribution alignment
0.812024
Feature Distribution Matching by Optimal Transport for Effective and Robust Coreset Selection · AAAI 2024
Machine learning › Optimization for machine learning
optimal transport
0.812024
Feature Distribution Matching by Optimal Transport for Effective and Robust Coreset Selection · AAAI 2024

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

adaptive soft-label alignment · 0.9optimal transport · 0.8coreset selection · 0.8
YearPublicationVenuePosition
2025 Rectifying Soft-Label Entangled Bias in Long-Tailed Dataset Distillation
abstract
Dataset distillation compresses large-scale datasets into compact, highly informative synthetic data, significantly reducing storage and training costs. However, existing research primarily focuses on balanced datasets and struggles to perform under real-world long-tailed distributions. In this work, we emphasize the critical role of soft labels in long-tailed dataset distillation and uncover the underlying mechanisms contributing to performance degradation. Specifically, we derive an imbalance-aware generalization bound for model trained on distilled dataset. We then identify two primary sources of soft-label bias, which originate from the distillation model and the distilled images, through systematic perturbation of the data imbalance levels. To address this, we propose ADSA, an Adaptive Soft-label Alignment module that calibrates the entangled biases. This lightweight module integrates seamlessly into existing distillation pipelines and consistently improves performance. On ImageNet-1k-LT with EDC and IPC=50, ADSA improves tail-class accuracy by up to 11.8\% and raises overall accuracy to 41.4\%. Extensive experiments demonstrate that ADSA provides a robust and generalizable solution under limited label budgets and across a range of distillation techniques.
Chenyang Jiang 0001, Hang Zhao 0021, Zhengcen Li, Qiben Shan, Shaocong Wu, Jingyong Su
NeurIPS5
2024 Feature Distribution Matching by Optimal Transport for Effective and Robust Coreset Selection
abstract
Training neural networks with good generalization requires large computational costs in many deep learning methods due to large-scale datasets and over-parameterized models. Despite the emergence of a number of coreset selection methods to reduce the computational costs, the problem of coreset distribution bias, i.e., the skewed distribution between the coreset and the entire dataset, has not been well studied. In this paper, we find that the closer the feature distribution of the coreset is to that of the entire dataset, the better the generalization performance of the coreset, particularly under extreme pruning. This motivates us to propose a simple yet effective method for coreset selection to alleviate the distribution bias between the coreset and the entire dataset, called feature distribution matching (FDMat). Unlike gradient-based methods, which selects samples with larger gradient values or approximates gradient values of the entire dataset, FDMat aims to select coreset that is closest to feature distribution of the entire dataset. Specifically, FDMat transfers coreset selection as an optimal transport problem from the coreset to the entire dataset in feature embedding spaces. Moreover, our method shows strong robustness due to the removal of samples far from the distribution, especially for the entire dataset containing noisy and class-imbalanced samples. Extensive experiments on multiple benchmarks show that FDMat can improve the performance of coreset selection than existing coreset methods. The code is available at https://github.com/successhaha/FDMat.
Weiwei Xiao, Yongyong Chen, Qiben Shan, Jingyong Su
AAAI3