← Search

Shiyu Chang

71 accepted papers

2026

RetouchIQ: MLLM Agents for Instruction-Based Image Retouching with Generalist Reward

CVPR 2026

Recent advances in multimodal large language models (MLLMs) have shown great potential for extending vision-language reasoning to professional tool-based image editing, enabling intuitive and creative editing. A promising direction is to use reinforcement learning (RL) to enable MLLMs to reason abou

Cited by 0SourceScholar
2026

Unlocking Speech–Text Compositional Powers: Instruction-Following Speech Language Models without Instruction Tuning

ICML 2026poster

Instruction tuning for speech language models (SLMs) is substantially more challenging than for text-based large language models (LLMs), as it requires learning a new modality and a wide range of speech-specific instructions in addition to those supported by text LLMs. Existing SLM training approach…

Cited by 0SourceScholar
2026

VividCam: Learning Unconventional Camera Motions from Virtual Synthetic Videos

ICML 2026poster

Although recent text-to-video generative models are getting more capable of following external camera controls, imposed by either text descriptions or camera trajectories, they still struggle to generalize to unconventional camera motions, which is crucial in creating truly original and artistic vid…

Cited by 0SourceScholar
2025

A Probabilistic Framework for LLM Hallucination Detection via Belief Tree Propagation

NAACL 2025long

We describe Belief Tree Propagation (BTProp), a probabilistic framework for LLM hallucination detection. To judge the truth of a statement, BTProp generates a belief tree by recursively expanding the initial statement into a set of logically related claims, then reasoning globally about the relation…

2025

Augment before You Try: Knowledge-Enhanced Table Question Answering via Table Expansion

EMNLP 2025

Table question answering is a popular task that assesses a model’s ability to understand and interact with structured data. However, the given table often does not contain sufficient information to answer the question, necessitating the integration of external knowledge. Existing methods either conv

2025

Fictitious Synthetic Data Can Improve LLM Factuality via Prerequisite Learning

ICLR 2025poster

Recent studies have identified one aggravating factor of LLM hallucinations as the knowledge inconsistency between pre-training and fine-tuning, where unfamiliar fine-tuning data mislead the LLM to fabricate plausible but wrong outputs. In this paper, we propose a novel fine-tuning strategy called P…

2025

Instruction-Following Pruning for Large Language Models

ICML 2025poster

With the rapid scaling of large language models (LLMs), structured pruning has become a widely used technique to learn efficient, smaller models from larger ones, delivering superior performance compared to training similarly sized models from scratch. In this paper, we move beyond the traditional s…

Cited by 0SourcePDFScholar
2025

KVLink: Accelerating Large Language Models via Efficient KV Cache Reuse

NeurIPS 2025poster

We describe KVLink, an approach for efficient key-value (KV) cache reuse in large language models (LLMs). In many LLM applications, different inputs can share overlapping context, such as the same retrieved document appearing in multiple queries. However, the LLMs still need to encode the entire con…

Cited by 0SourcecodeScholar
2025

VSP: Diagnosing the Dual Challenges of Perception and Reasoning in Spatial Planning Tasks for MLLMs

ICCV 2025poster

Multimodal large language models are an exciting emerging class of language models (LMs) that have merged classic LM capabilities with those of image processing systems. However, how these capabilities integrate is often not intuitive and warrants direct investigation. One understudied capability in…

Cited by 0SourcePDFScholar
2024

Advancing the Robustness of Large Language Models through Self-Denoised Smoothing

NAACL 2024short

Although large language models (LLMs) have achieved significant success, their vulnerability to adversarial perturbations, including recent jailbreak attacks, has raised considerable concerns. However, the increasing size of these models and their limited access make improving their robustness a cha…

2024

Correcting Diffusion Generation through Resampling

CVPR 2024highlight

Despite diffusion models' superior capabilities in modeling complex distributions there are still non-trivial distributional discrepancies between generated and ground-truth images which has resulted in several notable problems in image generation including missing object errors in text-to-image gen…

2024

Decomposing Uncertainty for Large Language Models through Input Clarification Ensembling

ICML 2024oral

Uncertainty decomposition refers to the task of decomposing the total uncertainty of a predictive model into aleatoric (data) uncertainty, resulting from inherent randomness in the data-generating process, and epistemic (model) uncertainty, resulting from missing information in the model's training…

2024

GeSS: Benchmarking Geometric Deep Learning under Scientific Applications with Distribution Shifts

NeurIPS 2024poster

Geometric deep learning (GDL) has gained significant attention in scientific fields, for its proficiency in modeling data with intricate geometric structures. Yet, very few works have delved into its capability of tackling the distribution shift problem, a prevalent challenge in many applications.…

Cited by 0SourcePDFScholar
2024

Reversing the Forget-Retain Objectives: An Efficient LLM Unlearning Framework from Logit Difference

NeurIPS 2024poster

As Large Language Models (LLMs) demonstrate extensive capability in learning from documents, LLM unlearning becomes an increasingly important research area to address concerns of LLMs in terms of privacy, copyright, etc. A conventional LLM unlearning task typically involves two goals: (1) The target…

2024

Revisiting Who’s Harry Potter: Towards Targeted Unlearning from a Causal Intervention Perspective

EMNLP 2024main

This paper investigates Who’s Harry Potter (WHP), a pioneering yet insufficiently understood method for LLM unlearning. We explore it in two steps. First, we introduce a new task of LLM targeted unlearning, where given an unlearning target (e.g., a person) and some unlearning documents, we aim to un…

2024

Sparse Cocktail: Every Sparse Pattern Every Sparse Ratio All At Once

ICML 2024poster

Sparse Neural Networks (SNNs) have received voluminous attention for mitigating the explosion in computational costs and memory footprints of modern deep neural networks. Despite their popularity, most state-of-the-art training approaches seek to find a single high-quality sparse subnetwork with a p…

Cited by 1SourcePDFScholar
2024

Speech Self-Supervised Learning Using Diffusion Model Synthetic Data

ICML 2024oral

While self-supervised learning (SSL) in speech has greatly reduced the reliance of speech processing systems on annotated corpora, the success of SSL still hinges on the availability of a large-scale unannotated corpus, which is still often impractical for many low-resource languages or under privac…

2023

Harnessing the Spatial-Temporal Attention of Diffusion Models for High-Fidelity Text-to-Image Synthesis

ICCV 2023poster

Diffusion-based models have achieved state-of-the-art performance on text-to-image synthesis tasks. However, one critical limitation of these models is the low fidelity of generated images with respect to the text description, such as missing objects, mismatched attributes, and mislocated objects. O…

Cited by 45PDFcodeScholar
2023

PromptBoosting: Black-Box Text Classification with Ten Forward Passes

ICML 2023poster

We describe PromptBoosting, a query-efficient procedure for building a text classifier from a neural language model (LM) without access to the LM's parameters, gradients, or hidden representations. This form of "black-box" classifier training has become increasingly important as the cost of training…

2023

Robust Mixture-of-Expert Training for Convolutional Neural Networks

ICCV 2023oral

Sparsely-gated Mixture of Expert (MoE), an emerging deep model architecture, has demonstrated a great promise to enable high-accuracy and ultra-efficient model inference. Despite the growing popularity of MoE, little work investigated its potential to advance convolutional neural networks (CNNs), es…

Cited by 47PDFcodeScholar
2023

Selectivity Drives Productivity: Efficient Dataset Pruning for Enhanced Transfer Learning

NeurIPS 2023poster

Massive data is often considered essential for deep learning applications, but it also incurs significant computational and infrastructural costs. Therefore, dataset pruning (DP) has emerged as an effective way to improve data efficiency by identifying and removing redundant training samples without…

2023

TextGrad: Advancing Robustness Evaluation in NLP by Gradient-Driven Optimization

ICLR 2023poster

Robustness evaluation against adversarial examples has become increasingly important to unveil the trustworthiness of the prevailing deep models in natural language processing (NLP). However, in contrast to the computer vision domain where the first-order projected gradient descent (PGD) is used as…

2023

Towards Coherent Image Inpainting Using Denoising Diffusion Implicit Models

ICML 2023poster

Image inpainting refers to the task of generating a complete, natural image based on a partially revealed reference image. Recently, many research interests have been focused on addressing this problem using fixed diffusion models. These approaches typically directly replace the revealed region of t…

2023

Uncovering the Disentanglement Capability in Text-to-Image Diffusion Models

CVPR 2023poster

Generative models have been widely studied in computer vision. Recently, diffusion models have drawn substantial attention due to the high quality of their generated images. A key desired property of image generative models is the ability to disentangle different attributes, which should enable modi…

2022

Adversarial Support Alignment

ICLR 2022spotlight

We study the problem of aligning the supports of distributions. Compared to the existing work on distribution alignment, support alignment does not require the densities to be matched. We propose symmetric support difference as a divergence measure to quantify the mismatch between supports. We show…

2022

An Adversarial Framework for Generating Unseen Images by Activation Maximization

AAAI 2022technical

Activation maximization (AM) refers to the task of generating input examples that maximize the activation of a target class of a classifier, which can be used for class-conditional image generation and model interpretation. A popular class of AM method, GAN-based AM, introduces a GAN pre-trained on…

2022

ContentVec: An Improved Self-Supervised Speech Representation by Disentangling Speakers

ICML 2022spotlight

Self-supervised learning in speech involves training a speech representation network on a large-scale unannotated speech corpus, and then applying the learned representations to downstream tasks. Since the majority of the downstream tasks of SSL learning in speech largely focus on the content inform…

2022

Data-Efficient Double-Win Lottery Tickets from Robust Pre-training

ICML 2022spotlight

Pre-training serves as a broadly adopted starting point for transfer learning on various downstream tasks. Recent investigations of lottery tickets hypothesis (LTH) demonstrate such enormous pre-trained models can be replaced by extremely sparse subnetworks (a.k.a. matching subnetworks) without sacr…

2022

DiffCSE: Difference-based Contrastive Learning for Sentence Embeddings

NAACL 2022long

We propose DiffCSE, an unsupervised contrastive learning framework for learning sentence embeddings. DiffCSE learns sentence embeddings that are sensitive to the difference between the original sentence and an edited sentence, where the edited sentence is obtained by stochastically masking out the o…

2022

How to Robustify Black-Box ML Models? A Zeroth-Order Optimization Perspective

ICLR 2022spotlight

The lack of adversarial robustness has been recognized as an important issue for state-of-the-art machine learning (ML) models, e.g., deep neural networks (DNNs). Thereby, robustifying ML models against adversarial attacks is now a major focus of research. However, nearly all existing defense method…

2022

Incremental Prompting: Episodic Memory Prompt for Lifelong Event Detection

COLING 2022main

Lifelong event detection aims to incrementally update a model with new event types and data while retaining the capability on previously learned old types. One critical challenge is that the model would catastrophically forget old types when continually trained on new data. In this paper, we introdu…

2022

Learning Stable Classifiers by Transferring Unstable Features

ICML 2022spotlight

While unbiased machine learning models are essential for many applications, bias is a human-defined concept that can vary across tasks. Given only input-label pairs, algorithms may lack sufficient information to distinguish stable (causal) features from unstable (spurious) features. However, related…

2022

Linearity Grafting: Relaxed Neuron Pruning Helps Certifiable Robustness

ICML 2022spotlight

Certifiable robustness is a highly desirable property for adopting deep neural networks (DNNs) in safety-critical scenarios, but often demands tedious computations to establish. The main hurdle lies in the massive amount of non-linearity in large DNNs. To trade off the DNN expressiveness (which call…

2022

On the Interplay between Sparsity, Naturalness, Intelligibility, and Prosody in Speech Synthesis

ICASSP 2022accepted

Are end-to-end text-to-speech (TTS) models over-parametrized? To what extent can these models be pruned, and what happens to their synthesis capabilities? This work serves as a starting point to explore pruning both spectrogram prediction networks and vocoders. We thoroughly investigate the tradeoff…

Cited by 0SourceScholar
2022

Quarantine: Sparsity Can Uncover the Trojan Attack Trigger for Free

CVPR 2022poster

Trojan attacks threaten deep neural networks (DNNs) by poisoning them to behave normally on most samples, yet to produce manipulated results for inputs attached with a particular trigger. Several works attempt to detect whether a given DNN has been injected with a specific trigger during the trainin…

Cited by 29PDFcodeScholar
2022

Query and Extract: Refining Event Extraction as Type-oriented Binary Decoding

ACL 2022findings

Event extraction is typically modeled as a multi-class classification problem where event types and argument roles are treated as atomic symbols. These approaches are usually limited to a set of pre-defined types. We propose a novel event extraction framework that uses event types and argument roles…

Cited by 70SourcePDFScholar
2022

Revisiting and Advancing Fast Adversarial Training Through The Lens of Bi-Level Optimization

ICML 2022spotlight

Adversarial training (AT) is a widely recognized defense mechanism to gain the robustness of deep neural networks against adversarial attacks. It is built on min-max optimization (MMO), where the minimizer (i.e., defender) seeks a robust model to minimize the worst-case training loss in the presence…

2021

Continuous Cnn For Nonuniform Time Series

ICASSP 2021accepted

CNN for time series data implicitly assumes that the data are uniformly sampled, whereas many event-based and multi-modal data are nonuniform or have heterogeneous sampling rates. Directly applying regular CNN to nonuniform time series is ungrounded, because it is unable to recognize and extract com…

Cited by 0SourceScholar
2021

Generating Adversarial Computer Programs using Optimized Obfuscations

ICLR 2021poster

Machine learning (ML) models that learn and predict properties of computer programs are increasingly being adopted and deployed. These models have demonstrated success in applications such as auto-completing code, summarizing large programs, and detecting bugs and malware in programs. In this work…

2021

Global Prosody Style Transfer Without Text Transcriptions

ICML 2021oral

Prosody plays an important role in characterizing the style of a speaker or an emotion, but most non-parallel voice or emotion style transfer algorithms do not convert any prosody information. Two major components of prosody are pitch and rhythm. Disentangling the prosody information, particularly t…

Cited by 42SourcePDFScholar
2021

Long Live the Lottery: The Existence of Winning Tickets in Lifelong Learning

ICLR 2021poster

The lottery ticket hypothesis states that a highly sparsified sub-network can be trained in isolation, given the appropriate weight initialization. This paper extends that hypothesis from one-shot task learning, and demonstrates for the first time that such extremely compact and independently traina…

2021

PARP: Prune, Adjust and Re-Prune for Self-Supervised Speech Recognition

NeurIPS 2021spotlight

Self-supervised speech representation learning (speech SSL) has demonstrated the benefit of scale in learning rich representations for Automatic Speech Recognition (ASR) with limited paired data, such as wav2vec 2.0. We investigate the existence of sparse subnetworks in pre-trained speech SSL models…

Cited by 80SourcePDFScholar
2021

Predict then Interpolate: A Simple Algorithm to Learn Stable Classifiers

ICML 2021spotlight

We propose Predict then Interpolate (PI), a simple algorithm for learning correlations that are stable across environments. The algorithm follows from the intuition that when using a classifier trained on one environment to make predictions on examples from another environment, its mistakes are info…

2021

Robust Overfitting may be mitigated by properly learned smoothening

ICLR 2021poster

A recent study (Rice et al., 2020) revealed overfitting to be a dominant phenomenon in adversarially robust training of deep networks, and that appropriate early-stopping of adversarial training (AT) could match the performance gains of most recent algorithmic improvements. This intriguing problem…

2021

Self-Progressing Robust Training

AAAI 2021technical

Enhancing model robustness under new and even adversarial environments is a crucial milestone toward building trustworthy machine learning systems. Current robust training methods such as adversarial training explicitly uses an ``attack'' (e.g., l_infty-norm bounded perturbation) to generate adversa…

2021

The Lottery Tickets Hypothesis for Supervised and Self-Supervised Pre-Training in Computer Vision Models

CVPR 2021poster

The computer vision world has been re-gaining enthusiasm in various pre-trained models, including both classical ImageNet supervised pre-training and recently emerged self-supervised pre-training such as simCLR and MoCo. Pre-trained weights often boost a wide range of downstream tasks including clas…

Cited by 147PDFcodeScholar
2021

TransGAN: Two Pure Transformers Can Make One Strong GAN, and That Can Scale Up

NeurIPS 2021poster

The recent explosive interest on transformers has suggested their potential to become powerful ``universal" models for computer vision tasks, such as classification, detection, and segmentation. While those attempts mainly study the discriminative models, we explore transformers on some more notorio…

2021

Understanding Interlocking Dynamics of Cooperative Rationalization

NeurIPS 2021poster

Selective rationalization explains the prediction of complex neural networks by finding a small subset of the input that is sufficient to predict the neural model output. The selection mechanism is commonly integrated into the model itself by specifying a two-component cascaded system consisting of…

2020

Adversarial Robustness: From Self-Supervised Pre-Training to Fine-Tuning

CVPR 2020poster

Pretrained models from self-supervision are prevalently used in fine-tuning downstream tasks faster or for better accuracy. However, gaining robustness from pretraining is left unexplored. We introduce adversarial training into self-supervision, to provide general-purpose robust pretrained models fo…

Cited by 294PDFcodeScholar
2020

Few-shot Text Classification with Distributional Signatures

ICLR 2020poster

In this paper, we explore meta-learning for few-shot text classification. Meta-learning has shown strong performance in computer vision, where low-level patterns are transferable across learning tasks. However, directly applying this approach to text is challenging--lexical features highly informati…

Cited by 233SourcecodeScholar
2020

Proper Network Interpretability Helps Adversarial Robustness in Classification

ICML 2020poster

Recent works have empirically shown that there exist adversarial examples that can be hidden from neural network interpretability (namely, making network interpretation maps visually similar), or interpretability is itself susceptible to adversarial attacks. In this paper, we theoretically show that…

2020

The Lottery Ticket Hypothesis for Pre-trained BERT Networks

NeurIPS 2020poster

In natural language processing (NLP), enormous pre-trained models like BERT have become the standard starting point for training on a range of downstream tasks, and similar trends are emerging in other areas of deep learning. In parallel, work on the lottery ticket hypothesis has shown that models f…

2020

Training Stronger Baselines for Learning to Optimize

NeurIPS 2020spotlight

Learning to optimize (L2O) is gaining increased attention because classical optimizers require laborious, problem-specific design and hyperparameter tuning. However, there are significant performance and practicality gaps between manually designed optimizers and existing L2O models. Specifically, l…

2020

Unsupervised Speech Decomposition via Triple Information Bottleneck

ICML 2020poster

Speech information can be roughly decomposed into four components: language content, timbre, pitch, and rhythm. Obtaining disentangled representations of these components is useful in many speech analysis and generation applications. Recently, state-of-the-art voice conversion systems have led to sp…

2019

A Game Theoretic Approach to Class-wise Selective Rationalization

NeurIPS 2019poster

Selection of input features such as relevant pieces of text has become a common technique of highlighting how complex neural predictors operate. The selection can be optimized post-hoc for trained models or incorporated directly into the method itself (self-explaining). However, an overall selection…

2019

Additive Adversarial Learning for Unbiased Authentication

CVPR 2019poster

Authentication is a task aiming to confirm the truth between data instances and personal identities. Typical authentication applications include face recognition, person re-identification, authentication based on mobile devices and so on. The recently-emerging data-driven authentication process may…

Cited by 25PDFcodeScholar
2019

AutoGAN: Neural Architecture Search for Generative Adversarial Networks

ICCV 2019poster

Neural architecture search (NAS) has witnessed prevailing success in image classification and (very recently) segmentation tasks. In this paper, we present the first preliminary study on introducing the NAS algorithm to generative adversarial networks (GANs), dubbed AutoGAN. The marriage of NAS and…

Cited by 386PDFcodeScholar
2019

AutoVC: Zero-Shot Voice Style Transfer with Only Autoencoder Loss

ICML 2019oral

Despite the progress in voice conversion, many-to-many voice conversion trained on non-parallel data, as well as zero-shot voice conversion, remains under-explored. Deep style transfer algorithms, generative adversarial networks (GAN) in particular, are being applied as new solutions in this field.…

2019

Tight Certificates of Adversarial Robustness for Randomly Smoothed Classifiers

NeurIPS 2019poster

Strong theoretical guarantees of robustness can be given for ensembles of classifiers generated by input randomization. Specifically, an $\ell_2$ bounded adversary cannot alter the ensemble prediction generated by an additive isotropic Gaussian noise, where the radius for the adversary depends on bo…

Cited by 149SourcePDFScholar
2018

Deep Learning Based Speech Beamforming

ICASSP 2018accepted

Multi-channel speech enhancement with ad-hoc sensors has been a challenging task. Speech model guided beamforming algorithms are able to recover natural sounding speech, but the speech models tend to be oversimplified or the inference would otherwise be too complicated. On the other hand, deep learn…

Cited by 0SourceScholar
2018

Evidence Aggregation for Answer Re-Ranking in Open-Domain Question Answering

ICLR 2018poster

Very recently, it comes to be a popular approach for answering open-domain questions by first searching question-related passages, then applying reading comprehension models to extract answers. Existing works usually extract answers from single passages independently, thus not fully make use of the…

2018

Image Super-Resolution via Dual-State Recurrent Networks

CVPR 2018poster

Advances in image super-resolution (SR) have recently benefited significantly from rapid developments in deep neural networks. Inspired by these recent discoveries, we note that many state-of-the-art deep SR architectures can be reformulated as a single-state recurrent neural network (RNN) with fini…

2018

Zeroth-Order Stochastic Variance Reduction for Nonconvex Optimization

NeurIPS 2018poster

As application demands for zeroth-order (gradient-free) optimization accelerate, the need for variance reduced and faster converging approaches is also intensifying. This paper addresses these challenges by presenting: a) a comprehensive theoretical analysis of variance reduced zeroth-order (ZO) op…

2017

Jointly Attentive Spatial-Temporal Pooling Networks for Video-Based Person Re-Identification

ICCV 2017poster

Person Re-Identification (person re-id) is a crucial task as its applications in visual surveillance and human-computer interaction. In this work, we present a novel joint Spatial and Temporal Attention Pooling Network (ASTPN) for video-based person re-identification, which enables the feature extra…

Cited by 333PDFcodeScholar
2017

Robust Video Super-Resolution With Learned Temporal Dynamics

ICCV 2017poster

Video super-resolution (SR) aims to generate a high-resolution (HR) frame from multiple low-resolution (LR) frames. The inter-frame temporal relation is as crucial as the intra-frame spatial relation for tackling this problem. However, how to utilize temporal information efficiently and effectively…

Cited by 289PDFScholar
2016

D3: Deep Dual-Domain Based Fast Restoration of JPEG-Compressed Images

CVPR 2016poster

In this paper, we design a Deep Dual-Domain (D3) based fast restoration model to remove artifacts of JPEG compressed images. It leverages the large learning capacity of deep networks, as well as the problem-specific expertise that was hardly incorporated in the past design of deep architectures. For…

Cited by 249PDFScholar
2016

Studying Very Low Resolution Recognition Using Deep Networks

CVPR 2016poster

Visual recognition research often assumes a sufficient resolution of the region of interest (ROI). That is usually violated in practice, inspiring us to explore the Very Low Resolution Recognition (VLRR) problem. Typically, the ROI in a VLRR problem can be smaller than 16 x16 pixels, and is challeng…

Cited by 284PDFScholar