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

Hyuntak Cha

dblp:269/9586 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 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
Trustworthy machine learning · 45% Learning paradigms · 39% Representation and self-supervised learning · 13%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms › continual learning
catastrophic forgetting
0.512021
Co2L: Contrastive Continual Learning · ICCV 2021
Machine learning › Learning paradigms
continual learning
0.512021
Co2L: Contrastive Continual Learning · ICCV 2021
Machine learning › Representation and self-supervised learning
contrastive learning
0.512021
Co2L: Contrastive Continual Learning · ICCV 2021
Machine learning › Learning paradigms › continual learning
rehearsal-based continual learning
0.512021
Co2L: Contrastive Continual Learning · ICCV 2021
Machine learning › Trustworthy machine learning
debiasing
0.412020
Learning from Failure: De-biasing Classifier from Biased Classifier · NeurIPS 2020
Machine learning › Trustworthy machine learning
fairness
0.412020
Learning from Failure: De-biasing Classifier from Biased Classifier · NeurIPS 2020
Machine learning › Trustworthy machine learning
robustness
0.412020
Learning from Failure: De-biasing Classifier from Biased Classifier · NeurIPS 2020
Machine learning › Trustworthy machine learning › robustness
spurious correlation
0.412020
Learning from Failure: De-biasing Classifier from Biased Classifier · NeurIPS 2020
Machine learning › Deep learning architectures and training
training dynamics
0.112020
Learning from Failure: De-biasing Classifier from Biased Classifier · NeurIPS 2020

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

self-supervised distillation · 0.5contrastive learning · 0.5failure-based debiasing · 0.4ensemble training · 0.4
YearPublicationVenuePosition
2021 Co2L: Contrastive Continual Learning
abstract
Recent breakthroughs in self-supervised learning show that such algorithms learn visual representations that can be transferred better to unseen tasks than cross-entropy based methods which rely on task-specific supervision. In this paper, we found that the similar holds in the continual learning context: contrastively learned representations are more robust against the catastrophic forgetting than ones trained with the cross-entropy objective. Based on this novel observation, we propose a rehearsal-based continual learning algorithm that focuses on continually learning and maintaining transferable representations. More specifically, the proposed scheme (1) learns representations using the contrastive learning objective, and (2) preserves learned representations using a self-supervised distillation step. We conduct extensive experimental validations under popular benchmark image classification datasets, where our method sets the new state-of-the-art performance. Source code is available at https://github.com/chaht01/Co2L.
Hyuntak Cha, Jaeho Lee 0001, Jinwoo Shin
ICCV1
2020 Learning from Failure: De-biasing Classifier from Biased Classifier
abstract
Neural networks often learn to make predictions that overly rely on spurious corre- lation existing in the dataset, which causes the model to be biased. While previous work tackles this issue by using explicit labeling on the spuriously correlated attributes or presuming a particular bias type, we instead utilize a cheaper, yet generic form of human knowledge, which can be widely applicable to various types of bias. We first observe that neural networks learn to rely on the spurious correlation only when it is “easier” to learn than the desired knowledge, and such reliance is most prominent during the early phase of training. Based on the obser- vations, we propose a failure-based debiasing scheme by training a pair of neural networks simultaneously. Our main idea is twofold; (a) we intentionally train the first network to be biased by repeatedly amplifying its “prejudice”, and (b) we debias the training of the second network by focusing on samples that go against the prejudice of the biased network in (a). Extensive experiments demonstrate that our method significantly improves the training of network against various types of biases in both synthetic and real-world datasets. Surprisingly, our framework even occasionally outperforms the debiasing methods requiring explicit supervision of the spuriously correlated attributes.
Junhyun Nam, Hyuntak Cha, Sungsoo Ahn, Jaeho Lee 0001, Jinwoo Shin
NeurIPS2