← Search

Taesup Kim

24 accepted papers

2026

Angular Gradient Sign Method: Uncovering Vulnerabilities in Hyperbolic Networks

AAAI 2026technical

Adversarial examples in neural networks have been extensively studied in Euclidean settings, but recent advances in _hyperbolic networks_ call for a reevaluation of attack strategies in non-Euclidean geometries. Existing methods such as FGSM and PGD apply perturbations without regard to the underlyi

Cited by 0SourcePDFScholar
2026

Generalized and Personalized Federated Learning with Black-Box Foundation Models via Orthogonal Transformations

CVPR 2026

Federated Learning (FL) facilitates decentralized model training while preserving data privacy. However, achieving both robust generalization and effective personalization simultaneously in heterogeneous (non-IID) environments remains a formidable challenge. Furthermore, the widespread adoption of p

Cited by 0SourceScholar
2026

Preserve and Personalize: Personalized Text-to-Image Diffusion Models without Distributional Drift

ICLR 2026poster

Personalizing text-to-image diffusion models involves integrating novel visual concepts from a small set of reference images while retaining the model’s original generative capabilities. However, this process often leads to overfitting, where the model ignores the user’s prompt and merely replicates…

Cited by 0SourceScholar
2026

Towards Robust Real-World Multivariate Time Series Forecasting: A Unified Framework for Dependency, Asynchrony, and Missingness

ICLR 2026poster

Real-world time series data are inherently multivariate, often exhibiting complex inter-channel dependencies. Each channel is typically sampled at its own period and is prone to missing values due to various practical and operational constraints. These characteristics pose three fundamental challeng…

Cited by 0SourcecodeScholar
2025

ATAS: Any-to-Any Self-Distillation for Enhanced Open-Vocabulary Dense Prediction

ICCV 2025poster

Vision-language models such as CLIP have recently propelled open-vocabulary dense prediction tasks by enabling recognition of a broad range of visual concepts. However, CLIP still struggles with fine-grained, region-level understanding, hindering its effectiveness on these dense prediction tasks. We…

Cited by 0SourcePDFScholar
2025

Assessing Socio-Cultural Alignment and Technical Safety of Sovereign LLMs

EMNLP 2025

Recent trends in LLMs development clearly show growing interest in the use and application of sovereign LLMs. The global debate over sovereign LLMs highlights the need for governments to develop their LLMs, tailored to their unique socio-cultural and historical contexts. However, there remains a sho

2025

“Well, Keep Thinking”: Enhancing LLM Reasoning with Adaptive Injection Decoding

ACL 2025finding

Large language models (LLMs) exhibit strong reasoning abilities, often attributed to few-shot or zero-shot Chain-of-Thought (CoT) prompting. While effective, these methods require labor-intensive prompt engineering, raising the question of whether reasoning can be induced without reliance on explici…

Cited by 0SourcePDFScholar
2024

Hollowed Net for On-Device Personalization of Text-to-Image Diffusion Models

NeurIPS 2024poster

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…

Cited by 0SourcePDFScholar
2024

Mitigating Hallucination in Abstractive Summarization with Domain-Conditional Mutual Information

NAACL 2024findings

A primary challenge in abstractive summarization is hallucination—the phenomenon where a model generates plausible text that is absent in the source text. We hypothesize that the domain (or topic) of the source text triggers the model to generate text that is highly probable in the domain, neglectin…

2024

Model-based Preference Optimization in Abstractive Summarization without Human Feedback

EMNLP 2024main

In abstractive summarization, the challenge of producing concise and accurate summaries arises from the vast amount of information contained in the source document. Consequently, although Large Language Models (LLMs) can generate fluent text, they often introduce inaccuracies by hallucinating conten…

2023

Complementary Domain Adaptation and Generalization for Unsupervised Continual Domain Shift Learning

ICCV 2023poster

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 metho…

Cited by 4PDFScholar
2023

Meta-Learning With a Geometry-Adaptive Preconditioner

CVPR 2023poster

Model-agnostic meta-learning (MAML) is one of the most successful meta-learning algorithms. It has a bi-level optimization structure where the outer-loop process learns a shared initialization and the inner-loop process optimizes task-specific weights. Although MAML relies on the standard gradient d…

2022

Adaptive Interest for Emphatic Reinforcement Learning

NeurIPS 2022accept

Emphatic algorithms have shown great promise in stabilizing and improving reinforcement learning by selectively emphasizing the update rule. Although the emphasis fundamentally depends on an interest function which defines the intrinsic importance of each state, most approaches simply adopt a unifor…

Cited by 3SourcePDFScholar
2022

Faster Deep Reinforcement Learning with Slower Online Network

NeurIPS 2022accept

Deep reinforcement learning algorithms often use two networks for value function optimization: an online network, and a target network that tracks the online network with some delay. Using two separate networks enables the agent to hedge against issues that arise when performing bootstrapping. In th…

2018

Bayesian Model-Agnostic Meta-Learning

NeurIPS 2018spotlight

Due to the inherent model uncertainty, learning to infer Bayesian posterior from a few-shot dataset is an important step towards robust meta-learning. In this paper, we propose a novel Bayesian model-agnostic meta-learning method. The proposed method combines efficient gradient-based meta-learning w…

Cited by 536SourcePDFScholar
2018

Dynamic Frame Skipping for Fast Speech Recognition in Recurrent Neural Network Based Acoustic Models

ICASSP 2018accepted

A recurrent neural network is a powerful tool for modeling sequential data such as text and speech. While recurrent neural networks have achieved record-breaking results in speech recognition, one remaining challenge is their slow processing speed. The main cause comes from the nature of recurrent n…

Cited by 0SourceScholar
2018

PixelDefend: Leveraging Generative Models to Understand and Defend against Adversarial Examples

ICLR 2018poster

Adversarial perturbations of normal images are usually imperceptible to humans, but they can seriously confuse state-of-the-art machine learning models. What makes them so special in the eyes of image classifiers? In this paper, we show empirically that adversarial examples mainly lie in the low pro…