← Search

Ching-Yun Ko

9 accepted papers

2025

Attention Tracker: Detecting Prompt Injection Attacks in LLMs

NAACL 2025findings

Large Language Models (LLMs) have revolutionized various domains but remain vulnerable to prompt injection attacks, where malicious inputs manipulate the model into ignoring original instructions and executing designated action. In this paper, we investigate the underlying mechanisms of these attack…

2025

Large Language Models can Become Strong Self-Detoxifiers

ICLR 2025poster

Reducing the likelihood of generating harmful and toxic output is an essential task when aligning large language models (LLMs). Existing methods mainly rely on training an external reward model (i.e., another language model) or fine-tuning the LLM using self-generated data to influence the outcome.…

Cited by 0SourcePDFScholar
2025

STAR: Spectral Truncation and Rescale for Model Merging

NAACL 2025short

Model merging is an efficient way of obtaining a multi-task model from several pretrained models without further fine-tuning, and it has gained attention in various domains, including natural language processing (NLP). Despite the efficiency, a key challenge in model merging is the seemingly inevita…

2024

What Would Gauss Say About Representations? Probing Pretrained Image Models using Synthetic Gaussian Benchmarks

ICML 2024poster

Recent years have witnessed a paradigm shift in deep learning from task-centric model design to task-agnostic representation learning and task-specific fine-tuning. Pretrained model representations are commonly evaluated extensively across various real-world tasks and used as a foundation for differ…

Cited by 1SourcePDFScholar
2022

Revisiting Contrastive Learning through the Lens of Neighborhood Component Analysis: an Integrated Framework

ICML 2022spotlight

As a seminal tool in self-supervised representation learning, contrastive learning has gained unprecedented attention in recent years. In essence, contrastive learning aims to leverage pairs of positive and negative samples for representation learning, which relates to exploiting neighborhood inform…

Cited by 17SourcePDFScholar
2021

Hidden Cost of Randomized Smoothing

AISTATS 2021poster

The fragility of modern machine learning models has drawn a considerable amount of attention from both academia and the public. While immense interests were in either crafting adversarial attacks as a way to measure the robustness of neural networks or devising worst-case analytical robustness verif…

Cited by 31SourcePDFScholar
2020

Higher-Order Certification For Randomized Smoothing

NeurIPS 2020spotlight

Randomized smoothing is a recently proposed defense against adversarial attacks that has achieved state-of-the-art provable robustness against $\ell_2$ perturbations. A number of works have extended the guarantees to other metrics, such as $\ell_1$ or $\ell_\infty$, by using different smoothing meas…

Cited by 52SourcePDFScholar
2019

POPQORN: Quantifying Robustness of Recurrent Neural Networks

ICML 2019oral

The vulnerability to adversarial attacks has been a critical issue for deep neural networks. Addressing this issue requires a reliable way to evaluate the robustness of a network. Recently, several methods have been developed to compute robustness quantification for neural networks, namely, certifie…