Demo Data from VLDB 2026 / reviewers in the wild / expert
Alec Hodgkinson
dblp:225/5281
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1
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 · 33% Trustworthy machine learning · 33% Transfer learning and domain adaptation · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
active learning |
0.4 | 1 | 2020 | Deep Active Learning for Biased Datasets via Fisher Kernel Self-Supervision · CVPR 2020 |
Machine learning › Transfer learning and domain adaptation
learning under distribution shift |
0.4 | 1 | 2020 | Deep Active Learning for Biased Datasets via Fisher Kernel Self-Supervision · CVPR 2020 |
Machine learning › Trustworthy machine learning
robustness |
0.4 | 1 | 2020 | Deep Active Learning for Biased Datasets via Fisher Kernel Self-Supervision · CVPR 2020 |
Methods — techniques the papers use, named apart from their topics
self-supervision · 0.4pseudo label estimation · 0.4fisher kernel · 0.4acquisition function · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Deep Active Learning for Biased Datasets via Fisher Kernel Self-SupervisionabstractActive learning (AL) aims to minimize labeling efforts for data-demanding deep neural networks (DNNs) by selecting the most representative data points for annotation. However, currently used methods are ill-equipped to deal with biased data. The main motivation of this paper is to consider a realistic setting for pool-based semi-supervised AL, where the unlabeled collection of train data is biased. We theoretically derive an optimal acquisition function for AL in this setting. It can be formulated as distribution shift minimization between unlabeled train data and weakly-labeled validation dataset. To implement such acquisition function, we propose a low-complexity method for feature density matching using self-supervised Fisher kernel (FK) as well as several novel pseudo-label estimators. Our FK-based method outperforms state-of-the-art methods on MNIST, SVHN, and ImageNet classification while requiring only 1/10th of processing. The conducted experiments show at least 40% drop in labeling efforts for the biased class-imbalanced data compared to existing methods. Denis A. Gudovskiy, Alec Hodgkinson, Takuya Yamaguchi, Sotaro Tsukizawa |
CVPR | 2 |