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

Yoojin Jang 0001

dblp:96/2135-1 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2024
0000-0001-8150-3715ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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
Efficient and distributed learning · 56% Generative modeling · 32% Learning theory · 13%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model compression
1.422024
Nickel and Diming Your GAN: A Dual-Method Approach to Enhancing GAN Efficiency via Knowledge Distillation · ECCV (88) 2024
Can We Find Strong Lottery Tickets in Generative Models? · AAAI 2023
Machine learning › Generative modeling
generative adversarial network
0.812024
Nickel and Diming Your GAN: A Dual-Method Approach to Enhancing GAN Efficiency via Knowledge Distillation · ECCV (88) 2024
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.812024
Nickel and Diming Your GAN: A Dual-Method Approach to Enhancing GAN Efficiency via Knowledge Distillation · ECCV (88) 2024
Machine learning › Generative modeling
generative model evaluation
0.712023
TopP&R: Robust Support Estimation Approach for Evaluating Fidelity and Diversity in Generative Models · NeurIPS 2023
Machine learning › Efficient and distributed learning › model compression › sparse training
lottery ticket hypothesis
0.712023
Can We Find Strong Lottery Tickets in Generative Models? · AAAI 2023
Machine learning › Learning theory › distribution learning
support estimation
0.712023
TopP&R: Robust Support Estimation Approach for Evaluating Fidelity and Diversity in Generative Models · NeurIPS 2023

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

knowledge distillation · 0.8topological data analysis · 0.7statistical consistency analysis · 0.7network pruning · 0.7moment-matching scores · 0.7
YearPublicationVenuePosition
2024 Nickel and Diming Your GAN: A Dual-Method Approach to Enhancing GAN Efficiency via Knowledge Distillation
Sangyeop Yeo, Yoojin Jang 0001, Jaejun Yoo 0001
ECCV (88)2
2023 Can We Find Strong Lottery Tickets in Generative Models?
abstract
Yes. In this paper, we investigate strong lottery tickets in generative models, the subnetworks that achieve good generative performance without any weight update. Neural network pruning is considered the main cornerstone of model compression for reducing the costs of computation and memory. Unfortunately, pruning a generative model has not been extensively explored, and all existing pruning algorithms suffer from excessive weight-training costs, performance degradation, limited generalizability, or complicated training. To address these problems, we propose to find a strong lottery ticket via moment-matching scores. Our experimental results show that the discovered subnetwork can perform similarly or better than the trained dense model even when only 10% of the weights remain. To the best of our knowledge, we are the first to show the existence of strong lottery tickets in generative models and provide an algorithm to find it stably. Our code and supplementary materials are publicly available at https://lait-cvlab.github.io/SLT-in-Generative-Models/.
Sangyeop Yeo, Yoojin Jang 0001, Jy-yong Sohn, Dongyoon Han, Jaejun Yoo 0001
AAAI2
2023 TopP&R: Robust Support Estimation Approach for Evaluating Fidelity and Diversity in Generative Models
abstract
We propose a robust and reliable evaluation metric for generative models called Topological Precision and Recall (TopP&R, pronounced “topper”), which systematically estimates supports by retaining only topologically and statistically significant features with a certain level of confidence. Existing metrics, such as Inception Score (IS), Frechet Inception Distance (FID), and various Precision and Recall (P&R) variants, rely heavily on support estimates derived from sample features. However, the reliability of these estimates has been overlooked, even though the quality of the evaluation hinges entirely on their accuracy. In this paper, we demonstrate that current methods not only fail to accurately assess sample quality when support estimation is unreliable, but also yield inconsistent results. In contrast, TopP&R reliably evaluates the sample quality and ensures statistical consistency in its results. Our theoretical and experimental findings reveal that TopP&R provides a robust evaluation, accurately capturing the true trend of change in samples, even in the presence of outliers and non-independent and identically distributed (Non-IID) perturbations where other methods result in inaccurate support estimations. To our knowledge, TopP&R is the first evaluation metric specifically focused on the robust estimation of supports, offering statistical consistency under noise conditions.
Pum Jun Kim, Yoojin Jang 0001, Jaejun Yoo 0001
NeurIPS2