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

Youngkyu Hong

dblp:280/0717 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 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
Trustworthy machine learning · 50% Learning paradigms · 24% Transfer learning and domain adaptation · 7%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
long-tailed recognition
1.122022
The Majority Can Help the Minority: Context-rich Minority Oversampling for Long-tailed Classification · CVPR 2022
Disentangling Label Distribution for Long-Tailed Visual Recognition · CVPR 2021
Machine learning › Learning paradigms
imbalanced learning
0.612022
The Majority Can Help the Minority: Context-rich Minority Oversampling for Long-tailed Classification · CVPR 2022
Machine learning › Trustworthy machine learning › fairness
bias mitigation
0.512021
Unbiased Classification through Bias-Contrastive and Bias-Balanced Learning · NeurIPS 2021
Machine learning › Trustworthy machine learning
debiasing
0.512021
Unbiased Classification through Bias-Contrastive and Bias-Balanced Learning · NeurIPS 2021
Machine learning › Trustworthy machine learning › robustness
distribution shift
0.512021
Disentangling Label Distribution for Long-Tailed Visual Recognition · CVPR 2021
Machine learning › Trustworthy machine learning
fairness
0.512021
Unbiased Classification through Bias-Contrastive and Bias-Balanced Learning · NeurIPS 2021
Machine learning › Generative modeling
generative adversarial network
0.512021
Self-Diagnosing GAN: Diagnosing Underrepresented Samples in Generative Adversarial Networks · NeurIPS 2021
Machine learning › Transfer learning and domain adaptation
label shift
0.512021
Disentangling Label Distribution for Long-Tailed Visual Recognition · CVPR 2021
Machine learning › Deep learning architectures and training
loss function design
0.512021
Disentangling Label Distribution for Long-Tailed Visual Recognition · CVPR 2021
Machine learning › Trustworthy machine learning
robustness
0.512021
Unbiased Classification through Bias-Contrastive and Bias-Balanced Learning · NeurIPS 2021
Machine learning › Trustworthy machine learning › robustness › learning with noisy labels
sample reweighting
0.512021
Self-Diagnosing GAN: Diagnosing Underrepresented Samples in Generative Adversarial Networks · NeurIPS 2021
Machine learning › Trustworthy machine learning › robustness › spurious correlation
spurious correlation robustness
0.512021
Unbiased Classification through Bias-Contrastive and Bias-Balanced Learning · NeurIPS 2021
Machine learning › Representation and self-supervised learning
contrastive learning
0.112021
Unbiased Classification through Bias-Contrastive and Bias-Balanced Learning · NeurIPS 2021
Machine learning › Representation and self-supervised learning › contrastive learning
supervised contrastive learning
0.112021
Unbiased Classification through Bias-Contrastive and Bias-Balanced Learning · NeurIPS 2021

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

image pasting · 0.6context-rich minority oversampling · 0.6softmax · 0.5instance reweighting · 0.5donsker-varadhan representation · 0.5discrepancy statistics · 0.5cross-entropy loss · 0.5contrastive learning · 0.5bias-contrastive loss · 0.5bias-balanced regression · 0.5
YearPublicationVenuePosition
2022 The Majority Can Help the Minority: Context-rich Minority Oversampling for Long-tailed Classification
abstract
The problem of class imbalanced data is that the gener-alization performance of the classifier deteriorates due to the lack of data from minority classes. In this paper, we pro-pose a novel minority over-sampling method to augment di-versified minority samples by leveraging the rich context of the majority classes as background images. To diversify the minority samples, our key idea is to paste an image from a minority class onto rich-context images from a majority class, using them as background images. Our method is simple and can be easily combined with the existing long-tailed recognition methods. We empirically prove the effectiveness of the proposed oversampling method through extensive experiments and ablation studies. Without any architectural changes or complex algorithms, our method achieves state-of-the-art performance on various long-tailed classification benchmarks. Our code is made available at https://github.com/naver-ai/cmo.
Seulki Park, Youngkyu Hong, Byeongho Heo, Sangdoo Yun, Jin Young Choi 0002
CVPR2
2021 Disentangling Label Distribution for Long-Tailed Visual Recognition
abstract
The current evaluation protocol of long-tailed visual recognition trains the classification model on the long-tailed source label distribution and evaluates its performance on the uniform target label distribution. Such protocol has questionable practicality since the target may also be long-tailed. Therefore, we formulate long-tailed visual recognition as a label shift problem where the tar-get and source label distributions are different. One of the significant hurdles in dealing with the label shift problem is the entanglement between the source label distribution and the model prediction. In this paper, we focus on disentangling the source label distribution from the model prediction. We first introduce a simple but over-looked baseline method that matches the target label distribution by post-processing the model prediction trained by the cross-entropy loss and the Softmax function. Al-though this method surpasses state-of-the-art methods on benchmark datasets, it can be further improved by directly disentangling the source label distribution from the model prediction in the training phase. Thus, we propose a novel method, LAbel distribution DisEntangling (LADE) loss based on the optimal bound of Donsker-Varadhan representation. LADE achieves state-of-the-art performance on benchmark datasets such as CIFAR-100-LT, Places-LT, ImageNet-LT, and iNaturalist 2018. Moreover, LADE out-performs existing methods on various shifted target label distributions, showing the general adaptability of our pro-posed method.
Youngkyu Hong, Seungju Han 0002, Kwanghee Choi, Seokjun Seo, Buru Chang
CVPR1
2021 Unbiased Classification through Bias-Contrastive and Bias-Balanced Learning
abstract
Datasets for training machine learning models tend to be biased unless the data is collected with complete care. In such a biased dataset, models are susceptible to making predictions based on the biased features of the data. The biased model fails to generalize to the case where correlations between biases and targets are shifted. To mitigate this, we propose Bias-Contrastive (BiasCon) loss based on the contrastive learning framework, which effectively leverages the knowledge of bias labels. We further suggest Bias-Balanced (BiasBal) regression which trains the classification model toward the data distribution with balanced target-bias correlation. Furthermore, we propose Soft Bias-Contrastive (SoftCon) loss which handles the dataset without bias labels by softening the pair assignment of the BiasCon loss based on the distance in the feature space of the bias-capturing model. Our experiments show that our proposed methods significantly improve previous debiasing methods in various realistic datasets.
Youngkyu Hong, Eunho Yang
NeurIPS1
2021 Self-Diagnosing GAN: Diagnosing Underrepresented Samples in Generative Adversarial Networks
abstract
Despite remarkable performance in producing realistic samples, Generative Adversarial Networks (GANs) often produce low-quality samples near low-density regions of the data manifold, e.g., samples of minor groups. Many techniques have been developed to improve the quality of generated samples, either by post-processing generated samples or by pre-processing the empirical data distribution, but at the cost of reduced diversity. To promote diversity in sample generation without degrading the overall quality, we propose a simple yet effective method to diagnose and emphasize underrepresented samples during training of a GAN. The main idea is to use the statistics of the discrepancy between the data distribution and the model distribution at each data instance. Based on the observation that the underrepresented samples have a high average discrepancy or high variability in discrepancy, we propose a method to emphasize those samples during training of a GAN. Our experimental results demonstrate that the proposed method improves GAN performance on various datasets, and it is especially effective in improving the quality and diversity of sample generation for minor groups.
Haeri Kim, Youngkyu Hong, Hye Won Chung
NeurIPS3