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

Juseung Yun

dblp:247/6196 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
2since 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 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 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 · 37% Deep learning architectures and training · 22% Efficient and distributed learning · 18%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels
0.922021
Joint Negative and Positive Learning for Noisy Labels · CVPR 2021
NLNL: Negative Learning for Noisy Labels · ICCV 2019
Machine learning › Optimization for machine learning
hyperparameter optimization
0.612022
On the Angular Update and Hyperparameter Tuning of a Scale-Invariant Network · ECCV (12) 2022
Machine learning › Learning paradigms › weakly supervised learning
complementary label learning
0.512021
Joint Negative and Positive Learning for Noisy Labels · CVPR 2021
Machine learning › Deep learning architectures and training
loss function design
0.512021
Joint Negative and Positive Learning for Noisy Labels · CVPR 2021
Machine learning › Trustworthy machine learning › robustness › learning with noisy labels
noisy label classification
0.512021
Joint Negative and Positive Learning for Noisy Labels · CVPR 2021
Machine learning › Efficient and distributed learning
active learning
0.412020
Weight Decay Scheduling and Knowledge Distillation for Active Learning · ECCV (26) 2020
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.412020
Weight Decay Scheduling and Knowledge Distillation for Active Learning · ECCV (26) 2020
Machine learning › Trustworthy machine learning › robustness › learning with noisy labels
robustness to label noise
0.412019
NLNL: Negative Learning for Noisy Labels · ICCV 2019

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

semi-supervised learning · 0.9negative learning · 0.9angular update · 0.6positive learning · 0.5weight decay scheduling · 0.4
YearPublicationVenuePosition
2022 On the Angular Update and Hyperparameter Tuning of a Scale-Invariant Network
Juseung Yun, Janghyeon Lee 0001, Hyounguk Shon, Eojindl Yi, Junmo Kim 0002
ECCV (12)1
2021 Joint Negative and Positive Learning for Noisy Labels
abstract
Training of Convolutional Neural Networks (CNNs) with data with noisy labels is known to be a challenge. Based on the fact that directly providing the label to the data (Positive Learning; PL) has a risk of allowing CNNs to memorize the contaminated labels for the case of noisy data, the indirect learning approach that uses complementary labels (Negative Learning for Noisy Labels; NLNL) has proven to be highly effective in preventing overfitting to noisy data as it reduces the risk of providing faulty target. NLNL further employs a three-stage pipeline to improve convergence. As a result, filtering noisy data through the NLNL pipeline is cumbersome, increasing the training cost. In this study, we propose a novel improvement of NLNL, named Joint Negative and Positive Learning (JNPL), that unifies the filtering pipeline into a single stage. JNPL trains CNN via two losses, NL+ and PL+, which are improved upon NL and PL loss functions, respectively. We analyze the fundamental issue of NL loss function and develop new NL+ loss function producing gradient that enhances the convergence of noisy data. Furthermore, PL+ loss function is designed to enable faster convergence to expected-to-be-clean data. We show that the NL+ and PL+ train CNN simultaneously, significantly simplifying the pipeline, allowing greater ease of practical use compared to NLNL. With a simple semi-supervised training technique, our method achieves state-of-the-art accuracy for noisy data classification based on the superior filtering ability.
Youngdong Kim, Juseung Yun, Hyounguk Shon, Junmo Kim 0002
CVPR2
2020 Weight Decay Scheduling and Knowledge Distillation for Active Learning
Juseung Yun, Byungjoo Kim, Junmo Kim 0002
ECCV (26)1
2019 NLNL: Negative Learning for Noisy Labels
abstract
Convolutional Neural Networks (CNNs) provide excellent performance when used for image classification. The classical method of training CNNs is by labeling images in a supervised manner as in "input image belongs to this label'' (Positive Learning; PL), which is a fast and accurate method if the labels are assigned correctly to all images. However, if inaccurate labels, or noisy labels, exist, training with PL will provide wrong information, thus severely degrading performance. To address this issue, we start with an indirect learning method called Negative Learning (NL), in which the CNNs are trained using a complementary label as in "input image does not belong to this complementary label.'' Because the chances of selecting a true label as a complementary label are low, NL decreases the risk of providing incorrect information. Furthermore, to improve convergence, we extend our method by adopting PL selectively, termed as Selective Negative Learning and Positive Learning (SelNLPL). PL is used selectively to train upon expected-to-be-clean data, whose choices become possible as NL progresses, thus resulting in superior performance of filtering out noisy data. With simple semi-supervised training technique, our method achieves state-of-the-art accuracy for noisy data classification, proving the superiority of SelNLPL's noisy data filtering ability.
Youngdong Kim, Junho Yim, Juseung Yun, Junmo Kim 0002
ICCV3