Demo Data from EDBT 2026 / reviewers in the wild / expert
KiYoon Yoo
dblp:266/1524
· DBLP profile ↗
8ranked-venue papers
3as first author
7since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 3 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 4 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.
| Network and information security
4 papers |
Security and privacy of machine learning · 66% Digital forensics and information hiding · 34% | |
| Artificial intelligence
5 papers |
Efficient and distributed learning · 86% Generative modeling · 8% Language models and text generation · 5% | |
| Computer graphics and multimedia
1 paper |
Visual content generation and editing · 100% |
Topics — the 13 heaviest of 15, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
model compression |
1.1 | 2 | 2023 | Finding Efficient Pruned Network via Refined Gradients for Pruned Weights · ACM Multimedia 2023 Position-based Scaled Gradient for Model Quantization and Pruning · NeurIPS 2020 |
Security and privacy of machine learning › generative model security
generative model protection |
1.0 | 1 | 2026 | Imperceptible Protection Against Style Imitation From Diffusion Models · IEEE Trans. Multim. 2026 |
Visual content generation and editing › image generation
diffusion-based image generation |
0.9 | 1 | 2025 | Nearly Zero-Cost Protection Against Mimicry by Personalized Diffusion Models · CVPR 2025 |
Machine learning › Efficient and distributed learning › model compression › pruning
dynamic pruning |
0.7 | 1 | 2023 | Finding Efficient Pruned Network via Refined Gradients for Pruned Weights · ACM Multimedia 2023 |
Digital forensics and information hiding › watermarking › text watermarking
natural language watermarking |
0.7 | 1 | 2023 | Robust Multi-bit Natural Language Watermarking through Invariant Features · ACL (1) 2023 |
Digital forensics and information hiding
watermarking |
0.7 | 1 | 2023 | Robust Multi-bit Natural Language Watermarking through Invariant Features · ACL (1) 2023 |
Machine learning › Efficient and distributed learning
federated learning |
0.6 | 1 | 2022 | Backdoor Attacks in Federated Learning by Rare Embeddings and Gradient Ensembling · EMNLP 2022 |
Security and privacy of machine learning › adversarial attack
backdoor attack |
0.6 | 1 | 2022 | Backdoor Attacks in Federated Learning by Rare Embeddings and Gradient Ensembling · EMNLP 2022 |
Security and privacy of machine learning › adversarial attack › backdoor attack
federated learning backdoor |
0.6 | 1 | 2022 | Backdoor Attacks in Federated Learning by Rare Embeddings and Gradient Ensembling · EMNLP 2022 |
Machine learning › Efficient and distributed learning › model compression
pruning |
0.4 | 1 | 2020 | Position-based Scaled Gradient for Model Quantization and Pruning · NeurIPS 2020 |
Machine learning › Efficient and distributed learning › model compression
quantization |
0.4 | 1 | 2020 | Position-based Scaled Gradient for Model Quantization and Pruning · NeurIPS 2020 |
Machine learning › Generative modeling
diffusion model |
0.3 | 1 | 2026 | Imperceptible Protection Against Style Imitation From Diffusion Models · IEEE Trans. Multim. 2026 |
Natural language and speech › Language models and text generation
text generation |
0.2 | 1 | 2023 | Robust Multi-bit Natural Language Watermarking through Invariant Features · ACL (1) 2023 |
Methods — techniques the papers use, named apart from their topics
perceptual constraints · 2.0adversarial perturbation · 2.0perturbation pre-training · 1.7mixture-of-perturbations · 1.7VAE feature space loss · 1.7invariant feature analysis · 1.3infill model · 1.3rare word embedding · 1.1gradient ensemble · 1.1straight-through estimator · 0.7dynamic collective intelligence learning · 0.7scaled gradient · 0.4gradient descent · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Imperceptible Protection Against Style Imitation From Diffusion ModelsabstractRecent progress in diffusion models has profoundly enhanced the fidelity of image generation, but it has raised concerns about copyright infringements. While prior methods have introduced adversarial perturbations to prevent style imitation, most are accompanied by the degradation of artworks' visual quality. Recognizing the importance of maintaining this, we intro duce a visually improved protection method while preserving its protection capability. To this end, we devise a perceptual map to highlight areas sensitive to human eyes, guided by instance-aware refinement, which refines the protection intensity accordingly. We also introduce a difficulty-aware protection by predicting how difficult the artwork is to protect and dynamically adjusting the intensity based on this. Lastly, we integrate a perceptual constraints bank to further improve the imperceptibility. Results show that our method substantially elevates the quality of the protected image without compromising on protection efficacy. Namhyuk Ahn, Wonhyuk Ahn, KiYoon Yoo, Seung-Hun Nam |
IEEE Trans. Multim. | 3 |
| 2025 | Nearly Zero-Cost Protection Against Mimicry by Personalized Diffusion ModelsabstractRecent advancements in diffusion models revolutionize image generation but pose risks of misuse, such as replicating artworks or generating deepfakes. Existing image protection methods, though effective, struggle to balance protection efficacy, invisibility, and latency, thus limiting practical use. We introduce perturbation pre-training to reduce latency and propose a mixture-of-perturbations approach that dynamically adapts to input images to minimize performance degradation. Our novel training strategy computes protection loss across multiple VAE feature spaces, while adaptive targeted protection at inference enhances robustness and invisibility. Experiments show comparable protection performance with improved invisibility and drastically reduced inference time. The code and demo are available at https://webtoon.github.io/impasto Namhyuk Ahn, KiYoon Yoo, Wonhyuk Ahn, Seung-Hun Nam |
CVPR | 2 |
| 2024 | Advancing Beyond Identification: Multi-bit Watermark for Large Language ModelsabstractKiYoon Yoo, Wonhyuk Ahn, Nojun Kwak. Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2024. KiYoon Yoo, Wonhyuk Ahn, Nojun Kwak |
NAACL-HLT | 1 |
| 2023 | Robust Multi-bit Natural Language Watermarking through Invariant FeaturesabstractRecent years have witnessed a proliferation of valuable original natural language contents found in subscription-based media outlets, web novel platforms, and outputs of large language models.However, these contents are susceptible to illegal piracy and potential misuse without proper security measures.This calls for a secure watermarking system to guarantee copyright protection through leakage tracing or ownership identification.To effectively combat piracy and protect copyrights, a multi-bit watermarking framework should be able to embed adequate bits of information and extract the watermarks in a robust manner despite possible corruption.In this work, we explore ways to advance both payload and robustness by following a well-known proposition from image watermarking and identify features in natural language that are invariant to minor corruption.Through a systematic analysis of the possible sources of errors, we further propose a corruption-resistant infill model.Our full method improves upon the previous work on robustness by +16.8% point on average on four datasets, three corruption types, and two corruption ratios. 1 KiYoon Yoo, Wonhyuk Ahn, Jiho Jang, Nojun Kwak |
ACL (1) | 1 |
| 2023 | Finding Efficient Pruned Network via Refined Gradients for Pruned WeightsabstractWith the growth of deep neural networks (DNN), the number of DNN parameters has drastically increased. This makes DNN models hard to be deployed on resource-limited embedded systems. To alleviate this problem, dynamic pruning methods have emerged, which try to find diverse sparsity patterns during training by utilizing Straight-Through-Estimator (STE) to approximate gradients of pruned weights. STE can help the pruned weights revive in the process of finding dynamic sparsity patterns. However, using these coarse gradients causes training instability and performance degradation owing to the unreliable gradient signal of the STE approximation. In this work, to tackle this issue, we introduce refined gradients to update the pruned weights by forming dual forwarding paths from two sets (pruned and unpruned) of weights. We propose a novel Dynamic Collective Intelligence Learning (DCIL) which makes use of the learning synergy between the collective intelligence of both weight sets. We verify the usefulness of the refined gradients by showing enhancements in the training stability and the model performance on the CIFAR and ImageNet datasets. DCIL outperforms various previously proposed pruning schemes including other dynamic pruning methods with enhanced stability during training. The code is provided in Github. Jangho Kim, Jayeon Yoo, Yeji Song, KiYoon Yoo, Nojun Kwak |
ACM Multimedia | 4 |
| 2023 | Self-Distilled Self-supervised Representation LearningabstractState-of-the-art frameworks in self-supervised learning have recently shown that fully utilizing transformer-based models can lead to performance boost compared to conventional CNN models. Striving to maximize the mutual information of two views of an image, existing works apply a contrastive loss to the final representations. Motivated by self-distillation in the supervised regime, we further exploit this by allowing the intermediate representations to learn from the final layer via the contrastive loss. Through self-distillation, the intermediate layers are better suited for instance discrimination, making the performance of an early-exited sub-network not much degraded from that of the full network. This renders the pretext task easier also for the final layer, leading to better representations. Our method, Self-Distilled Self-Supervised Learning (SDSSL), outperforms competitive baselines (SimCLR, BYOL and MoCo v3) using ViT on various tasks and datasets. In the linear evaluation and k-NN protocol, SDSSL not only leads to superior performance in the final layers, but also in most of the lower layers. Furthermore, qualitative and quantitative analyses show how representations are formed more effectively along the transformer layers. Code is available at https://github.com/hagiss/SDSSL. Jiho Jang, Seonhoon Kim, KiYoon Yoo, Chaerin Kong, Jangho Kim, Nojun Kwak |
WACV | 3 |
| 2022 | Backdoor Attacks in Federated Learning by Rare Embeddings and Gradient EnsemblingabstractRecent advances in federated learning have demonstrated its promising capability to learn on decentralized datasets.However, a considerable amount of work has raised concerns due to the potential risks of adversaries participating in the framework to poison the global model for an adversarial purpose.This paper investigates the feasibility of model poisoning for backdoor attacks through rare word embeddings of NLP models.In text classification, less than 1% of adversary clients suffices to manipulate the model output without any drop in the performance on clean sentences.For a less complex dataset, a mere 0.1% of adversary clients is enough to poison the global model effectively.We also propose a technique specialized in the federated learning scheme called Gradient Ensemble, which enhances the backdoor performance in all our experimental settings. KiYoon Yoo, Nojun Kwak |
EMNLP | 1 |
| 2020 | Position-based Scaled Gradient for Model Quantization and PruningabstractWe propose the position-based scaled gradient (PSG) that scales the gradient depending on the position of a weight vector to make it more compression-friendly. First, we theoretically show that applying PSG to the standard gradient descent (GD), which is called PSGD, is equivalent to the GD in the warped weight space, a space made by warping the original weight space via an appropriately designed invertible function. Second, we empirically show that PSG acting as a regularizer to a weight vector is favorable for model compression domains such as quantization and pruning. PSG reduces the gap between the weight distributions of a full-precision model and its compressed counterpart. This enables the versatile deployment of a model either as an uncompressed mode or as a compressed mode depending on the availability of resources. The experimental results on CIFAR-10/100 and ImageNet datasets show the effectiveness of the proposed PSG in both domains of pruning and quantization even for extremely low bits. The code is released in Github. Jangho Kim, KiYoon Yoo, Nojun Kwak |
NeurIPS | 2 |