Demo Data from VLDB 2026 / reviewers in the wild / expert
Guangda Ji
dblp:277/0701
· DBLP profile ↗
2ranked-venue papers
2as first author
1since 2021 · last 2025
0000-0002-0499-8774ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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 |
Segmentation and scene understanding · 48% 3D vision · 24% Efficient and distributed learning · 12% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision
3d scene understanding |
0.9 | 1 | 2025 | ARKit LabelMaker: A New Scale for Indoor 3D Scene Understanding · CVPR 2025 |
Computer vision › Segmentation and scene understanding
3d semantic segmentation |
0.9 | 1 | 2025 | ARKit LabelMaker: A New Scale for Indoor 3D Scene Understanding · CVPR 2025 |
Computer vision › Segmentation and scene understanding › scene understanding
indoor scene understanding |
0.9 | 1 | 2025 | ARKit LabelMaker: A New Scale for Indoor 3D Scene Understanding · CVPR 2025 |
Machine learning › Learning theory
generalization bounds |
0.4 | 1 | 2020 | Knowledge Distillation in Wide Neural Networks: Risk Bound, Data Efficiency and Imperfect Teacher · NeurIPS 2020 |
Machine learning › Efficient and distributed learning › model compression
knowledge distillation |
0.4 | 1 | 2020 | Knowledge Distillation in Wide Neural Networks: Risk Bound, Data Efficiency and Imperfect Teacher · NeurIPS 2020 |
Machine learning › Deep learning architectures and training › overparameterized neural network
wide neural networks |
0.1 | 1 | 2020 | Knowledge Distillation in Wide Neural Networks: Risk Bound, Data Efficiency and Imperfect Teacher · NeurIPS 2020 |
Methods — techniques the papers use, named apart from their topics
pre-training · 0.9dense semantic annotation · 0.9risk bound analysis · 0.4neural tangent kernel · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | ARKit LabelMaker: A New Scale for Indoor 3D Scene UnderstandingabstractNeural network performance scales with both model size and data volume, as shown in both language and image processing. This requires scaling-friendly architectures and large datasets. While transformers have been adapted for 3D vision, a ‘GPT-moment’ remains elusive due to limited training data. We introduce ARKit LabelMaker, a large-scale real-world 3D dataset with dense semantic annotation that is more than three times larger than prior largest dataset. Specifically, we extend ARKitScenes [4] with automatically generated dense 3D labels using an extended LabelMaker pipeline [37], tailored for large-scale pre-training. Training on our dataset improves accuracy across architectures, achieving state-of-the-art 3D semantic segmentation scores on ScanNet and ScanNet200, with notable gains on tail classes. Our code is available at labelmaker.org and our dataset at huggingface. Guangda Ji, Silvan Weder, Francis Engelmann, Marc Pollefeys, Hermann Blum |
CVPR | 1 |
| 2020 | Knowledge Distillation in Wide Neural Networks: Risk Bound, Data Efficiency and Imperfect TeacherabstractKnowledge distillation is a strategy of training a student network with guide of the soft output from a teacher network. It has been a successful method of model compression and knowledge transfer. However, currently knowledge distillation lacks a convincing theoretical understanding. On the other hand, recent finding on neural tangent kernel enables us to approximate a wide neural network with a linear model of the network's random features. In this paper, we theoretically analyze the knowledge distillation of a wide neural network. First we provide a transfer risk bound for the linearized model of the network. Then we propose a metric of the task's training difficulty, called data inefficiency. Based on this metric, we show that for a perfect teacher, a high ratio of teacher's soft labels can be beneficial. Finally, for the case of imperfect teacher, we find that hard labels can correct teacher's wrong prediction, which explains the practice of mixing hard and soft labels. Guangda Ji, Zhanxing Zhu |
NeurIPS | 1 |