← Search

Sae-Young Chung

7 accepted papers

2023

Test-Time Adaptation via Self-Training with Nearest Neighbor Information

ICLR 2023poster

Test-time adaptation (TTA) aims to adapt a trained classifier using online unlabeled test data only, without any information related to the training procedure. Most existing TTA methods adapt the trained classifier using the classifier's prediction on the test data as pseudo-label. However, under te…

2022

Unsupervised Visual Representation Learning via Mutual Information Regularized Assignment

NeurIPS 2022accept

This paper proposes Mutual Information Regularized Assignment (MIRA), a pseudo-labeling algorithm for unsupervised representation learning inspired by information maximization. We formulate online pseudo-labeling as an optimization problem to find pseudo-labels that maximize the mutual information b…

2021

Improving Generalization in Meta-RL with Imaginary Tasks from Latent Dynamics Mixture

NeurIPS 2021poster

The generalization ability of most meta-reinforcement learning (meta-RL) methods is largely limited to test tasks that are sampled from the same distribution used to sample training tasks. To overcome the limitation, we propose Latent Dynamics Mixture (LDM) that trains a reinforcement learning agent…

2021

Unsupervised Embedding Adaptation via Early-Stage Feature Reconstruction for Few-Shot Classification

ICML 2021spotlight

We propose unsupervised embedding adaptation for the downstream few-shot classification task. Based on findings that deep neural networks learn to generalize before memorizing, we develop Early-Stage Feature Reconstruction (ESFR) — a novel adaptation scheme with feature reconstruction and dimensiona…

2020

Novelty Detection Via Blurring

ICLR 2020poster

Conventional out-of-distribution (OOD) detection schemes based on variational autoencoder or Random Network Distillation (RND) are known to assign lower uncertainty to the OOD data than the target distribution. In this work, we discover that such conventional novelty detection schemes are also vulne…

Cited by 41SourceScholar
2019

Sample-Efficient Deep Reinforcement Learning via Episodic Backward Update

NeurIPS 2019poster

We propose Episodic Backward Update (EBU) – a novel deep reinforcement learning algorithm with a direct value propagation. In contrast to the conventional use of the experience replay with uniform random sampling, our agent samples a whole episode and successively propagates the value of a state to…