VLDB 2026 Research / reviewers in the wild / expert
Qi-Wei Wang
dblp:195/9944
· DBLP profile ↗
4ranked-venue papers
1as first author
4since 2021 · last 2024
0009-0009-1555-5280ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 1 first-author · 4 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
4 papers |
Learning paradigms · 52% Trustworthy machine learning · 19% Efficient and distributed learning · 10% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning paradigms › continual learning
class-incremental learning |
2.1 | 3 | 2024 | Class-Incremental Learning: A Survey · IEEE Trans. Pattern Anal. Mach. Intell. 2024 Few-Shot Class-Incremental Learning via Training-Free Prototype Calibration · NeurIPS 2023 A Model or 603 Exemplars: Towards Memory-Efficient Class-Incremental Learning · ICLR 2023 |
Machine learning › Learning paradigms › continual learning
catastrophic forgetting |
0.8 | 1 | 2024 | Class-Incremental Learning: A Survey · IEEE Trans. Pattern Anal. Mach. Intell. 2024 |
Machine learning › Learning paradigms
continual learning |
0.8 | 1 | 2024 | Class-Incremental Learning: A Survey · IEEE Trans. Pattern Anal. Mach. Intell. 2024 |
Machine learning › Trustworthy machine learning › debiasing
debiased representation learning |
0.7 | 1 | 2023 | Learning Debiased Representations via Conditional Attribute Interpolation · CVPR 2023 |
Machine learning › Trustworthy machine learning
fairness |
0.7 | 1 | 2023 | Learning Debiased Representations via Conditional Attribute Interpolation · CVPR 2023 |
Machine learning › Transfer learning and domain adaptation
few-shot learning |
0.7 | 1 | 2023 | Few-Shot Class-Incremental Learning via Training-Free Prototype Calibration · NeurIPS 2023 |
Machine learning › Efficient and distributed learning
memory-efficient training |
0.7 | 1 | 2023 | A Model or 603 Exemplars: Towards Memory-Efficient Class-Incremental Learning · ICLR 2023 |
Machine learning › Representation and self-supervised learning › prototype learning
prototype calibration |
0.7 | 1 | 2023 | Few-Shot Class-Incremental Learning via Training-Free Prototype Calibration · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
memory budget alignment · 0.8benchmark evaluation · 0.8x2-model · 0.7training-free calibration · 0.7prototype-based classification · 0.7prototype calibration · 0.7metric learning · 0.7exemplar-based replay · 0.7conditional attribute interpolation · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Class-Incremental Learning: A SurveyabstractDeep models, e.g., CNNs and Vision Transformers, have achieved impressive achievements in many vision tasks in the closed world. However, novel classes emerge from time to time in our ever-changing world, requiring a learning system to acquire new knowledge continually. Class-Incremental Learning (CIL) enables the learner to incorporate the knowledge of new classes incrementally and build a universal classifier among all seen classes. Correspondingly, when directly training the model with new class instances, a fatal problem occurs - the model tends to catastrophically forget the characteristics of former ones, and its performance drastically degrades. There have been numerous efforts to tackle catastrophic forgetting in the machine learning community. In this paper, we survey comprehensively recent advances in class-incremental learning and summarize these methods from several aspects. We also provide a rigorous and unified evaluation of 17 methods in benchmark image classification tasks to find out the characteristics of different algorithms empirically. Furthermore, we notice that the current comparison protocol ignores the influence of memory budget in model storage, which may result in unfair comparison and biased results. Hence, we advocate fair comparison by aligning the memory budget in evaluation, as well as several memory-agnostic performance measures. Da-Wei Zhou 0001, Qi-Wei Wang, Zhi-Hong Qi, Han-Jia Ye, De-Chuan Zhan, Ziwei Liu 0002 |
IEEE Trans. Pattern Anal. Mach. Intell. | 2 |
| 2023 | Learning Debiased Representations via Conditional Attribute InterpolationabstractAn image is usually described by more than one attribute like “shape” and “color”. When a dataset is biased, i.e., most samples have attributes spuriously correlated with the target label, a Deep Neural Network (DNN) is prone to make predictions by the “unintended” attribute, especially if it is easier to learn. To improve the generalization ability when training on such a biased dataset, we propose a X2-model to learn debiased representations. First, we design a x-shape pattern to match the training dynamics of a DNN and find Intermediate Attribute Samples (IASs) — samples near the attribute decision boundaries, which indicate how the value of an attribute changes from one extreme to another. Then we rectify the representation with a X-structured metric learning objective. Conditional interpolation among IASs eliminates the negative effect of periph-eral attributes and facilitates retaining the intra-class compactness. Experiments show that X2-modellearns debiased representation effectively and achieves remarkable improvements on various datasets. Code is available at: https://github.com/ZhangYikaii/chi-square Yi-Kai Zhang, Qi-Wei Wang, De-Chuan Zhan, Han-Jia Ye |
CVPR | 2 |
| 2023 | A Model or 603 Exemplars: Towards Memory-Efficient Class-Incremental Learning
Da-Wei Zhou 0001, Qi-Wei Wang, Han-Jia Ye, De-Chuan Zhan |
ICLR | 2 |
| 2023 | Few-Shot Class-Incremental Learning via Training-Free Prototype CalibrationabstractReal-world scenarios are usually accompanied by continuously appearing classes with scare labeled samples, which require the machine learning model to incrementally learn new classes and maintain the knowledge of base classes. In this Few-Shot Class-Incremental Learning (FSCIL) scenario, existing methods either introduce extra learnable components or rely on a frozen feature extractor to mitigate catastrophic forgetting and overfitting problems. However, we find a tendency for existing methods to misclassify the samples of new classes into base classes, which leads to the poor performance of new classes. In other words, the strong discriminability of base classes distracts the classification of new classes. To figure out this intriguing phenomenon, we observe that although the feature extractor is only trained on base classes, it can surprisingly represent the *semantic similarity* between the base and *unseen* new classes. Building upon these analyses, we propose a *simple yet effective* Training-frEE calibratioN (TEEN) strategy to enhance the discriminability of new classes by fusing the new prototypes (i.e., mean features of a class) with weighted base prototypes. In addition to standard benchmarks in FSCIL, TEEN demonstrates remarkable performance and consistent improvements over baseline methods in the few-shot learning scenario. Code is available at: https://github.com/wangkiw/TEEN Qi-Wei Wang, Da-Wei Zhou 0001, Yi-Kai Zhang, De-Chuan Zhan, Han-Jia Ye |
NeurIPS | 1 |