← Search

Chih-kuan Yeh

15 accepted papers

2025

An Efficient Rehearsal Scheme for Catastrophic Forgetting Mitigation during Multi-stage Fine-tuning

NAACL 2025findings

Incrementally fine-tuning foundational models on new tasks or domains is now the de facto approach in NLP. A known pitfall of this approach is the catastrophic forgetting of prior knowledge that happens during fine-tuning. A common approach to alleviate such forgetting is to rehearse samples from pr…

2023

Concept Gradient: Concept-based Interpretation Without Linear Assumption

ICLR 2023poster

Concept-based interpretations of black-box models are often more intuitive for humans to understand. The most widely adopted approach for concept-based, gradient interpretation is Concept Activation Vector (CAV). CAV relies on learning a linear relation between some latent representation of a given…

2023

Distilling Step-by-Step! Outperforming Larger Language Models with Less Training Data and Smaller Model Sizes

ACL 2023findings

Deploying large language models (LLMs) is challenging because they are memory inefficient and compute-intensive for practical applications. In reaction, researchers train smaller task-specific models by either finetuning with human labels or distilling using LLM-generated labels. However, finetuning…

2023

Order Matters in the Presence of Dataset Imbalance for Multilingual Learning

NeurIPS 2023poster

In this paper, we empirically study the optimization dynamics of multi-task learning, particularly focusing on those that govern a collection of tasks with significant data imbalance. We present a simple yet effective method of pre-training on high-resource tasks, followed by fine-tuning on a mixtur…

Cited by 7SourcePDFScholar
2022

First is Better Than Last for Language Data Influence

NeurIPS 2022accept

The ability to identify influential training examples enables us to debug training data and explain model behavior. Existing techniques to do so are based on the flow of training data influence through the model parameters. For large models in NLP applications, it is often computationally infeasible…

2022

Threading the Needle of On and Off-Manifold Value Functions for Shapley Explanations

AISTATS 2022poster

A popular explainable AI (XAI) approach to quantify feature importance of a given model is via Shapley values. These Shapley values arose in cooperative games, and hence a critical ingredient to compute these in an XAI context is a so-called value function, that computes the “value” of a subset of f…

Cited by 14SourcePDFScholar
2021

Evaluations and Methods for Explanation through Robustness Analysis

ICLR 2021poster

Feature based explanations, that provide importance of each feature towards the model prediction, is arguably one of the most intuitive ways to explain a model. In this paper, we establish a novel set of evaluation criteria for such feature based explanations by robustness analysis. In contrast to e…

Cited by 69SourcePDFScholar
2020

Minimizing FLOPs to Learn Efficient Sparse Representations

ICLR 2020poster

Deep representation learning has become one of the most widely adopted approaches for visual search, recommendation, and identification. Retrieval of such representations from a large database is however computationally challenging. Approximate methods based on learning compact representations, hav…

Cited by 77SourcecodeScholar
2020

On Completeness-aware Concept-Based Explanations in Deep Neural Networks

NeurIPS 2020poster

Human explanations of high-level decisions are often expressed in terms of key concepts the decisions are based on. In this paper, we study such concept-based explainability for Deep Neural Networks (DNNs). First, we define the notion of \emph{completeness}, which quantifies how sufficient a particu…

2019

On the (In)fidelity and Sensitivity of Explanations

NeurIPS 2019poster

We consider objective evaluation measures of saliency explanations for complex black-box machine learning models. We propose simple robust variants of two notions that have been considered in recent literature: (in)fidelity, and sensitivity. We analyze optimal explanations with respect to both these…

2019

Unsupervised Speech Recognition via Segmental Empirical Output Distribution Matching

ICLR 2019poster

We consider the problem of training speech recognition systems without using any labeled data, under the assumption that the learner can only access to the input utterances and a phoneme language model estimated from a non-overlapping corpus. We propose a fully unsupervised learning algorithm that a…

Cited by 48SourcePDFScholar
2018

Deep Generative Models for Weakly-Supervised Multi-Label Classification

ECCV 2018poster

In order to train learning models for multi-label classification (MLC), it is typically desirable to have a large amount of fully annotated multi-label data. Since such annotation process is in general costly, we focus on the learning task of weakly-supervised multi-label classification (WS-MLC). In…

Cited by 48SourcePDFScholar
2018

Multi-Label Zero-Shot Learning With Structured Knowledge Graphs

CVPR 2018poster

In this paper, we propose a novel deep learning architecture for multi-label zero-shot learning (ML-ZSL), which is able to predict multiple unseen class labels for each input instance. Inspired by the way humans utilize semantic knowledge between objects of interests, we propose a framework that inc…

Cited by 376SourcePDFScholar
2018

Representer Point Selection for Explaining Deep Neural Networks

NeurIPS 2018poster

We propose to explain the predictions of a deep neural network, by pointing to the set of what we call representer points in the training set, for a given test point prediction. Specifically, we show that we can decompose the pre-activation prediction of a neural network into a linear combination of…