activity
20092023
most citedA Simple Unified Framework for Detecting Out-of-Distribution Samples and Adversarial Attacks

982 citations · 2.8k across the 131 of their papers we have counts for

collaborators
Showing 2021Show all

23 papers · 1 filter

cs.CV2021

Saliency Grafting: Innocuous Attribution-Guided Mixup with Calibrated Label Mixing

Joonhyung Park, June Yong Yang, Jinwoo Shin +2

The Mixup scheme suggests mixing a pair of samples to create an augmented training sample and has gained considerable attention recently for improving the generalizability of neura…

cs.LG2021★ 9 cited

Improving Transferability of Representations via Augmentation-Aware Self-Supervision

Hankook Lee, Kibok Lee, Kimin Lee +2

Recent unsupervised representation learning methods have shown to be effective in a range of vision tasks by learning representations invariant to data augmentations such as random…

cs.LG2021★ 13 cited

SmoothMix: Training Confidence-calibrated Smoothed Classifiers for Certified Robustness

Jongheon Jeong, Sejun Park, Minkyu Kim +3

Randomized smoothing is currently a state-of-the-art method to construct a certifiably robust classifier from neural networks against -adversarial perturbations. Under the…

cs.LG2021

Meta-Learning Sparse Implicit Neural Representations

Jaeho Lee, Jihoon Tack, Namhoon Lee +1

Implicit neural representations are a promising new avenue of representing general signals by learning a continuous function that, parameterized as a neural network, maps the domai…

cs.LG2021★ 13 cited

DAPPER: Label-Free Performance Estimation after Personalization for Heterogeneous Mobile Sensing

Taesik Gong, Yewon Kim, Adiba Orzikulova +4

Many applications utilize sensors in mobile devices and machine learning to provide novel services. However, various factors such as different users, devices, and environments impa…

cs.LG2021★ 2 cited

RoMA: Robust Model Adaptation for Offline Model-based Optimization

Sihyun Yu, Sungsoo Ahn, Le Song +1

We consider the problem of searching an input maximizing a black-box objective function given a static dataset of input-output queries. A popular approach to solving this problem i…

cs.LG2021★ 3 cited

Object-Aware Regularization for Addressing Causal Confusion in Imitation Learning

Jongjin Park, Younggyo Seo, Chang Liu +4

Behavioral cloning has proven to be effective for learning sequential decision-making policies from expert demonstrations. However, behavioral cloning often suffers from the causal…

cs.LG2021★ 19 cited

Landmark-Guided Subgoal Generation in Hierarchical Reinforcement Learning

Junsu Kim, Younggyo Seo, Jinwoo Shin

Goal-conditioned hierarchical reinforcement learning (HRL) has shown promising results for solving complex and long-horizon RL tasks. However, the action space of high-level policy…

cs.LG2021★ 1 cited

Abstract Reasoning via Logic-guided Generation

Sihyun Yu, Sangwoo Mo, Sungsoo Ahn +1

Abstract reasoning, i.e., inferring complicated patterns from given observations, is a central building block of artificial general intelligence. While humans find the answer by ei…

cs.CV2021★ 16 cited

Object-aware Contrastive Learning for Debiased Scene Representation

Sangwoo Mo, Hyunwoo Kang, Kihyuk Sohn +2

Contrastive self-supervised learning has shown impressive results in learning visual representations from unlabeled images by enforcing invariance against different data augmentati…

math.DG2021

Convergence rate of the prescribed curvature flow

Pak Tung Ho, Jinwoo Shin

The prescribed scalar curvature flow was introduced to study the problem of prescribing scalar curvature on manifolds. Carlotto, Chodosh and Rubinstein have studied the convergence…

cs.CV2021★ 7 cited

OpenCoS: Contrastive Semi-supervised Learning for Handling Open-set Unlabeled Data

Jongjin Park, Sukmin Yun, Jongheon Jeong +1

Semi-supervised learning (SSL) has been a powerful strategy to incorporate few labels in learning better representations. In this paper, we focus on a practical scenario that one a…

cs.RO2021★ 12 cited

Offline-to-Online Reinforcement Learning via Balanced Replay and Pessimistic Q-Ensemble

Seunghyun Lee, Younggyo Seo, Kimin Lee +2

Recent advance in deep offline reinforcement learning (RL) has made it possible to train strong robotic agents from offline datasets. However, depending on the quality of the train…

cs.LG2021★ 6 cited

CoL: Contrastive Continual Learning

Hyuntak Cha, Jaeho Lee, Jinwoo Shin

Recent breakthroughs in self-supervised learning show that such algorithms learn visual representations that can be transferred better to unseen tasks than joint-training methods r…

cs.LG2021★ 2 cited

Self-Improved Retrosynthetic Planning

Junsu Kim, Sungsoo Ahn, Hankook Lee +1

Retrosynthetic planning is a fundamental problem in chemistry for finding a pathway of reactions to synthesize a target molecule. Recently, search algorithms have shown promising r…

cs.LG2021★ 7 cited

RetCL: A Selection-based Approach for Retrosynthesis via Contrastive Learning

Hankook Lee, Sungsoo Ahn, Seung-Woo Seo +4

Retrosynthesis, of which the goal is to find a set of reactants for synthesizing a target product, is an emerging research area of deep learning. While the existing approaches have…

cs.LG2021★ 2 cited

Scaling Neural Tangent Kernels via Sketching and Random Features

Amir Zandieh, Insu Han, Haim Avron +3

The Neural Tangent Kernel (NTK) characterizes the behavior of infinitely-wide neural networks trained under least squares loss by gradient descent. Recent works also report that NT…

cs.LG2021★ 2 cited

Consistency and Monotonicity Regularization for Neural Knowledge Tracing

Seewoo Lee, Youngduck Choi, Juneyoung Park +2

Knowledge Tracing (KT), tracking a human's knowledge acquisition, is a central component in online learning and AI in Education. In this paper, we present a simple, yet effective s…

cs.LG2021

Random Features for the Neural Tangent Kernel

Insu Han, Haim Avron, Neta Shoham +2

The Neural Tangent Kernel (NTK) has discovered connections between deep neural networks and kernel methods with insights of optimization and generalization. Motivated by this, rece…

cs.LG2021★ 8 cited

Training GANs with Stronger Augmentations via Contrastive Discriminator

Jongheon Jeong, Jinwoo Shin

Recent works in Generative Adversarial Networks (GANs) are actively revisiting various data augmentation techniques as an effective way to prevent discriminator overfitting. It is…

cs.LG2021★ 4 cited

Consistency Regularization for Adversarial Robustness

Jihoon Tack, Sihyun Yu, Jongheon Jeong +3

Adversarial training (AT) is currently one of the most successful methods to obtain the adversarial robustness of deep neural networks. However, the phenomenon of robust overfittin…

cs.LG2021

Model-Augmented Q-learning

Youngmin Oh, Jinwoo Shin, Eunho Yang +1

In recent years, -learning has become indispensable for model-free reinforcement learning (MFRL). However, it suffers from well-known problems such as under- and overestimation…

cs.LG2021★ 21 cited

State Entropy Maximization with Random Encoders for Efficient Exploration

Younggyo Seo, Lili Chen, Jinwoo Shin +3

Recent exploration methods have proven to be a recipe for improving sample-efficiency in deep reinforcement learning (RL). However, efficient exploration in high-dimensional observ…