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

Jinhwan Choi

dblp:223/6872 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2021
0000-0003-0613-7238ORCID · corroborated

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

Systems, architecture and hardware · 2 · 2 first-authorArtificial intelligence and machine learning · 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
Trustworthy machine learning · 67% Representation and self-supervised learning · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels
0.512021
FINE Samples for Learning with Noisy Labels · NeurIPS 2021
Machine learning › Trustworthy machine learning › robustness › learning with noisy labels
noisy label detection
0.512021
FINE Samples for Learning with Noisy Labels · NeurIPS 2021
Machine learning › Representation and self-supervised learning › representation analysis
representation dynamics
0.512021
FINE Samples for Learning with Noisy Labels · NeurIPS 2021

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

semi-supervised learning · 0.5eigendecomposition · 0.5data gram matrix · 0.5
YearPublicationVenuePosition
2021 FINE Samples for Learning with Noisy Labels
abstract
Modern deep neural networks (DNNs) become frail when the datasets contain noisy (incorrect) class labels. Robust techniques in the presence of noisy labels can be categorized into two folds: developing noise-robust functions or using noise-cleansing methods by detecting the noisy data. Recently, noise-cleansing methods have been considered as the most competitive noisy-label learning algorithms. Despite their success, their noisy label detectors are often based on heuristics more than a theory, requiring a robust classifier to predict the noisy data with loss values. In this paper, we propose a novel detector for filtering label noise. Unlike most existing methods, we focus on each data's latent representation dynamics and measure the alignment between the latent distribution and each representation using the eigen decomposition of the data gram matrix. Our framework, coined as filtering noisy instances via their eigenvectors (FINE), provides a robust detector with derivative-free simple methods having theoretical guarantees. Under our framework, we propose three applications of the FINE: sample-selection approach, semi-supervised learning approach, and collaboration with noise-robust loss functions. Experimental results show that the proposed methods consistently outperform corresponding baselines for all three applications on various benchmark datasets.
Taehyeon Kim 0001, Jongwoo Ko, Sangwook Cho, Jinhwan Choi, Se-Young Yun
NeurIPS4
2020 Learning-based dynamic cache management in a cloud
Jinhwan Choi, Yu Gu 0001, Jinoh Kim
J. Parallel Distributed Comput.1
2018 Spatio-Temporal Analysis of HPC I/O and Connection Data
abstract
The HPC system consists of a set of layers of software and hardware for I/O and networking. System logs are helpful resources to understand what is going on in the system. A challenge is that it is non-trivial to analyze the logs maintained in various levels of the stack. Independent analysis might lead to an incomplete conclusion due to the limited coverage of each log. This work takes a comprehensive approach to analysis that incorporates the logs in the multiple layers and components, in order to facilitate the detection of anomalous activities. This research aims to identify and predict potential performance bottlenecks in the HPC system, by capturing the temporal variation patterns from heterogeneous, high-dimensional, and non-linear log data. In this paper, we share our preliminary efforts for spatio-temporal analysis of HPC I/O and connection data, with our initial observations from the analysis of one-week HPC log data sets collected from one of NERSC systems.
Jinhwan Choi, Alex Sim
ICDCS1