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

Hee Bin Yoo

dblp:371/4493 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
6since 2021 · last 2026
0009-0006-3810-4448ORCID · corroborated

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

Artificial intelligence and machine learning · 6 · 2 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 4 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
Deep learning architectures and training · 28% Reinforcement learning · 24% Representation and self-supervised learning · 16%
Network and information security
1 paper
Privacy and data protection · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
machine unlearning
1.012026
PeriUn: Enhancing Unlearning by Selectively Forgetting Peripheral Samples · AAAI 2026
Machine learning › Representation and self-supervised learning › representation learning
metric learning
1.012026
Neural Collapse-Informed Initialization with Perturbation Injection in Classification-based Metric Learning · AAAI 2026
Machine learning › Deep learning architectures and training
neural collapse
1.012026
Neural Collapse-Informed Initialization with Perturbation Injection in Classification-based Metric Learning · AAAI 2026
Privacy and data protection › privacy regulation
right to be forgotten
1.012026
PeriUn: Enhancing Unlearning by Selectively Forgetting Peripheral Samples · AAAI 2026
Machine learning › Reinforcement learning
exploration
0.812024
Unveiling the Significance of Toddler-Inspired Reward Transition in Goal-Oriented Reinforcement Learning · AAAI 2024
Computer vision › 3D vision
point cloud analysis
0.812024
Continuous SO(3) Equivariant Convolution for 3D Point Cloud Analysis · ECCV (52) 2024
Machine learning › Reinforcement learning › reward design
reward shaping
0.812024
Unveiling the Significance of Toddler-Inspired Reward Transition in Goal-Oriented Reinforcement Learning · AAAI 2024
Machine learning › Deep learning architectures and training › equivariant neural network
rotation equivariant convolution
0.812024
Continuous SO(3) Equivariant Convolution for 3D Point Cloud Analysis · ECCV (52) 2024
Machine learning › Transfer learning and domain adaptation
fine-tuning
0.312026
Neural Collapse-Informed Initialization with Perturbation Injection in Classification-based Metric Learning · AAAI 2026

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

random labeling · 2.0membership inference attack · 2.0neural collapse-informed initialization · 1.0gaussian perturbation injection · 1.0spherical harmonics · 0.8potential-based reward shaping · 0.8group equivariant convolution · 0.8cross-density visualizer · 0.8
YearPublicationVenuePosition
2026 Neural Collapse-Informed Initialization with Perturbation Injection in Classification-based Metric Learning
abstract
Recent studies have revealed Neural Collapse (NC) in deep classifiers, where last-layer weights and features align into an equiangular tight frame (ETF), concentrating class information along specific embedding directions. However, conventional fine-tuning typically disregards this structure, initializing task-specific classifier heads randomly. To explicitly leverage this phenomenon, we propose a simple yet effective method for metric learning: (1) initializing the classifier head along each class’s NC direction from a pretrained model to preserve the emergent structure, and (2) injecting small isotropic Gaussian noise during finetuning to boost generalization. In addition, we provide a theoretical bound proving that our method explicitly reduces cumulative weight drift from the NC-initialization, compared to standard finetuning. This suggests that our method better preserves the pretrained model’s class-specific structure. Empirically, this structural preservation yields Recall@K gains: reduced weight drift correlates with better performance. Concurrent decreases in the Neural Collapse 1 (NC1) measure confirm that stronger intra‐class cohesion underlies these improvements. Furthermore, we validate the effectiveness of our method on class‐imbalanced benchmarks.
Jinhee Park 0001, Hee Bin Yoo, Byoung-Tak Zhang, Junseok Kwon
AAAI2
2026 PeriUn: Enhancing Unlearning by Selectively Forgetting Peripheral Samples
abstract
Once trained, neural networks memorize information in diffusely encoded parameters, making it difficult to forget in support of the right to be forgotten. Unlearning aims to remove the influence of data, with performance measured against a retrained model that excludes the data. However, understanding the behavior of gold-standard retraining remains underexplored. We compare original and retrained models and observe that most prediction changes occur in peripheral samples near decision boundaries. Consequently, we propose PeriUn, a selective strategy that unlearns only peripheral samples to mimic retrained model behavior with minimal disruption, unlike prior works that remove the entire request. Combined with the Random Label based method, PeriUn significantly improves both generalization and privacy metrics. Specifically, on TinyImageNet with VGG16, PeriUn increases the Tug-of-War score by 22 points compared to the strongest. Besides, the MIA gap score surpasses the state-of-the-art method, improving by 8.7 points after applying PeriUn. Further analyses confirm that PeriUn better preserves the feature space and aligns closely with the retrained model.
Hee Bin Yoo, Dong-Sig Han, Jaein Kim 0004, Byoung-Tak Zhang
AAAI1
2026 Confidence Controls Deep Metric Learning
Jinhee Park 0001, Hee Bin Yoo, Byoung-Tak Zhang, Junseok Kwon
Mach. Learn.2
2025 How Classifier Features Transfer to Downstream: An Asymptotic Analysis in a Two-Layer Model
abstract
Neural networks learn effective feature representations, which can be transferred to new tasks without additional training. While larger datasets are known to improve feature transfer, the theoretical conditions for the success of such transfer remain unclear. This work investigates feature transfer in networks trained for classification to identify the conditions that enable effective clustering in unseen classes. We first reveal that higher similarity between training and unseen distributions leads to improved Cohesion and Separability. We then show that feature expressiveness is enhanced when inputs are similar to the training classes, while the features of irrelevant inputs remain indistinguishable. We validate our analysis on synthetic and benchmark datasets, including CAR, CUB, SOP, ISC, and ImageNet. Our analysis highlights the importance of the similarity between training classes and the input distribution for successful feature transfer.
Hee Bin Yoo, Sungyoon Lee, Cheongjae Jang, Dong-Sig Han, Jaein Kim 0004, Seunghyeon Lim, Byoung-Tak Zhang
NeurIPS1
2024 Unveiling the Significance of Toddler-Inspired Reward Transition in Goal-Oriented Reinforcement Learning
abstract
Toddlers evolve from free exploration with sparse feedback to exploiting prior experiences for goal-directed learning with denser rewards. Drawing inspiration from this Toddler-Inspired Reward Transition, we set out to explore the implications of varying reward transitions when incorporated into Reinforcement Learning (RL) tasks. Central to our inquiry is the transition from sparse to potential-based dense rewards, which share optimal strategies regardless of reward changes. Through various experiments, including those in egocentric navigation and robotic arm manipulation tasks, we found that proper reward transitions significantly influence sample efficiency and success rates. Of particular note is the efficacy of the toddler-inspired Sparse-to-Dense (S2D) transition. Beyond these performance metrics, using Cross-Density Visualizer technique, we observed that transitions, especially the S2D, smooth the policy loss landscape, promoting wide minima that enhance generalization in RL models.
Yoonsung Kim, Hee Bin Yoo, Min Whoo Lee, Kibeom Kim, Won-Seok Choi 0006, Minsu Lee 0001, Byoung-Tak Zhang
AAAI3
2024 Continuous SO(3) Equivariant Convolution for 3D Point Cloud Analysis
Jaein Kim 0004, Hee Bin Yoo, Dong-Sig Han, Yeon-Ji Song, Byoung-Tak Zhang
ECCV (52)2