← Search

Tsui-Wei Weng

34 accepted papers

2026

Beyond Top Activations: Efficient and Reliable Crowdsourced Evaluation of Automated Interpretability

CVPR 2026

Interpreting individual neurons or directions in activation space is an important topic in mechanistic interpretability. Numerous automated interpretability methods have been proposed to generate such explanations, but it remains unclear how reliable these explanations are, and which methods produce

Cited by 1SourcecodeScholar
2026

Interpretable and Steerable Concept Bottleneck Sparse Autoencoders

CVPR 2026

Sparse autoencoders (SAEs) promise a unified approach for mechanistic interpretability, concept discovery, and model steering in LLMs and LVLMs. However, realizing this potential requires learned features to be both interpretable and steerable. To that end, we introduce two new computationally inexp

Cited by 0SourcecodeScholar
2025

Anti-Sensing: Defense Against Unauthorized Radar-Based Human Vital Sign Sensing with Physically Realizable Wearable Oscillators

ICRA 2025

Recent advancements in Ultra-Wideband (UWB) radar technology have enabled contactless, non-line-of-sight vital sign monitoring, making it a valuable tool for healthcare. However, UWB radar's ability to capture sensitive physiological data, even through walls, raises significant privacy concerns, par

Cited by 2SourceScholar
2025

Interpretable Generative Models through Post-hoc Concept Bottlenecks

CVPR 2025poster

Concept bottleneck models (CBM) aim to produce inherently interpretable models that rely on human-understandable concepts for their predictions. However, existing approaches to design interpretable generative models based on CBMs are not yet efficient and scalable, as they require expensive generati…

2025

Iterative Self-Tuning LLMs for Enhanced Jailbreaking Capabilities

NAACL 2025long

Recent research has shown that Large Language Models (LLMs) are vulnerable to automated jailbreak attacks, where adversarial suffixes crafted by algorithms appended to harmful queries bypass safety alignment and trigger unintended responses. Current methods for generating these suffixes are computat…

2025

ThinkEdit: Interpretable Weight Editing to Mitigate Overly Short Thinking in Reasoning Models

EMNLP 2025

Recent studies have shown that Large Language Models (LLMs) augmented with chain-of-thought (CoT) reasoning demonstrate impressive problem-solving abilities. However, in this work, we identify a recurring issue where these models occasionally generate overly short reasoning, leading to degraded perf

2025

Understanding Fixed Predictions via Confined Regions

ICML 2025poster

Machine learning models can assign fixed predictions that preclude individuals from changing their outcome. Existing approaches to audit fixed predictions do so on a pointwise basis, which requires access to an existing dataset of individuals and may fail to anticipate fixed predictions in out-of-sa…

2024

Abstracted Shapes as Tokens - A Generalizable and Interpretable Model for Time-series Classification

NeurIPS 2024poster

In time-series analysis, many recent works seek to provide a unified view and representation for time-series across multiple domains, leading to the development of foundation models for time-series data. Despite diverse modeling techniques, existing models are black boxes and fail to provide insight…

2024

Breaking the Barrier: Enhanced Utility and Robustness in Smoothed DRL Agents

ICML 2024poster

Robustness remains a paramount concern in deep reinforcement learning (DRL), with randomized smoothing emerging as a key technique for enhancing this attribute. However, a notable gap exists in the performance of current smoothed DRL agents, often characterized by significantly low clean rewards and…

2024

Prediction without Preclusion: Recourse Verification with Reachable Sets

ICLR 2024spotlight

Machine learning models are often used to decide who receives a loan, a job interview, or a public benefit. Models in such settings use features without considering their *actionability*. As a result, they can assign predictions that are \emph{fixed} -- meaning that individuals who are denied loans…

2024

Probabilistic Federated Prompt-Tuning with Non-IID and Imbalanced Data

NeurIPS 2024poster

Fine-tuning pre-trained models is a popular approach in machine learning for solving complex tasks with moderate data. However, fine-tuning the entire pre-trained model is ineffective in federated data scenarios where local data distributions are diversely skewed. To address this, we explore integra…

Cited by 1SourcePDFScholar
2024

Provable and Efficient Dataset Distillation for Kernel Ridge Regression

NeurIPS 2024poster

Deep learning models are now trained on increasingly larger datasets, making it crucial to reduce computational costs and improve data quality. Dataset distillation aims to distill a large dataset into a small synthesized dataset such that models trained on it can achieve similar performance to thos…

2024

VLG-CBM: Training Concept Bottleneck Models with Vision-Language Guidance

NeurIPS 2024poster

Concept Bottleneck Models (CBMs) provide interpretable prediction by introducing an intermediate Concept Bottleneck Layer (CBL), which encodes human-understandable concepts to explain models' decision. Recent works proposed to utilize Large Language Models and pre-trained Vision-Language Models to a…

2023

Analyzing Generalization of Neural Networks through Loss Path Kernels

NeurIPS 2023poster

Deep neural networks have been increasingly used in real-world applications, making it critical to ensure their ability to adapt to new, unseen data. In this paper, we study the generalization capability of neural networks trained with (stochastic) gradient flow. We establish a new connection betwee…

Cited by 1SourcePDFScholar
2023

CLIP-Dissect: Automatic Description of Neuron Representations in Deep Vision Networks

ICLR 2023top-25%

In this paper, we propose CLIP-Dissect, a new technique to automatically describe the function of individual hidden neurons inside vision networks. CLIP-Dissect leverages recent advances in multimodal vision/language models to label internal neurons with open-ended concepts without the need for any…

2023

ConCerNet: A Contrastive Learning Based Framework for Automated Conservation Law Discovery and Trustworthy Dynamical System Prediction

ICML 2023poster

Deep neural networks (DNN) have shown great capacity of modeling a dynamical system; nevertheless, they usually do not obey physics constraints such as conservation laws. This paper proposes a new learning framework named $\textbf{ConCerNet}$ to improve the trustworthiness of the DNN based dynamics…

2023

Min-Max Multi-objective Bilevel Optimization with Applications in Robust Machine Learning

ICLR 2023poster

We consider a generic min-max multi-objective bilevel optimization problem with applications in robust machine learning such as representation learning and hyperparameter optimization. We design MORBiT, a novel single-loop gradient descent-ascent bilevel optimization algorithm, to solve the generic…

Cited by 9SourcePDFScholar
2022

Quantifying Safety of Learning-based Self-Driving Control Using Almost-Barrier Functions

IROS 2022poster

Path-tracking control of self-driving vehicles can benefit from deep learning for tackling longstanding challenges such as nonlinearity and uncertainty. However, deep neural controllers lack safety guarantees, restricting their practical use. We propose a new approach of learning almost-barrier func…

Cited by 14SourceScholar
2021

On Fast Adversarial Robustness Adaptation in Model-Agnostic Meta-Learning

ICLR 2021poster

Model-agnostic meta-learning (MAML) has emerged as one of the most successful meta-learning techniques in few-shot learning. It enables us to learn a $\textit{meta-initialization}$ of model parameters (that we call $\textit{meta-model}$) to rapidly adapt to new tasks using a small amount of labeled…

2021

On the Equivalence between Neural Network and Support Vector Machine

NeurIPS 2021poster

Recent research shows that the dynamics of an infinitely wide neural network (NN) trained by gradient descent can be characterized by Neural Tangent Kernel (NTK) \citep{jacot2018neural}. Under the squared loss, the infinite-width NN trained by gradient descent with an infinitely small learning rate…

2021

Robust Deep Reinforcement Learning through Adversarial Loss

NeurIPS 2021poster

Recent studies have shown that deep reinforcement learning agents are vulnerable to small adversarial perturbations on the agent's inputs, which raises concerns about deploying such agents in the real world. To address this issue, we propose RADIAL-RL, a principled framework to train reinforcement l…

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
2020

Toward Evaluating Robustness of Deep Reinforcement Learning with Continuous Control

ICLR 2020poster

Deep reinforcement learning has achieved great success in many previously difficult reinforcement learning tasks, yet recent studies show that deep RL agents are also unavoidably susceptible to adversarial perturbations, similar to deep neural networks in classification tasks. Prior works mostly foc…

Cited by 36SourceScholar
2020

Towards Verifying Robustness of Neural Networks Against A Family of Semantic Perturbations

CVPR 2020oral

Verifying robustness of neural networks given a specified threat model is a fundamental yet challenging task. While current verification methods mainly focus on the l_p-norm threat model of the input instances, robustness verification against semantic adversarial attacks inducing large l_p-norm pert…

Cited by 93PDFScholar
2018

Efficient Neural Network Robustness Certification with General Activation Functions

NeurIPS 2018poster

Finding minimum distortion of adversarial examples and thus certifying robustness in neural networks classifiers is known to be a challenging problem. Nevertheless, recently it has been shown to be possible to give a non-trivial certified lower bound of minimum distortion, and some recent progress h…