JYJayeon Yoo

Jayeon Yoo

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jayeon Yoo has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Mitigating the Bias in the Model for Continual Test-Time Adaptation

    by Inseop Chung, Kyomin Hwang, Jayeon Yoo, Nojun Kwak

    Modern machine-learning models often encounter streams of new, unlabeled data whose appearance gradually changes over time after deployment—for example, vision models on autonomous vehicles facing day-to-night transitions, surveillance cameras experiencing seasonal lighting shifts, or medical scanners with hardware ageing effects. Continual Test-Time Adaptation (CTA) refers to methods that, once a model is deployed, adapt it online during test time without any labeled examples or prior notice of distribution shifts to maintain accuracy in changing environments. However, as the model adapts, it can become over-confident in its mistakes and steadily biased toward recent but unreliable patterns. In this work, we introduce a simple prototype-based correction mechanism that stabilizes adaptation and reduces prediction bias. We maintain a running, class-wise exponential moving average (EMA) of target-domain feature centroids (prototypes) only from samples on which the model is confident. During adaptation, we softly re-cluster incoming features around these target prototypes and at the same time align them with the source-domain prototypes learned offline. This dual clustering alignment step can be seamlessly integrated into existing CTA methods with almost no extra computation. We validate our approach on standard corruption benchmarks, ImageNet-C and CIFAR100-C. When integrated into a strong CTA baseline, our method raises classification accuracy by 1.51% points on ImageNet-C and by 1.47% points on CIFAR100-C in the most challenging corruption streams, demonstrating that prototype-guided clustering significantly curbs drift without slowing down adaptation.


  • Open Access

    ProxyDet: Synthesizing Proxy Novel Classes via Classwise Mixup for Open-Vocabulary Object Detection

    by Joonhyun Jeong, Geondo Park, Jayeon Yoo, Hyungsik Jung, Heesu Kim

    Open-vocabulary object detection (OVOD) aims to recognize novel objects whose categories are not included in the training set. In order to classify these unseen classes during training, many OVOD frameworks leverage the zero-shot capability of largely pretrained vision and language models, such as CLIP. To further improve generalization on the unseen novel classes, several approaches proposed to additionally train with pseudo region labeling on the external data sources that contain a substantial number of novel category labels beyond the existing training data. Albeit its simplicity, these pseudo-labeling methods still exhibit limited improvement with regard to the truly unseen novel classes that were not pseudo-labeled. In this paper, we present a novel, yet simple technique that helps generalization on the overall distribution of novel classes. Inspired by our observation that numerous novel classes reside within the convex hull constructed by the base (seen) classes in the CLIP embedding space, we propose to synthesize proxy-novel classes approximating novel classes via linear mixup between a pair of base classes. By training our detector with these synthetic proxy-novel classes, we effectively explore the embedding space of novel classes. The experimental results on various OVOD benchmarks such as LVIS and COCO demonstrate superior performance on novel classes compared to the other state-of-the-art methods. Code is available at https://github.com/clovaai/ProxyDet.


  • Open Access

    ProxyDet: Synthesizing Proxy Novel Classes via Classwise Mixup for Open-Vocabulary Object Detection

    by Joonhyun Jeong, Geondo Park, Jayeon Yoo, Hyungsik Jung, Heesu Kim

    Open-vocabulary object detection (OVOD) aims to recognize novel objects whose categories are not included in the training set. In order to classify these unseen classes during training, many OVOD frameworks leverage the zero-shot capability of largely pretrained vision and language models, such as CLIP. To further improve generalization on the unseen novel classes, several approaches proposed to additionally train with pseudo region labeling on the external data sources that contain a substantial number of novel category labels beyond the existing training data. Albeit its simplicity, these pseudo-labeling methods still exhibit limited improvement with regard to the truly unseen novel classes that were not pseudo-labeled. In this paper, we present a novel, yet simple technique that helps generalization on the overall distribution of novel classes. Inspired by our observation that numerous novel classes reside within the convex hull constructed by the base (seen) classes in the CLIP embedding space, we propose to synthesize proxy-novel classes approximating novel classes via linear mixup between a pair of base classes. By training our detector with these synthetic proxy-novel classes, we effectively explore the embedding space of novel classes. The experimental results on various OVOD benchmarks such as LVIS and COCO demonstrate superior performance on novel classes compared to the other state-of-the-art methods. Code is available at https://github.com/clovaai/ProxyDet.

  • Open Access

    Finding Efficient Pruned Network via Refined Gradients for Pruned Weights

    by Jangho Kim, Jayeon Yoo, Yeji Song, KiYoon Yoo, Nojun Kwak


  • Open Access

    SHOT: Suppressing the Hessian along the Optimization Trajectory for Gradient-Based Meta-Learning

    by JunHoo Lee, Jayeon Yoo, Nojun Kwak

    In this paper, we hypothesize that gradient-based meta-learning (GBML) implicitly suppresses the Hessian along the optimization trajectory in the inner loop. Based on this hypothesis, we introduce an algorithm called SHOT (Suppressing the Hessian along the Optimization Trajectory) that minimizes the distance between the parameters of the target and reference models to suppress the Hessian in the inner loop. Despite dealing with high-order terms, SHOT does not increase the computational complexity of the baseline model much. It is agnostic to both the algorithm and architecture used in GBML, making it highly versatile and applicable to any GBML baseline. To validate the effectiveness of SHOT, we conduct empirical tests on standard few-shot learning tasks and qualitatively analyze its dynamics. We confirm our hypothesis empirically and demonstrate that SHOT outperforms the corresponding baseline. Code is available at: https://github.com/JunHoo-Lee/SHOT

  • Open Access

    Dynamic Collective Intelligence Learning: Finding Efficient Sparse Model via Refined Gradients for Pruned Weights

    by Jangho Kim, Jayeon Yoo, Yeji Song, KiYoon Yoo, Nojun Kwak

    With the growth of deep neural networks (DNN), the number of DNN parameters has drastically increased. This makes DNN models hard to be deployed on resource-limited embedded systems. To alleviate this problem, dynamic pruning methods have emerged, which try to find diverse sparsity patterns during training by utilizing Straight-Through-Estimator (STE) to approximate gradients of pruned weights. STE can help the pruned weights revive in the process of finding dynamic sparsity patterns. However, using these coarse gradients causes training instability and performance degradation owing to the unreliable gradient signal of the STE approximation. In this work, to tackle this issue, we introduce refined gradients to update the pruned weights by forming dual forwarding paths from two sets (pruned and unpruned) of weights. We propose a novel Dynamic Collective Intelligence Learning (DCIL) which makes use of the learning synergy between the collective intelligence of both weight sets. We verify the usefulness of the refined gradients by showing enhancements in the training stability and the model performance on the CIFAR and ImageNet datasets. DCIL outperforms various previously proposed pruning schemes including other dynamic pruning methods with enhanced stability during training.