EDBT 2026 Demo / reviewers in the wild / expert
JungUk Hong
dblp:352/8642
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 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
1 paper |
Efficient and distributed learning · 87% 3D vision · 13% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
GPUs and heterogeneous computing · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
model compression |
0.7 | 1 | 2023 | Not All Neighbors Matter: Point Distribution-Aware Pruning for 3D Point Cloud · AAAI 2023 |
Machine learning › Efficient and distributed learning › model compression › pruning
weight pruning |
0.7 | 1 | 2023 | Not All Neighbors Matter: Point Distribution-Aware Pruning for 3D Point Cloud · AAAI 2023 |
Computer vision › 3D vision
point cloud processing |
0.2 | 1 | 2023 | Not All Neighbors Matter: Point Distribution-Aware Pruning for 3D Point Cloud · AAAI 2023 |
GPUs and heterogeneous computing › deep learning on GPUs
GPU inference |
0.2 | 1 | 2023 | Not All Neighbors Matter: Point Distribution-Aware Pruning for 3D Point Cloud · AAAI 2023 |
Methods — techniques the papers use, named apart from their topics
sparse 3d convolution · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Not All Neighbors Matter: Point Distribution-Aware Pruning for 3D Point CloudabstractApplying deep neural networks to 3D point cloud processing has demonstrated a rapid pace of advancement in those domains where 3D geometry information can greatly boost task performance, such as AR/VR, robotics, and autonomous driving. However, as the size of both the neural network model and 3D point cloud continues to scale, reducing the entailed computation and memory access overhead is a primary challenge to meet strict latency and energy constraints of practical applications. This paper proposes a new weight pruning technique for 3D point cloud based on spatial point distribution. We identify that particular groups of neighborhood voxels in 3D point cloud contribute more frequently to actual output features than others. Based on this observation, we propose to selectively prune less contributing groups of neighborhood voxels first to reduce the computation overhead while minimizing the impact on model accuracy. We apply our proposal to three representative sparse 3D convolution libraries. Our proposal reduces the inference latency by 1.60× on average and energy consumption by 1.74× on NVIDIA GV100 GPU with no loss in accuracy metric Yejin Lee 0001, Donghyun Lee 0005, JungUk Hong, Jae W. Lee, Hongil Yoon |
AAAI | 3 |