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

Nayeong Kim

dblp:322/6051 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
7since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 6 · 3 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Human-computer interaction and ubiquitous computing · 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
4 papers
Trustworthy machine learning · 60% Transfer learning and domain adaptation · 24% Optimization for machine learning · 8%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
robustness
2.132024
Improving Robustness to Multiple Spurious Correlations by Multi-Objective Optimization · ICML 2024
MemBN: Robust Test-Time Adaptation via Batch Norm with Statistics Memory · ECCV (28) 2024
Learning Debiased Classifier with Biased Committee · NeurIPS 2022
Machine learning › Transfer learning and domain adaptation
test-time adaptation
1.422024
MemBN: Robust Test-Time Adaptation via Batch Norm with Statistics Memory · ECCV (28) 2024
Leveraging Proxy of Training Data for Test-Time Adaptation · ICML 2023
Machine learning › Trustworthy machine learning
fairness
1.322024
Improving Robustness to Multiple Spurious Correlations by Multi-Objective Optimization · ICML 2024
Learning Debiased Classifier with Biased Committee · NeurIPS 2022
Machine learning › Trustworthy machine learning › robustness
spurious correlation
1.322024
Improving Robustness to Multiple Spurious Correlations by Multi-Objective Optimization · ICML 2024
Learning Debiased Classifier with Biased Committee · NeurIPS 2022
Machine learning › Transfer learning and domain adaptation
model adaptation
0.812024
MemBN: Robust Test-Time Adaptation via Batch Norm with Statistics Memory · ECCV (28) 2024
Machine learning › Optimization for machine learning
multi-objective optimization
0.812024
Improving Robustness to Multiple Spurious Correlations by Multi-Objective Optimization · ICML 2024
Machine learning › Efficient and distributed learning
dataset distillation
0.712023
Leveraging Proxy of Training Data for Test-Time Adaptation · ICML 2023
Machine learning › Trustworthy machine learning
debiasing
0.612022
Learning Debiased Classifier with Biased Committee · NeurIPS 2022

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

test-time adaptation · 0.8multi-objective optimization · 0.8minimax pareto optimization · 0.8batch normalization · 0.8test-time training · 0.7stylization · 0.7data condensation · 0.7knowledge transfer · 0.6bootstrapped ensemble · 0.6
YearPublicationVenuePosition
2025 SYNAuG: Exploiting synthetic data for data imbalance problems
Moon Ye-Bin, Nam Hyeon-Woo, Won-Seok Choi 0001, Nayeong Kim, Suha Kwak, Tae-Hyun Oh
Pattern Recognit. Lett.4
2024 VOICON: Geometric Motion-Based Visual Feedback in Voice User Interface
abstract
Geometric motion-based visual feedback widely used in existing voice assistants (VAs) plays a significant role in voice interactions. It enables a realtime and simultaneous depiction of VAs' conversational states, thereby mitigating the verbosity of speech and reducing unnecessary turn-taking. However, the study on VA visual feedback, which focuses on geometric motion graphics for different conversational states, has not been extensively explored. In this study, we systematically designed `Voicon', shape-based visual feedback, and explored the expandability of its visual language. To achieve this, we determined 3 conversational states through a literature review. We then conducted a conjoint analysis using the visual attributes extracted from a participatory design workshop. Based on the results, we proposed the Voicon system and created video prototypes for qualitative evaluation. Our findings demonstrated that our Voicon system is intuitively understandable and perceived as useful by users. We believe this pictorial enriches and expands the design space of visual feedback for VAs, which facilitates voice interaction.
Jeesun Oh, Nayeong Kim, Yuchun Yan
Conference on Designing Interactive Systems2
2024 MemBN: Robust Test-Time Adaptation via Batch Norm with Statistics Memory
Juwon Kang, Nayeong Kim, Jungseul Ok, Suha Kwak
ECCV (28)2
2024 Improving Robustness to Multiple Spurious Correlations by Multi-Objective Optimization
abstract
We study the problem of training an unbiased and accurate model given a dataset with multiple biases. This problem is challenging since the multiple biases cause multiple undesirable shortcuts during training, and even worse, mitigating one may exacerbate the other. We propose a novel training method to tackle this challenge. Our method first groups training data so that different groups induce different shortcuts, and then optimizes a linear combination of group-wise losses while adjusting their weights dynamically to alleviate conflicts between the groups in performance; this approach, rooted in the multi-objective optimization theory, encourages to achieve the minimax Pareto solution. We also present a new benchmark with multiple biases, dubbed MultiCelebA, for evaluating debiased training methods under realistic and challenging scenarios. Our method achieved the best on three datasets with multiple biases, and also showed superior performance on conventional single-bias datasets.
Nayeong Kim, Juwon Kang, Sungsoo Ahn, Jungseul Ok, Suha Kwak
ICML1
2023 Leveraging Proxy of Training Data for Test-Time Adaptation
abstract
We consider test-time adaptation (TTA), the task of adapting a trained model to an arbitrary test domain using unlabeled input data on-the-fly during testing. A common practice of TTA is to disregard data used in training due to large memory demand and privacy leakage. However, the training data are the only source of supervision. This motivates us to investigate a proper way of using them while minimizing the side effects. To this end, we propose two lightweight yet informative proxies of the training data and a TTA method fully exploiting them. One of the proxies is composed of a small number of images synthesized (hence, less privacy-sensitive) by data condensation which minimizes their domain-specificity to capture a general underlying structure over a wide spectrum of domains. Then, in TTA, they are translated into labeled test data by stylizing them to match styles of unlabeled test samples. This enables virtually supervised test-time training. The other proxy is inter-class relations of training data, which are transferred to target model during TTA. On four public benchmarks, our method outperforms the state-of-the-art ones at remarkably less computation and memory.
Juwon Kang, Nayeong Kim, Donghyeon Kwon, Jungseul Ok, Suha Kwak
ICML2
2022 Learning Debiased Classifier with Biased Committee
abstract
Neural networks are prone to be biased towards spurious correlations between classes and latent attributes exhibited in a major portion of training data, which ruins their generalization capability. We propose a new method for training debiased classifiers with no spurious attribute label. The key idea is to employ a committee of classifiers as an auxiliary module that identifies bias-conflicting data, i.e., data without spurious correlation, and assigns large weights to them when training the main classifier. The committee is learned as a bootstrapped ensemble so that a majority of its classifiers are biased as well as being diverse, and intentionally fail to predict classes of bias-conflicting data accordingly. The consensus within the committee on prediction difficulty thus provides a reliable cue for identifying and weighting bias-conflicting data. Moreover, the committee is also trained with knowledge transferred from the main classifier so that it gradually becomes debiased along with the main classifier and emphasizes more difficult data as training progresses. On five real-world datasets, our method outperforms prior arts using no spurious attribute label like ours and even surpasses those relying on bias labels occasionally. Our code is available at https://github.com/nayeong-v-kim/LWBC.
Nayeong Kim, Sehyun Hwang, Sungsoo Ahn, Jaesik Park, Suha Kwak
NeurIPS1
2021 Robust Crowd Counting via Image Enhancement and Dynamic Feature Selection
Nayeong Kim, Suha Kwak
BMVC1