← Search

Pin-Yu Chen

183 accepted papers

2026

Building a Foundational Guardrail for General Agentic Systems via Synthetic Data

ICLR 2026poster

While LLM agents can plan multi-step tasks, intervening at the planning stage—before any action is executed—is often the safest way to prevent harm, since certain risks can lead to severe consequences once carried out. However, existing guardrails mostly operate post-execution, which is difficult to…

Cited by 0SourcecodeScholar
2026

Capability-Oriented Training Induced Alignment Risk

ICML 2026poster

While most AI alignment research focuses on preventing models from generating explicitly harmful content, a more subtle risk is emerging: capability-oriented training induced exploitation. We investigate whether language models, when trained with reinforcement learning (RL) in environments with impl…

Cited by 0SourceScholar
2026

Detective SAM: Adaptive AI-Image Forgery Localization

ICLR 2026poster

Image forgery localization in the generative AI era poses new challenges, as modern editing pipelines produce photorealistic, semantically coherent manipulations that evade conventional detectors while model capabilities evolve rapidly. In response, we develop Detective SAM, a framework built on SAM…

Cited by 0SourceScholar
2026

How Can Mamba Learn In Context with Outliers and Generalize Provably?

ICML 2026poster

The Mamba model has gained significant attention for its computational advantages over Transformer-based models, while achieving comparable performance across a wide range of language tasks. Like Transformers, Mamba exhibits in-context learning (ICL) capabilities, i.e., making predictions for new ta…

Cited by 0SourceScholar
2026

MegaCoin: Enhancing Medium-Grained Color Perception for Vision-Language Models

AAAI 2026technical

In vision-language models (VLMs), the ability to perceive and interpret color and physical environment is crucial for achieving contextually accurate understanding and interaction. However, despite advances in multimodal modeling, there remains a significant lack of specialized datasets that rigorou

Cited by 0SourcePDFScholar
2026

Pre-training Tensor-Train Networks Facilitates Machine Learning with Variational Quantum Circuits

ICASSP 2026oral

Data encoding remains a fundamental bottleneck in quantum machine learning, where amplitude encoding of high-dimensional classical vectors into quantum states incurs exponential cost. In this work, we propose a pre-trained tensor-train (TT) encoding network (Pre-TT-Encoder) that significantly reduce…

Cited by 0SourcePDFScholar
2026

ProbeLLM: Automating Principled Diagnosis of LLM Failures

ICML 2026poster

Understanding how and why large language models (LLMs) fail is becoming a central challenge as models rapidly evolve and static evaluations fall behind. While automated probing has been enabled by dynamic test generation, existing approaches often discover isolated failure cases, lack principled con…

Cited by 0SourceScholar
2026

The Trojan Knowledge: Bypassing Commercial LLM Guardrails via Harmless Prompt Weaving and Adaptive Tree Search

ICML 2026poster

Large language models (LLMs) remain vulnerable to jailbreak attacks that bypass safety guardrails. Existing approaches overwhelmingly operate within the prompt-optimization paradigm; the resulting prompts typically retain malicious semantic signals that modern guardrails are primed to detect. In con…

Cited by 0SourceScholar
2026

TrustGen: A Platform of Dynamic Benchmarking on the Trustworthiness of Generative Foundation Models

ICLR 2026poster

Generative foundation models (GenFMs), such as large language models and text-to-image systems, have demonstrated remarkable capabilities in various downstream applications. As they are increasingly deployed in high-stakes applications, assessing their trustworthiness has become both a critical nece…

Cited by 0SourceScholar
2025

Adaptive Distraction: Probing LLM Contextual Robustness with Automated Tree Search

NeurIPS 2025poster

Large Language Models (LLMs) often struggle to maintain their original performance when faced with semantically coherent but task-irrelevant contextual information. Although prior studies have explored this issue using fixed-template or retrieval-based distractions, such static methods show limited…

Cited by 0SourceScholar
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

CoP: Agentic Red-teaming for Large Language Models using Composition of Principles

NeurIPS 2025poster

Recent advances in Large Language Models (LLMs) have spurred transformative applications in various domains, ranging from open-source to proprietary LLMs. However, jailbreak attacks, which aim to break safety alignment and user compliance by tricking the target LLMs into answering harmful and risky…

Cited by 0SourceScholar
2025

Combining Domain and Alignment Vectors Provides Better Knowledge-Safety Trade-offs in LLMs

ACL 2025short

There is a growing interest in training domain-expert LLMs that excel in specific technical fields compared to their general-purpose instruction-tuned counterparts. However, these expert models are not either explicitly trained to be safe, or experience a loss in their safety abilities in the proces…

2025

Defensive Prompt Patch: A Robust and Generalizable Defense of Large Language Models against Jailbreak Attacks

ACL 2025finding

Safety, security, and compliance are essential requirements when aligning large language models (LLMs). However, many seemingly aligned LLMs are soon shown to be susceptible to jailbreak attacks. These attacks aim to circumvent the models’ safety guardrails and security mechanisms by introducing jai…

2025

Differentiable Prompt Learning for Vision Language Models

IJCAI 2025

Prompt learning is an effective way to exploit the potential of large-scale pre-trained foundational models. Continuous prompts parameterize context tokens in prompts by turning them into differentiable vectors. Deep continuous prompts insert prompts not only in the input but also in the intermediat

2025

From PEFT to DEFT: Parameter Efficient Finetuning for Reducing Activation Density in Transformers

AAAI 2025technical

Pretrained Language Models (PLMs) have become the de facto starting point for fine-tuning on downstream tasks. However, as model sizes continue to increase, traditional fine-tuning of all parameters becomes challenging. To address this, parameter-efficient fine-tuning (PEFT) methods have gained popu…

2025

Justice or Prejudice? Quantifying Biases in LLM-as-a-Judge

ICLR 2025poster

LLM-as-a-Judge has been widely utilized as an evaluation method in various benchmarks and served as supervised rewards in model training. However, despite their excellence in many domains, potential issues are under-explored, undermining their reliability and the scope of their utility. Therefore,…

Cited by 49SourcePDFScholar
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

REFINE: Inversion-Free Backdoor Defense via Model Reprogramming

ICLR 2025poster

Backdoor attacks on deep neural networks (DNNs) have emerged as a significant security threat, allowing adversaries to implant hidden malicious behaviors during the model training phase. Pre-processing-based defense, which is one of the most important defense paradigms, typically focuses on input tr…

Cited by 2SourcePDFScholar
2025

Retention Score: Quantifying Jailbreak Risks for Vision Language Models

AAAI 2025technical

The emergence of Vision-Language Models (VLMs) is significant advancement in integrating computer vision with Large Language Models (LLMs) to enhance multi-modal machine learning capabilities. However, this progress has made VLMs vulnerable to advanced adversarial attacks, raising concerns about rel…

2025

SEAL: Safety-enhanced Aligned LLM Fine-tuning via Bilevel Data Selection

ICLR 2025poster

Fine-tuning on task-specific data to boost downstream performance is a crucial step for leveraging Large Language Models (LLMs). However, though fine-tuning enhances the model performance for specialized applications, previous studies have demonstrated that fine-tuning the models on several adversar…

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…

2025

Shape it Up! Restoring LLM Safety during Finetuning

NeurIPS 2025poster

Finetuning large language models (LLMs) enables user-specific customization but introduces critical safety risks: even a few harmful examples can compromise safety alignment. A common mitigation strategy is to update the model more strongly on examples deemed safe, while downweighting or excluding t…

Cited by 0SourcecodeScholar
2025

TabWak: A Watermark for Tabular Diffusion Models

ICLR 2025spotlight

Synthetic data offers alternatives for data augmentation and sharing. Till date, it remains unknown how to use watermarking techniques to trace and audit synthetic tables generated by tabular diffusion models to mitigate potential misuses. In this paper, we design TabWak, the first watermarking meth…

2025

Token Highlighter: Inspecting and Mitigating Jailbreak Prompts for Large Language Models

AAAI 2025technical

Large Language Models (LLMs) are increasingly being integrated into services such as ChatGPT to provide responses to user queries. To mitigate potential harm and prevent misuse, there have been concerted efforts to align the LLMs with human values and legal compliance by incorporating various techni…

2025

Training Nonlinear Transformers for Chain-of-Thought Inference: A Theoretical Generalization Analysis

ICLR 2025poster

Chain-of-Thought (CoT) is an efficient prompting method that enables the reasoning ability of large language models by augmenting the query using multiple examples with multiple intermediate steps. Despite the empirical success, the theoretical understanding of how to train a Transformer to achieve…

Cited by 3SourcePDFScholar
2025

VP-NTK: Exploring the Benefits of Visual Prompting in Differentially Private Data Synthesis

ICASSP 2025accepted

Differentially private (DP) synthetic data has become the de facto standard for releasing sensitive data. However, many DP generative models suffer from the low utility of synthetic data, especially for high-resolution images. On the other hand, one of the emerging techniques in parameter efficient…

Cited by 0SourceScholar
2025

When Does Visual Prompting Outperform Linear Probing for Vision-Language Models? A Likelihood Perspective

ICASSP 2025accepted

Adapting pre-trained models to new tasks can exhibit varying effectiveness across datasets. Visual prompting, a state-of-the-art parameter-efficient transfer learning method, can significantly improve the performance of out-of-distribution tasks. On the other hand, linear probing, a standard transfe…

Cited by 0SourceScholar
2025

When is Task Vector Provably Effective for Model Editing? A Generalization Analysis of Nonlinear Transformers

ICLR 2025oral

Task arithmetic refers to editing the pre-trained model by adding a weighted sum of task vectors, each of which is the weight update from the pre-trained model to fine-tuned models for certain tasks. This approach recently gained attention as a computationally efficient inference method for model ed…

Cited by 0SourcePDFScholar
2024

A Deep Dive into the Trade-Offs of Parameter-Efficient Preference Alignment Techniques

ACL 2024long

Large language models are first pre-trained on trillions of tokens and then instruction-tuned or aligned to specific preferences. While pre-training remains out of reach for most researchers due to the compute required, fine-tuning has become affordable thanks to parameter-efficient methods such as…

2024

A Provably Effective Method for Pruning Experts in Fine-tuned Sparse Mixture-of-Experts

ICML 2024poster

The sparsely gated mixture of experts (MoE) architecture sends different inputs to different subnetworks (experts), through trainable routers. MoE reduces the training computation significantly for large models, but its deployment can be still memory/computation expensive for some downstream tasks.…

Cited by 3SourcePDFScholar
2024

AutoVP: An Automated Visual Prompting Framework and Benchmark

ICLR 2024poster

Visual prompting (VP) is an emerging parameter-efficient fine-tuning approach to adapting pre-trained vision models to solve various downstream image-classification tasks. However, there has hitherto been little systematic study of the design space of VP and no clear benchmark for evaluating its per…

2024

Be Your Own Neighborhood: Detecting Adversarial Examples by the Neighborhood Relations Built on Self-Supervised Learning

ICML 2024poster

Deep Neural Networks (DNNs) are vulnerable to Adversarial Examples (AEs), hindering their use in safety-critical systems. In this paper, we present **BEYOND**, an innovative AE detection framework designed for reliable predictions. BEYOND identifies AEs by distinguishing the AE’s abnormal relation w…

Cited by 7SourcePDFScholar
2024

Computational Complexity of Verifying the Group No-show Paradox

IJCAI 2024poster

The (group) no-show paradox refers to the undesirable situation where a group of agents have incentive to abstain from voting to make the winner more favorable to them. To understand whether it is a critical concern in practice, in this paper, we take a computational approach by examining the comp…

Cited by 4SourcePDFScholar
2024

DDI-CoCo: A Dataset for Understanding the Effect of Color Contrast in Machine-Assisted Skin Disease Detection

ICASSP 2024accepted

Skin tone as a demographic bias and inconsistent human labeling poses challenges in dermatology AI. We take another angle to investigate color contrast’s impact, beyond skin tones, on malignancy detection in skin disease datasets: We hypothesize that in addition to skin tones, the color difference b…

Cited by 0SourceScholar
2024

Elijah: Eliminating Backdoors Injected in Diffusion Models via Distribution Shift

AAAI 2024technical

Diffusion models (DM) have become state-of-the-art generative models because of their capability of generating high-quality images from noises without adversarial training. However, they are vulnerable to backdoor attacks as reported by recent studies. When a data input (e.g., some Gaussian noise)…

2024

Fine-tuning Aligned Language Models Compromises Safety, Even When Users Do Not Intend To!

ICLR 2024oral

Optimizing large language models (LLMs) for downstream use cases often involves the customization of pre-trained LLMs through further fine-tuning. Meta's open-source release of Llama models and OpenAI's APIs for fine-tuning GPT-3.5 Turbo on customized datasets accelerate this trend. But, what are th…

2024

GREAT Score: Global Robustness Evaluation of Adversarial Perturbation using Generative Models

NeurIPS 2024poster

Current studies on adversarial robustness mainly focus on aggregating \textit{local} robustness results from a set of data samples to evaluate and rank different models. However, the local statistics may not well represent the true \textit{global} robustness of the underlying unknown data distributi…

2024

Gradient Cuff: Detecting Jailbreak Attacks on Large Language Models by Exploring Refusal Loss Landscapes

NeurIPS 2024poster

Large Language Models (LLMs) are becoming a prominent generative AI tool, where the user enters a query and the LLM generates an answer. To reduce harm and misuse, efforts have been made to align these LLMs to human values using advanced training techniques such as Reinforcement Learning from Human…

Cited by 30SourcePDFScholar
2024

How Do Nonlinear Transformers Learn and Generalize in In-Context Learning?

ICML 2024poster

Transformer-based large language models have displayed impressive in-context learning capabilities, where a pre-trained model can handle new tasks without fine-tuning by simply augmenting the query with some input-output examples from that task. Despite the empirical success, the mechanics of how to…

Cited by 14SourcePDFScholar
2024

It's Never Too Late: Fusing Acoustic Information into Large Language Models for Automatic Speech Recognition

ICLR 2024poster

Recent studies have successfully shown that large language models (LLMs) can be successfully used for generative error correction (GER) on top of the automatic speech recognition (ASR) output. Specifically, an LLM is utilized to carry out a direct mapping from the N-best hypotheses list generated by…

Cited by 27SourcePDFScholar
2024

Large Language Models are Efficient Learners of Noise-Robust Speech Recognition

ICLR 2024spotlight

Recent advances in large language models (LLMs) have promoted generative error correction (GER) for automatic speech recognition (ASR), which leverages the rich linguistic knowledge and powerful reasoning ability of LLMs to improve recognition results. The latest work proposes a GER benchmark with "…

2024

Larimar: Large Language Models with Episodic Memory Control

ICML 2024poster

Efficient and accurate updating of knowledge stored in Large Language Models (LLMs) is one of the most pressing research challenges today. This paper presents Larimar - a novel, brain-inspired architecture for enhancing LLMs with a distributed episodic memory. Larimar's memory allows for dynamic, on…

2024

Learning Optimal Projection for Forecast Reconciliation of Hierarchical Time Series

ICML 2024poster

Hierarchical time series forecasting requires not only prediction accuracy but also coherency, i.e., forecasts add up appropriately across the hierarchy. Recent literature has shown that reconciliation via projection outperforms prior methods such as top-down or bottom-up approaches. Unlike existing…

Cited by 0SourcePDFScholar
2024

Navigating the Safety Landscape: Measuring Risks in Finetuning Large Language Models

NeurIPS 2024poster

Safety alignment is crucial to ensure that large language models (LLMs) behave in ways that align with human preferences and prevent harmful actions during inference. However, recent studies show that the alignment can be easily compromised through finetuning with only a few adversarially designed t…

2024

NeuralFuse: Learning to Recover the Accuracy of Access-Limited Neural Network Inference in Low-Voltage Regimes

NeurIPS 2024poster

Deep neural networks (DNNs) have become ubiquitous in machine learning, but their energy consumption remains problematically high. An effective strategy for reducing such consumption is supply-voltage reduction, but if done too aggressively, it can lead to accuracy degradation. This is due to random…

2024

Overload: Latency Attacks on Object Detection for Edge Devices

CVPR 2024poster

Nowadays the deployment of deep learning-based applications is an essential task owing to the increasing demands on intelligent services. In this paper we investigate latency attacks on deep learning applications. Unlike common adversarial attacks for misclassification the goal of latency attacks is…

Cited by 15SourcePDFScholar
2024

Position: TrustLLM: Trustworthiness in Large Language Models

ICML 2024poster

Large language models (LLMs) have gained considerable attention for their excellent natural language processing capabilities. Nonetheless, these LLMs present many challenges, particularly in the realm of trustworthiness. This paper introduces TrustLLM, a comprehensive study of trustworthiness in LLM…

Cited by 95SourcePDFScholar
2024

Prompting4Debugging: Red-Teaming Text-to-Image Diffusion Models by Finding Problematic Prompts

ICML 2024poster

Text-to-image diffusion models, e.g. Stable Diffusion (SD), lately have shown remarkable ability in high-quality content generation, and become one of the representatives for the recent wave of transformative AI. Nevertheless, such advance comes with an intensifying concern about the misuse of this…

2024

Rethinking Backdoor Attacks on Dataset Distillation: A Kernel Method Perspective

ICLR 2024poster

Dataset distillation offers a potential means to enhance data efficiency in deep learning. Recent studies have shown its ability to counteract backdoor risks present in original training samples. In this study, we delve into the theoretical aspects of backdoor attacks and dataset distillation based…

Cited by 10SourcePDFScholar
2024

Revisiting Zeroth-Order Optimization for Memory-Efficient LLM Fine-Tuning: A Benchmark

ICML 2024poster

In the evolving landscape of natural language processing (NLP), fine-tuning pre-trained Large Language Models (LLMs) with first-order (FO) optimizers like SGD and Adam has become standard. Yet, as LLMs grow in size, the substantial memory overhead from back-propagation (BP) for FO gradient computati…

2024

Ring-A-Bell! How Reliable are Concept Removal Methods For Diffusion Models?

ICLR 2024poster

Diffusion models for text-to-image (T2I) synthesis, such as Stable Diffusion (SD), have recently demonstrated exceptional capabilities for generating high-quality content. However, this progress has raised several concerns of potential misuse, particularly in creating copyrighted, prohibited, and re…

2024

SF-DQN: Provable Knowledge Transfer using Successor Feature for Deep Reinforcement Learning

ICML 2024poster

This paper studies the transfer reinforcement learning (RL) problem where multiple RL problems have different reward functions but share the same underlying transition dynamics. In this setting, the Q-function of each RL problem (task) can be decomposed into a successor feature (SF) and a reward map…

Cited by 2SourcePDFScholar
2024

Safe LoRA: The Silver Lining of Reducing Safety Risks when Finetuning Large Language Models

NeurIPS 2024poster

While large language models (LLMs) such as Llama-2 or GPT-4 have shown impressive zero-shot performance, fine-tuning is still necessary to enhance their performance for customized datasets, domain-specific tasks, or other private needs. However, fine-tuning all parameters of LLMs requires significan…

2024

Self-Taught Recognizer: Toward Unsupervised Adaptation for Speech Foundation Models

NeurIPS 2024poster

We propose an unsupervised adaptation framework, Self-TAught Recognizer (STAR), which leverages unlabeled data to enhance the robustness of automatic speech recognition (ASR) systems in diverse target domains, such as noise and accents. STAR is developed for prevalent speech foundation models based…

2024

The Devil is in the Neurons: Interpreting and Mitigating Social Biases in Language Models

ICLR 2024poster

Pre-trained Language models (PLMs) have been acknowledged to contain harmful information, such as social biases, which may cause negative social impacts or even bring catastrophic results in application. Previous works on this problem mainly focused on using black-box methods such as probing to dete…

Cited by 15SourcePDFScholar
2024

Time-LLM: Time Series Forecasting by Reprogramming Large Language Models

ICLR 2024poster

Time series forecasting holds significant importance in many real-world dynamic systems and has been extensively studied. Unlike natural language process (NLP) and computer vision (CV), where a single large model can tackle multiple tasks, models for time series forecasting are often specialized, ne…

2024

Variance Reduction Can Improve Trade-Off in Multi-Objective Learning

ICASSP 2024accepted

Many machine learning problems today have multiple objective functions, which are often tackled by the multi-objective learning (MOL) framework. Albeit many encouraging results are obtained by MOL algorithms, a recent theoretical study [1] revealed that these gradient-based MOL methods (e.g., MGDA,…

Cited by 0SourceScholar
2024

What Improves the Generalization of Graph Transformers? A Theoretical Dive into the Self-attention and Positional Encoding

ICML 2024poster

Graph Transformers, which incorporate self-attention and positional encoding, have recently emerged as a powerful architecture for various graph learning tasks. Despite their impressive performance, the complex non-convex interactions across layers and the recursive graph structure have made it chal…

Cited by 16SourcePDFScholar
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
2023

A Theoretical Understanding of Shallow Vision Transformers: Learning, Generalization, and Sample Complexity

ICLR 2023poster

Vision Transformers (ViTs) with self-attention modules have recently achieved great empirical success in many vision tasks. Due to non-convex interactions across layers, however, the theoretical learning and generalization analysis is mostly elusive. Based on a data model characterizing both label-r…

Cited by 83SourcePDFScholar
2023

Better May Not Be Fairer: A Study on Subgroup Discrepancy in Image Classification

ICCV 2023poster

In this paper, we provide 20,000 non-trivial human annotations on popular datasets as a first step to bridge gap to studying how natural semantic spurious features affect image classification, as prior works often study datasets mixing low-level features due to limitations in accessing realistic dat…

Cited by 5PDFcodeScholar
2023

Certified Robustness of Quantum Classifiers Against Adversarial Examples Through Quantum Noise

ICASSP 2023accepted

Recently, quantum classifiers have been known to be vulnerable to adversarial attacks, where quantum classifiers are fooled by imperceptible noises to have misclassification. In this paper, we propose one first theoretical study that utilizing the added quantum random rotation noise can improve the…

Cited by 0SourceScholar
2023

Compressed Decentralized Proximal Stochastic Gradient Method for Nonconvex Composite Problems with Heterogeneous Data

ICML 2023poster

We first propose a decentralized proximal stochastic gradient tracking method (DProxSGT) for nonconvex stochastic composite problems, with data heterogeneously distributed on multiple workers in a decentralized connected network. To save communication cost, we then extend DProxSGT to a compressed me…

Cited by 12SourcePDFScholar
2023

Convex Bounds on the Softmax Function with Applications to Robustness Verification

AISTATS 2023poster

The softmax function is a ubiquitous component at the output of neural networks and increasingly in intermediate layers as well. This paper provides convex lower bounds and concave upper bounds on the softmax function, which are compatible with convex optimization formulations for characterizing neu…

2023

Exploring the Benefits of Visual Prompting in Differential Privacy

ICCV 2023poster

Visual Prompting (VP) is an emerging and powerful technique that allows sample-efficient adaptation to downstream tasks by engineering a well-trained frozen source model. In this work, we explore the benefits of VP in constructing compelling neural network classifiers with differential privacy (DP).…

Cited by 19PDFcodeScholar
2023

FLIP: A Provable Defense Framework for Backdoor Mitigation in Federated Learning

ICLR 2023poster

Federated Learning (FL) is a distributed learning paradigm that enables different parties to train a model together for high quality and strong privacy protection. In this scenario, individual participants may get compromised and perform backdoor attacks by poisoning the data (or gradients). Existin…

2023

HyPoradise: An Open Baseline for Generative Speech Recognition with Large Language Models

NeurIPS 2023poster

Advancements in deep neural networks have allowed automatic speech recognition (ASR) systems to attain human parity on several publicly available clean speech datasets. However, even state-of-the-art ASR systems experience performance degradation when confronted with adverse conditions, as a well-tr…

2023

Identification of the Adversary from a Single Adversarial Example

ICML 2023poster

Deep neural networks have been shown vulnerable to adversarial examples. Even though many defense methods have been proposed to enhance the robustness, it is still a long way toward providing an attack-free method to build a trustworthy machine learning system. In this paper, instead of enhancing th…

Cited by 1SourcePDFScholar
2023

Joint Edge-Model Sparse Learning is Provably Efficient for Graph Neural Networks

ICLR 2023poster

Due to the significant computational challenge of training large-scale graph neural networks (GNNs), various sparse learning techniques have been exploited to reduce memory and storage costs. Examples include graph sparsification that samples a subgraph to reduce the amount of data aggregation and m…

Cited by 20SourcePDFScholar
2023

Learning to Design Fair and Private Voting Rules (Extended Abstract)

IJCAI 2023poster

Voting is used widely to aggregate preferences to make a collective decision. In this paper, we focus on evaluating and designing voting rules that support both the privacy of the voting agents and a notion of fairness over such agents. First, we introduce a novel notion of group fairness and adopt…

Cited by 0SourcePDFScholar
2023

Locally Differentially Private Document Generation Using Zero Shot Prompting

EMNLP 2023long findings

Numerous studies have highlighted the privacy risks associated with pretrained large language models. In contrast, our research offers a unique perspective by demonstrating that pretrained large language models can effectively contribute to privacy preservation. We propose a locally differentially p…

Cited by 0SourcecodeScholar
2023

Low-Resource Music Genre Classification with Cross-Modal Neural Model Reprogramming

ICASSP 2023accepted

Transfer learning (TL) approaches have shown promising results when handling tasks with limited training data. However, considerable memory and computational resources are often required for fine-tuning pre-trained neural networks with target domain data. In this work, we introduce a novel method fo…

Cited by 0SourceScholar
2023

MENTOR: Multilingual Text Detection Toward Learning by Analogy

IROS 2023poster

Text detection is frequently used in vision-based mobile robots when they need to interpret texts in their surroundings to perform a given task. For instance, delivery robots in multilingual cities need to be capable of doing multilingual text detection so that the robots can read traffic signs and…

Cited by 0SourceScholar
2023

MultiRobustBench: Benchmarking Robustness Against Multiple Attacks

ICML 2023poster

The bulk of existing research in defending against adversarial examples focuses on defending against a single (typically bounded $\ell_p$-norm) attack, but for a practical setting, machine learning (ML) models should be robust to a wide variety of attacks. In this paper, we present the first unified…

2023

NCTV: Neural Clamping Toolkit and Visualization for Neural Network Calibration

AAAI 2023technical

With the advancement of deep learning technology, neural networks have demonstrated their excellent ability to provide accurate predictions in many tasks. However, a lack of consideration for neural network calibration will not gain trust from humans, even for high-accuracy models. In this regard, t…

2023

On the Convergence and Sample Complexity Analysis of Deep Q-Networks with $\epsilon$-Greedy Exploration

NeurIPS 2023poster

This paper provides a theoretical understanding of deep Q-Network (DQN) with the $\varepsilon$-greedy exploration in deep reinforcement learning. Despite the tremendous empirical achievement of the DQN, its theoretical characterization remains underexplored. First, the exploration strategy is either…

Cited by 27SourcePDFScholar
2023

Patch-level Routing in Mixture-of-Experts is Provably Sample-efficient for Convolutional Neural Networks

ICML 2023oral

In deep learning, mixture-of-experts (MoE) activates one or few experts (sub-networks) on a per-sample or per-token basis, resulting in significant computation reduction. The recently proposed patch-level routing in MoE (pMoE) divides each input into $n$ patches (or tokens) and sends $l$ patches ($l…

2023

Pessimistic Model Selection for Offline Deep Reinforcement Learning

UAI 2023poster

Deep Reinforcement Learning (DRL) has demonstrated great potentials in solving sequential decision making problems in many applications. Despite its promising performance, practical gaps exist when deploying DRL in real-world scenarios. One main barrier is the over-fitting issue that leads to poor g…

Cited by 5SourcePDFScholar
2023

Reprogramming Pretrained Language Models for Antibody Sequence Infilling

ICML 2023poster

Antibodies comprise the most versatile class of binding molecules, with numerous applications in biomedicine. Computational design of antibodies involves generating novel and diverse sequences, while maintaining structural consistency. Unique to antibodies, designing the complementarity-determining…

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

Towards Compositional Adversarial Robustness: Generalizing Adversarial Training to Composite Semantic Perturbations

CVPR 2023poster

Model robustness against adversarial examples of single perturbation type such as the Lp-norm has been widely studied, yet its generalization to more realistic scenarios involving multiple semantic perturbations and their composition remains largely unexplored. In this paper, we first propose a nove…

2023

Uncovering and Quantifying Social Biases in Code Generation

NeurIPS 2023poster

With the popularity of automatic code generation tools, such as Copilot, the study of the potential hazards of these tools is gaining importance. In this work, we explore the social bias problem in pre-trained code generation models. We propose a new paradigm to construct code prompts and successful…

Cited by 19SourcePDFScholar
2023

Understanding and Improving Visual Prompting: A Label-Mapping Perspective

CVPR 2023poster

We revisit and advance visual prompting (VP), an input prompting technique for vision tasks. VP can reprogram a fixed, pre-trained source model to accomplish downstream tasks in the target domain by simply incorporating universal prompts (in terms of input perturbation patterns) into downstream data…

2023

VillanDiffusion: A Unified Backdoor Attack Framework for Diffusion Models

NeurIPS 2023poster

Diffusion Models (DMs) are state-of-the-art generative models that learn a reversible corruption process from iterative noise addition and denoising. They are the backbone of many generative AI applications, such as text-to-image conditional generation. However, recent studies have shown that basic…

2023

When Neural Networks Fail to Generalize? A Model Sensitivity Perspective

AAAI 2023technical

Domain generalization (DG) aims to train a model to perform well in unseen domains under different distributions. This paper considers a more realistic yet more challenging scenario, namely Single Domain Generalization (Single-DG), where only a single source domain is available for training. To tack…

2023

Which Features are Learnt by Contrastive Learning? On the Role of Simplicity Bias in Class Collapse and Feature Suppression

ICML 2023oral

Contrastive learning (CL) has emerged as a powerful technique for representation learning, with or without label supervision. However, supervised CL is prone to collapsing representations of subclasses within a class by not capturing all their features, and unsupervised CL may suppress harder class-…

Cited by 25SourcePDFScholar
2022

A Spectral View of Randomized Smoothing under Common Corruptions: Benchmarking and Improving Certified Robustness

ECCV 2022poster

"Certified robustness guarantee gauges a model’s resistance to test-time attacks and can assess the model’s readiness for deployment in the real world. In this work, we explore a new problem setting to critically examine how the adversarial robustness guarantees change when state-of-the-art randomiz…

Cited by 20SourcePDFScholar
2022

A Word is Worth A Thousand Dollars: Adversarial Attack on Tweets Fools Stock Prediction

NAACL 2022long

More and more investors and machine learning models rely on social media (e.g., Twitter and Reddit) to gather information and predict movements stock prices. Although text-based models are known to be vulnerable to adversarial attacks, whether stock prediction models have similar vulnerability given…

2022

Adversarial Examples Can Be Effective Data Augmentation for Unsupervised Machine Learning

AAAI 2022technical

Adversarial examples causing evasive predictions are widely used to evaluate and improve the robustness of machine learning models. However, current studies focus on supervised learning tasks, relying on the ground truth data label, a targeted objective, or supervision from a trained classifier. In…

2022

Auto-Transfer: Learning to Route Transferable Representations

ICLR 2022poster

Knowledge transfer between heterogeneous source and target networks and tasks has received a lot of attention in recent times as large amounts of quality labeled data can be difficult to obtain in many applications. Existing approaches typically constrain the target deep neural network (DNN) feature…

Cited by 6SourcePDFScholar
2022

CAT: Customized Adversarial Training for Improved Robustness

IJCAI 2022poster

Adversarial training has become one of the most effective methods for improving robustness of neural networks. However, it often suffers from poor generalization on both clean and perturbed data. Current robust training method always use a uniformed perturbation strength for every samples to generat…

Cited by 129SourcePDFScholar
2022

Distributed adversarial training to robustify deep neural networks at scale

UAI 2022poster

Current deep neural networks (DNNs) are vulnerable to adversarial attacks, where adversarial perturbations to the inputs can change or manipulate classification. To defend against such attacks, an effective and popular approach, known as adversarial training (AT), has been shown to mitigate the nega…

2022

Generalization Guarantee of Training Graph Convolutional Networks with Graph Topology Sampling

ICML 2022spotlight

Graph convolutional networks (GCNs) have recently achieved great empirical success in learning graph-structured data. To address its scalability issue due to the recursive embedding of neighboring features, graph topology sampling has been proposed to reduce the memory and computational cost of trai…

Cited by 31SourcePDFScholar
2022

How unlabeled data improve generalization in self-training? A one-hidden-layer theoretical analysis

ICLR 2022poster

Self-training, a semi-supervised learning algorithm, leverages a large amount of unlabeled data to improve learning when the labeled data are limited. Despite empirical successes, its theoretical characterization remains elusive. To the best of our knowledge, this work establishes the first theoreti…

Cited by 32SourcePDFScholar
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

Make an Omelette with Breaking Eggs: Zero-Shot Learning for Novel Attribute Synthesis

NeurIPS 2022accept

Most of the existing algorithms for zero-shot classification problems typically rely on the attribute-based semantic relations among categories to realize the classification of novel categories without observing any of their instances. However, training the zero-shot classification models still requ…

Cited by 2SourcePDFScholar
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
2022

Sharp-MAML: Sharpness-Aware Model-Agnostic Meta Learning

ICML 2022spotlight

Model-agnostic meta learning (MAML) is currently one of the dominating approaches for few-shot meta-learning. Albeit its effectiveness, the optimization of MAML can be challenging due to the innate bilevel problem structure. Specifically, the loss landscape of MAML is much more complex with possibly…

2022

Towards Creativity Characterization of Generative Models via Group-Based Subset Scanning

IJCAI 2022poster

Deep generative models, such as Variational Autoencoders (VAEs) and Generative Adversarial Networks (GANs), have been employed widely in computational creativity research. However, such models discourage out-of-distribution generation to avoid spurious sample generation, thereby limiting their creat…

Cited by 4SourcePDFScholar
2022

Training a Resilient Q-network against Observational Interference

AAAI 2022technical

Deep reinforcement learning (DRL) has demonstrated impressive performance in various gaming simulators and real-world applications. In practice, however, a DRL agent may receive faulty observation by abrupt interferences such as black-out, frozen-screen, and adversarial perturbation. How to design…

2022

When BERT Meets Quantum Temporal Convolution Learning for Text Classification in Heterogeneous Computing

ICASSP 2022accepted

The rapid development of quantum computing has demonstrated many unique characteristics of quantum advantages, such as richer feature representation and more secured protection on model parameters. This work proposes a vertical federated learning architecture based on variational quantum circuits to…

Cited by 0SourceScholar
2022

When Does Backdoor Attack Succeed in Image Reconstruction? A Study of Heuristics vs. Bi-Level Solution

ICASSP 2022accepted

Recent studies have demonstrated the lack of robustness of image reconstruction networks to test-time evasion attacks, posing security risks and potential for misdiagnoses. In this paper, we evaluate how vulnerable such networks are to training-time poisoning attacks for the first time. In contrast…

Cited by 0SourceScholar
2022

Zeroth-Order Optimization for Composite Problems with Functional Constraints

AAAI 2022technical

In many real-world problems, first-order (FO) derivative evaluations are too expensive or even inaccessible. For solving these problems, zeroth-order (ZO) methods that only need function evaluations are often more efficient than FO methods or sometimes the only options. In this paper, we propose a n…

Cited by 7SourcePDFScholar
2021

Adversarial Attack Generation Empowered by Min-Max Optimization

NeurIPS 2021poster

The worst-case training principle that minimizes the maximal adversarial loss, also known as adversarial training (AT), has shown to be a state-of-the-art approach for enhancing adversarial robustness. Nevertheless, min-max optimization beyond the purpose of AT has not been rigorously explored in th…

2021

CAFE: Catastrophic Data Leakage in Vertical Federated Learning

NeurIPS 2021poster

Recent studies show that private training data can be leaked through the gradients sharing mechanism deployed in distributed machine learning systems, such as federated learning (FL). Increasing batch size to complicate data recovery is often viewed as a promising defense strategy against data leaka…

2021

CRFL: Certifiably Robust Federated Learning against Backdoor Attacks

ICML 2021spotlight

Federated Learning (FL) as a distributed learning paradigm that aggregates information from diverse clients to train a shared global model, has demonstrated great success. However, malicious clients can perform poisoning attacks and model replacement to introduce backdoors into the trained global mo…

2021

Characteristic Examples: High-Robustness, Low-Transferability Fingerprinting of Neural Networks

IJCAI 2021poster

This paper proposes Characteristic Examples for effectively fingerprinting deep neural networks, featuring high-robustness to the base model against model pruning as well as low-transferability to unassociated models. This is the first work taking both robustness and transferability into considerati…

Cited by 27SourcePDFScholar
2021

Curse or Redemption? How Data Heterogeneity Affects the Robustness of Federated Learning

AAAI 2021technical

Data heterogeneity has been identified as one of the key features in federated learning but often overlooked in the lens of robustness to adversarial attacks. This paper focuses on characterizing and understanding its impact on backdooring attacks in federated learning through comprehensive experime…

2021

Decentralizing Feature Extraction with Quantum Convolutional Neural Network for Automatic Speech Recognition

ICASSP 2021accepted

We propose a novel decentralized feature extraction approach in federated learning to address privacy-preservation issues for speech recognition. It is built upon a quantum convolutional neural network (QCNN) composed of a quantum circuit encoder for feature extraction, and a recurrent neural networ…

Cited by 0SourceScholar
2021

Fake it Till You Make it: Self-Supervised Semantic Shifts for Monolingual Word Embedding Tasks

AAAI 2021technical

The use of language is subject to variation over time as well as across social groups and knowledge domains, leading to differences even in the monolingual scenario. Such variation in word usage is often called lexical semantic change (LSC). The goal of LSC is to characterize and quantify language v…

2021

Fast Training of Provably Robust Neural Networks by SingleProp

AAAI 2021technical

Recent works have developed several methods of defending neural networks against adversarial attacks with certified guarantees. However, these techniques can be computationally costly due to the use of certification during training. We develop a new regularizer that is both more efficient than exist…

Cited by 7SourcePDFScholar
2021

Fold2Seq: A Joint Sequence(1D)-Fold(3D) Embedding-based Generative Model for Protein Design

ICML 2021spotlight

Designing novel protein sequences for a desired 3D topological fold is a fundamental yet non-trivial task in protein engineering. Challenges exist due to the complex sequence–fold relationship, as well as the difficulties to capture the diversity of the sequences (therefore structures and functions)…

2021

Formalizing Generalization and Adversarial Robustness of Neural Networks to Weight Perturbations

NeurIPS 2021poster

Studying the sensitivity of weight perturbation in neural networks and its impacts on model performance, including generalization and robustness, is an active research topic due to its implications on a wide range of machine learning tasks such as model compression, generalization gap assessment, an…

Cited by 29SourcePDFScholar
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
2021

How Robust Are Randomized Smoothing Based Defenses to Data Poisoning?

CVPR 2021poster

Predictions of certifiably robust classifiers remain constant in a neighborhood of a point, making them resilient to test-time attacks with a guarantee. In this work, we present a previously unrecognized threat to robust machine learning models that highlights the importance of training-data quality…

Cited by 41PDFcodeScholar
2021

Mean-based Best Arm Identification in Stochastic Bandits under Reward Contamination

NeurIPS 2021poster

This paper investigates the problem of best arm identification in {\sl contaminated} stochastic multi-arm bandits. In this setting, the rewards obtained from any arm are replaced by samples from an adversarial model with probability $\varepsilon$. A fixed confidence (infinite-horizon) setting is con…

Cited by 14SourcePDFScholar
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

Predicting Deep Neural Network Generalization with Perturbation Response Curves

NeurIPS 2021poster

The field of Deep Learning is rich with empirical evidence of human-like performance on a variety of prediction tasks. However, despite these successes, the recent Predicting Generalization in Deep Learning (PGDL) NeurIPS 2020 competition suggests that there is a need for more robust and efficient m…

Cited by 22SourcePDFScholar
2021

Rate-improved inexact augmented Lagrangian method for constrained nonconvex optimization

AISTATS 2021poster

First-order methods have been studied for nonlinear constrained optimization within the framework of the augmented Lagrangian method (ALM) or penalty method. We propose an improved inexact ALM (iALM) and conduct a unified analysis for nonconvex problems with either convex or nonconvex constraints. U…

Cited by 62SourcePDFScholar
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

Understanding the Limits of Unsupervised Domain Adaptation via Data Poisoning

NeurIPS 2021poster

Unsupervised domain adaptation (UDA) enables cross-domain learning without target domain labels by transferring knowledge from a labeled source domain whose distribution differs from that of the target. However, UDA is not always successful and several accounts of `negative transfer' have been repor…

2021

Voice2Series: Reprogramming Acoustic Models for Time Series Classification

ICML 2021spotlight

Learning to classify time series with limited data is a practical yet challenging problem. Current methods are primarily based on hand-designed feature extraction rules or domain-specific data augmentation. Motivated by the advances in deep speech processing models and the fact that voice data are u…

2021

When does Contrastive Learning Preserve Adversarial Robustness from Pretraining to Finetuning?

NeurIPS 2021poster

Contrastive learning (CL) can learn generalizable feature representations and achieve state-of-the-art performance of downstream tasks by finetuning a linear classifier on top of it. However, as adversarial robustness becomes vital in image classification, it remains unclear whether or not CL is a…

2021

Why Lottery Ticket Wins? A Theoretical Perspective of Sample Complexity on Sparse Neural Networks

NeurIPS 2021poster

The lottery ticket hypothesis (LTH) states that learning on a properly pruned network (the winning ticket) has improved test accuracy over the original unpruned network. Although LTH has been justified empirically in a broad range of deep neural network (DNN) involved applications like computer visi…

Cited by 38SourcePDFScholar
2020

AdvMS: A Multi-Source Multi-Cost Defense Against Adversarial Attacks

ICASSP 2020accepted

Designing effective defense against adversarial attacks is a crucial topic as deep neural networks have been proliferated rapidly in many security-critical domains such as malware detection and self-driving cars. Conventional defense methods, although shown to be promising, are largely limited by th…

Cited by 0SourceScholar
2020

Adversarial T-shirt! Evading Person Detectors in A Physical World

ECCV 2020poster

It is known that deep neural networks (DNNs) are vulnerable to adversarial attacks. The so-called physical adversarial examples deceive DNN-based decision makers by attaching adversarial patches to real objects. However, most of the existing works on physical adversarial attacks focus on static obje…

Cited by 435SourcePDFScholar
2020

Bridging Mode Connectivity in Loss Landscapes and Adversarial Robustness

ICLR 2020poster

Mode connectivity provides novel geometric insights on analyzing loss landscapes and enables building high-accuracy pathways between well-trained neural networks. In this work, we propose to employ mode connectivity in loss landscapes to study the adversarial robustness of deep neural networks, and…

Cited by 249SourcecodeScholar
2020

Characterizing Speech Adversarial Examples Using Self-Attention U-Net Enhancement

ICASSP 2020accepted

Recent studies have highlighted adversarial examples as ubiquitous threats to the deep neural network (DNN) based speech recognition systems. In this work, we present a U-Net based attention model, UNet <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">At…

Cited by 0SourceScholar
2020

Enhanced Adversarial Strategically-Timed Attacks Against Deep Reinforcement Learning

ICASSP 2020accepted

Recent deep neural networks based techniques, especially those equipped with the ability of self-adaptation in the system level such as deep reinforcement learning (DRL), are shown to possess many advantages of optimizing robot learning systems (e.g., autonomous navigation and continuous robot arm c…

Cited by 0SourceScholar
2020

Fast Learning of Graph Neural Networks with Guaranteed Generalizability: One-hidden-layer Case

ICML 2020poster

Although graph neural networks (GNNs) have made great progress recently on learning from graph-structured data in practice, their theoretical guarantee on generalizability remains elusive in the literature. In this paper, we provide a theoretically-grounded generalizability analysis of GNNs with one…

Cited by 39SourcePDFScholar
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

Is There a Trade-Off Between Fairness and Accuracy? A Perspective Using Mismatched Hypothesis Testing

ICML 2020poster

A trade-off between accuracy and fairness is almost taken as a given in the existing literature on fairness in machine learning. Yet, it is not preordained that accuracy should decrease with increased fairness. Novel to this work, we examine fair classification through the lens of mismatched hypothe…

Cited by 195SourcePDFScholar
2020

Optimizing Mode Connectivity via Neuron Alignment

NeurIPS 2020poster

The loss landscapes of deep neural networks are not well understood due to their high nonconvexity. Empirically, the local minima of these loss functions can be connected by a learned curve in model space, along which the loss remains nearly constant; a feature known as mode connectivity. Yet, curre…

2020

Practical Detection of Trojan Neural Networks: Data-Limited and Data-Free Cases

ECCV 2020poster

When the training data are maliciously tampered, the predictions of the acquired deep neural network (DNN) can be manipulated by an adversary known as the Trojan attack (or poisoning backdoor attack). The lack of robustness of DNNs against Trojan attacks could significantly harm real-life machine le…

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

ScaleCom: Scalable Sparsified Gradient Compression for Communication-Efficient Distributed Training

NeurIPS 2020poster

Large-scale distributed training of Deep Neural Networks (DNNs) on state-of-the-art platforms are expected to be severely communication constrained. To overcome this limitation, numerous gradient compression techniques have been proposed and have demonstrated high compression ratios. However, most e…

Cited by 79SourcePDFScholar
2020

Sign-OPT: A Query-Efficient Hard-label Adversarial Attack

ICLR 2020poster

We study the most practical problem setup for evaluating adversarial robustness of a machine learning system with limited access: the hard-label black-box attack setting for generating adversarial examples, where limited model queries are allowed and only the decision is provided to a queried data…

Cited by 305SourcecodeScholar
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
2020

Towards an Efficient and General Framework of Robust Training for Graph Neural Networks

ICASSP 2020accepted

Graph Neural Networks (GNNs) have made significant advances on several fundamental inference tasks. As a result, there is a surge of interest in using these models for making potentially important decisions in high-regret applications. However, despite GNNs' impressive performance, it has been obser…

Cited by 0SourceScholar
2020

Transfer Learning without Knowing: Reprogramming Black-box Machine Learning Models with Scarce Data and Limited Resources

ICML 2020poster

Current transfer learning methods are mainly based on finetuning a pretrained model with target-domain data. Motivated by the techniques from adversarial machine learning (ML) that are capable of manipulating the model prediction via data perturbations, in this paper we propose a novel approach, bla…

2019

Fast Incremental von Neumann Graph Entropy Computation: Theory, Algorithm, and Applications

ICML 2019oral

The von Neumann graph entropy (VNGE) facilitates measurement of information divergence and distance between graphs in a graph sequence. It has been successfully applied to various learning tasks driven by network-based data. While effective, VNGE is computationally demanding as it requires the full…

2019

On the Design of Black-Box Adversarial Examples by Leveraging Gradient-Free Optimization and Operator Splitting Method

ICCV 2019poster

Robust machine learning is currently one of the most prominent topics which could potentially help shaping a future of advanced AI platforms that not only perform well in average cases but also in worst cases or adverse situations. Despite the long-term vision, however, existing studies on black-box…

Cited by 82PDFcodeScholar
2019

PROVEN: Verifying Robustness of Neural Networks with a Probabilistic Approach

ICML 2019oral

We propose a novel framework PROVEN to \textbf{PRO}babilistically \textbf{VE}rify \textbf{N}eural network’s robustness with statistical guarantees. PROVEN provides probability certificates of neural network robustness when the input perturbation follow distributional characterization. Notably, PROVE…

2019

Query-Efficient Hard-label Black-box Attack: An Optimization-based Approach

ICLR 2019poster

We study the problem of attacking machine learning models in the hard-label black-box setting, where no model information is revealed except that the attacker can make queries to probe the corresponding hard-label decisions. This is a very challenging problem since the direct extension of state-of-t…

2019

Structured Adversarial Attack: Towards General Implementation and Better Interpretability

ICLR 2019poster

When generating adversarial examples to attack deep neural networks (DNNs), Lp norm of the added perturbation is usually used to measure the similarity between original image and adversarial example. However, such adversarial attacks perturbing the raw input spaces may fail to capture structural inf…

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…

2018

Evaluating the Robustness of Neural Networks: An Extreme Value Theory Approach

ICLR 2018poster

The robustness of neural networks to adversarial examples has received great attention due to security implications. Despite various attack approaches to crafting visually imperceptible adversarial examples, little has been developed towards a comprehensive measure of robustness. In this paper, we p…

2018

Explanations based on the Missing: Towards Contrastive Explanations with Pertinent Negatives

NeurIPS 2018poster

In this paper we propose a novel method that provides contrastive explanations justifying the classification of an input by a black box classifier such as a deep neural network. Given an input we find what should be minimally and sufficiently present (viz. important object pixels in an image) to jus…

2018

First-Order Bifurcation Detection for Dynamic Complex Networks

ICASSP 2018accepted

In this paper, we explore how network centrality and network entropy can be used to identify a bifurcation network event. A bifurcation often occurs when a network undergoes a qualitative change in its structure as a response to internal changes or external signals. In this paper, we show that netwo…

Cited by 4SourceScholar
2018

Is Robustness the Cost of Accuracy? -- A Comprehensive Study on the Robustness of 18 Deep Image Classification Models

ECCV 2018poster

The prediction accuracy has been the long-lasting and sole standard for comparing the performance of different image classification models, including the ImageNet competition. However, recent studies have highlighted the lack of robustness in well-trained deep neural networks to adversarial examples…

2018

On the Supermodularity of Active Graph-Based Semi-Supervised Learning with Stieltjes Matrix Regularization

ICASSP 2018accepted

Active graph-based semi-supervised learning (AG-SSL) aims to select a small set of labeled examples and utilize their graph-based relation to other unlabeled examples to aid in machine learning tasks. It is also closely related to the sampling theory in graph signal processing. In this paper, we rev…

Cited by 0SourceScholar
2018

Zeroth-Order Online Alternating Direction Method of Multipliers: Convergence Analysis and Applications

AISTATS 2018poster

In this paper, we design and analyze a new zeroth-order online algorithm, namely, the zeroth-order online alternating direction method of multipliers (ZOO-ADMM), which enjoys dual advantages of being gradient-free operation and employing the ADMM to accommodate complex structured regularizers. Compa…

Cited by 0SourcePDFScholar
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

AMOS: An automated model order selection algorithm for spectral graph clustering

ICASSP 2017accepted

One of the longstanding problems in spectral graph clustering (SGC) is the so-called model order selection problem: automated selection of the correct number of clusters. This is equivalent to the problem of finding the number of connected components or communities in an undirected graph. In this pa…

Cited by 0SourceScholar
2016

Multi-centrality graph spectral decompositions and their application to cyber intrusion detection

ICASSP 2016accepted

Many modern datasets can be represented as graphs and hence spectral decompositions such as graph principal component analysis (PCA) can be useful. Distinct from previous graph decomposition approaches based on subspace projection of a single topological feature, e.g., the Fiedler vector of centered…

Cited by 0SourceScholar