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.

Seokil Hong

dblp:243/2738 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
2since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 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
3 papers
Transfer learning and domain adaptation · 78% Learning paradigms · 19% Optimization for machine learning · 3%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation
few-shot learning
1.022022
Learning to Forget for Meta-Learning via Task-and-Layer-Wise Attenuation · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Learning to Forget for Meta-Learning · CVPR 2020
Machine learning › Transfer learning and domain adaptation
meta-learning
1.022022
Learning to Forget for Meta-Learning via Task-and-Layer-Wise Attenuation · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Learning to Forget for Meta-Learning · CVPR 2020
Machine learning › Transfer learning and domain adaptation › meta-learning › gradient-based meta-learning
model-agnostic meta-learning
1.022022
Learning to Forget for Meta-Learning via Task-and-Layer-Wise Attenuation · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Learning to Forget for Meta-Learning · CVPR 2020
Machine learning › Learning paradigms › continual learning
catastrophic forgetting
0.412019
Continual Learning by Asymmetric Loss Approximation With Single-Side Overestimation · ICCV 2019
Machine learning › Learning paradigms
continual learning
0.412019
Continual Learning by Asymmetric Loss Approximation With Single-Side Overestimation · ICCV 2019

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

meta-learning · 1.0attenuation · 0.6quadratic approximation · 0.4asymmetric loss approximation · 0.4
YearPublicationVenuePosition
2022 Fine-grained neural architecture search for image super-resolution
Seokil Hong, Bohyung Han, Heesoo Myeong, Kyoung Mu Lee
J. Vis. Commun. Image Represent.2
2022 Learning to Forget for Meta-Learning via Task-and-Layer-Wise Attenuation
abstract
Few-shot learning is an emerging yet challenging problem in which the goal is to achieve generalization from only few examples. Meta-learning tackles few-shot learning via the learning of prior knowledge shared across tasks and using it to learn new tasks. One of the most representative meta-learning algorithms is the model-agnostic meta-learning (MAML), which formulates prior knowledge as a common initialization, a shared starting point from where a learner can quickly adapt to unseen tasks. However, forcibly sharing an initialization can lead to conflicts among tasks and the compromised (undesired by tasks) location on optimization landscape, thereby hindering task adaptation. Furthermore, the degree of conflict is observed to vary not only among the tasks but also among the layers of a neural network. Thus, we propose task-and-layer-wise attenuation on the compromised initialization to reduce its adverse influence on task adaptation. As attenuation dynamically controls (or selectively forgets) the influence of the compromised prior knowledge for a given task and each layer, we name our method Learn to Forget (L2F). Experimental results demonstrate that the proposed method greatly improves the performance of the state-of-the-art MAML-based frameworks across diverse domains: few-shot classification, cross-domain few-shot classification, regression, reinforcement learning, and visual tracking.
Sungyong Baik, Junghoon Oh, Seokil Hong, Kyoung Mu Lee
IEEE Trans. Pattern Anal. Mach. Intell.3
2020 Learning to Forget for Meta-Learning
abstract
Few-shot learning is a challenging problem where the goal is to achieve generalization from only few examples. Model-agnostic meta-learning (MAML) tackles the problem by formulating prior knowledge as a common initialization across tasks, which is then used to quickly adapt to unseen tasks. However, forcibly sharing an initialization can lead to conflicts among tasks and the compromised (undesired by tasks) location on optimization landscape, thereby hindering the task adaptation. Further, we observe that the degree of conflict differs among not only tasks but also layers of a neural network. Thus, we propose task-and-layer-wise attenuation on the compromised initialization to reduce its influence. As the attenuation dynamically controls (or selectively forgets) the influence of prior knowledge for a given task and each layer, we name our method as L2F (Learn to Forget). The experimental results demonstrate that the proposed method provides faster adaptation and greatly improves the performance. Furthermore, L2F can be easily applied and improve other state-of-the-art MAML-based frameworks, illustrating its simplicity and generalizability.
Sungyong Baik, Seokil Hong, Kyoung Mu Lee
CVPR2
2019 Continual Learning by Asymmetric Loss Approximation With Single-Side Overestimation
abstract
Catastrophic forgetting is a critical challenge in training deep neural networks. Although continual learning has been investigated as a countermeasure to the problem, it often suffers from the requirements of additional network components and the limited scalability to a large number of tasks. We propose a novel approach to continual learning by approximating a true loss function using an asymmetric quadratic function with one of its sides overestimated. Our algorithm is motivated by the empirical observation that the network parameter updates affect the target loss functions asymmetrically. In the proposed continual learning framework, we estimate an asymmetric loss function for the tasks considered in the past through a proper overestimation of its unobserved sides in training new tasks, while deriving the accurate model parameter for the observable sides. In contrast to existing approaches, our method is free from the side effects and achieves the state-of-the-art accuracy that is even close to the upper-bound performance on several challenging benchmark datasets.
Dongmin Park, Seokil Hong, Bohyung Han, Kyoung Mu Lee
ICCV2