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

Wonguk Cho

dblp:319/3781 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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
2 papers
Efficient and distributed learning · 42% Transfer learning and domain adaptation · 28% Generative modeling · 21%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
0.812024
Hollowed Net for On-Device Personalization of Text-to-Image Diffusion Models · NeurIPS 2024
Machine learning › Efficient and distributed learning › parameter-efficient fine-tuning
low-rank adaptation
0.812024
Hollowed Net for On-Device Personalization of Text-to-Image Diffusion Models · NeurIPS 2024
Machine learning › Efficient and distributed learning
model compression
0.812024
Hollowed Net for On-Device Personalization of Text-to-Image Diffusion Models · NeurIPS 2024
Machine learning › Efficient and distributed learning › edge computing › on-device machine learning
on-device personalization
0.812024
Hollowed Net for On-Device Personalization of Text-to-Image Diffusion Models · NeurIPS 2024
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
0.812024
Hollowed Net for On-Device Personalization of Text-to-Image Diffusion Models · NeurIPS 2024
Machine learning › Generative modeling › diffusion model › text-to-image generation
personalized text-to-image generation
0.812024
Hollowed Net for On-Device Personalization of Text-to-Image Diffusion Models · NeurIPS 2024
Machine learning › Learning paradigms › lifelong learning
continual domain shift
0.712023
Complementary Domain Adaptation and Generalization for Unsupervised Continual Domain Shift Learning · ICCV 2023
Machine learning › Transfer learning and domain adaptation
domain adaptation
0.712023
Complementary Domain Adaptation and Generalization for Unsupervised Continual Domain Shift Learning · ICCV 2023
Machine learning › Transfer learning and domain adaptation
domain generalization
0.712023
Complementary Domain Adaptation and Generalization for Unsupervised Continual Domain Shift Learning · ICCV 2023
Machine learning › Transfer learning and domain adaptation › domain adaptation
unsupervised domain adaptation
0.712023
Complementary Domain Adaptation and Generalization for Unsupervised Continual Domain Shift Learning · ICCV 2023

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

model-agnostic framework · 0.7complementary learning · 0.7
YearPublicationVenuePosition
2024 Hollowed Net for On-Device Personalization of Text-to-Image Diffusion Models
abstract
Recent advancements in text-to-image diffusion models have enabled the personalization of these models to generate custom images from textual prompts. This paper presents an efficient LoRA-based personalization approach for on-device subject-driven generation, where pre-trained diffusion models are fine-tuned with user-specific data on resource-constrained devices. Our method, termed Hollowed Net, enhances memory efficiency during fine-tuning by modifying the architecture of a diffusion U-Net to temporarily remove a fraction of its deep layers, creating a hollowed structure. This approach directly addresses on-device memory constraints and substantially reduces GPU memory requirements for training, in contrast to previous methods that primarily focus on minimizing training steps and reducing the number of parameters to update. Additionally, the personalized Hollowed Net can be transferred back into the original U-Net, enabling inference without additional memory overhead. Quantitative and qualitative analyses demonstrate that our approach not only reduces training memory to levels as low as those required for inference but also maintains or improves personalization performance compared to existing methods.
Wonguk Cho, Seokeon Choi, Debasmit Das, Matthias Reisser, Taesup Kim, Sungrack Yun, Fatih Porikli
NeurIPS1
2023 Complementary Domain Adaptation and Generalization for Unsupervised Continual Domain Shift Learning
abstract
Continual domain shift poses a significant challenge in real-world applications, particularly in situations where labeled data is not available for new domains. The challenge of acquiring knowledge in this problem setting is referred to as unsupervised continual domain shift learning. Existing methods for domain adaptation and generalization have limitations in addressing this issue, as they focus either on adapting to a specific domain or generalizing to unseen domains, but not both. In this paper, we propose Complementary Domain Adaptation and Generalization (CoDAG), a simple yet effective learning framework that combines domain adaptation and generalization in a complementary manner to achieve three major goals of unsupervised continual domain shift learning: adapting to a current domain, generalizing to unseen domains, and preventing forgetting of previously seen domains. Our approach is model-agnostic, meaning that it is compatible with any existing domain adaptation and generalization algorithms. We evaluate CoDAG on several benchmark datasets and demonstrate that our model outperforms state-of-the-art models in all datasets and evaluation metrics, highlighting its effectiveness and robustness in handling unsupervised continual domain shift learning.
Wonguk Cho, Jinha Park, Taesup Kim
ICCV1