activity
20132024
most citedZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Models

1.8k citations · 9.5k across the 166 of their papers we have counts for

collaborators

166 papers

stat.ML2024★ 2 cited

Efficient Frameworks for Generalized Low-Rank Matrix Bandit Problems

Yue Kang, Cho-Jui Hsieh, Thomas C. M. Lee

In the stochastic contextual low-rank matrix bandit problem, the expected reward of an action is given by the inner product between the action's feature matrix and some fixed, but…

cs.LG2023★ 3 cited

Representer Point Selection for Explaining Regularized High-dimensional Models

Che-Ping Tsai, Jiong Zhang, Eli Chien +3

We introduce a novel class of sample-based explanations we term high-dimensional representers, that can be used to explain the predictions of a regularized high-dimensional model i…

cs.LG2023★ 3 cited

PINA: Leveraging Side Information in eXtreme Multi-label Classification via Predicted Instance Neighborhood Aggregation

Eli Chien, Jiong Zhang, Cho-Jui Hsieh +4

The eXtreme Multi-label Classification~(XMC) problem seeks to find relevant labels from an exceptionally large label space. Most of the existing XMC learners focus on the extractio…

cs.CL2023★ 3 cited

Red Teaming Language Model Detectors with Language Models

Zhouxing Shi, Yihan Wang, Fan Yin +3

The prevalence and strong capability of large language models (LLMs) present significant safety and ethical risks if exploited by malicious users. To prevent the potentially decept…

cs.LG2023★ 1 cited

Universality and Limitations of Prompt Tuning

Yihan Wang, Jatin Chauhan, Wei Wang +1

Despite the demonstrated empirical efficacy of prompt tuning to adapt a pretrained language model for a new task, the theoretical underpinnings of the difference between "tuning pa…

cs.LG2023

Robust Lipschitz Bandits to Adversarial Corruptions

Yue Kang, Cho-Jui Hsieh, Thomas C. M. Lee

Lipschitz bandit is a variant of stochastic bandits that deals with a continuous arm set defined on a metric space, where the reward function is subject to a Lipschitz constraint.…

cs.LG2023★ 3 cited

Can Agents Run Relay Race with Strangers? Generalization of RL to Out-of-Distribution Trajectories

Li-Cheng Lan, Huan Zhang, Cho-Jui Hsieh

In this paper, we define, evaluate, and improve the ``relay-generalization'' performance of reinforcement learning (RL) agents on the out-of-distribution ``controllable'' states. I…

cs.CV2023★ 1 cited

Structured Video-Language Modeling with Temporal Grouping and Spatial Grounding

Yuanhao Xiong, Long Zhao, Boqing Gong +5

Existing video-language pre-training methods primarily focus on instance-level alignment between video clips and captions via global contrastive learning but neglect rich fine-grai…

cs.LG2023

Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits

Yue Kang, Cho-Jui Hsieh, Thomas C. M. Lee

In stochastic contextual bandits, an agent sequentially makes actions from a time-dependent action set based on past experience to minimize the cumulative regret. Like many other m…

cs.LG2023★ 168 cited

Symbolic Discovery of Optimization Algorithms

Xiangning Chen, Chen Liang, Da Huang +9

We present a method to formulate algorithm discovery as program search, and apply it to discover optimization algorithms for deep neural network training. We leverage efficient sea…

cs.LG2023

Effective Robustness against Natural Distribution Shifts for Models with Different Training Data

Zhouxing Shi, Nicholas Carlini, Ananth Balashankar +4

"Effective robustness" measures the extra out-of-distribution (OOD) robustness beyond what can be predicted from the in-distribution (ID) performance. Existing effective robustness…

cs.AI2022★ 2 cited

Are AlphaZero-like Agents Robust to Adversarial Perturbations?

Li-Cheng Lan, Huan Zhang, Ti-Rong Wu +3

The success of AlphaZero (AZ) has demonstrated that neural-network-based Go AIs can surpass human performance by a large margin. Given that the state space of Go is extremely large…

cs.LG2022

Improving Adversarial Robustness to Sensitivity and Invariance Attacks with Deep Metric Learning

Anaelia Ovalle, Evan Czyzycki, Cho-Jui Hsieh

Intentionally crafted adversarial samples have effectively exploited weaknesses in deep neural networks. A standard method in adversarial robustness assumes a framework to defend a…

cs.CV2022★ 14 cited

Scaling Up Dataset Distillation to ImageNet-1K with Constant Memory

Justin Cui, Ruochen Wang, Si Si +1

Dataset Distillation is a newly emerging area that aims to distill large datasets into much smaller and highly informative synthetic ones to accelerate training and reduce storage.…

cs.CL2022★ 8 cited

Two-stage LLM Fine-tuning with Less Specialization and More Generalization

Yihan Wang, Si Si, Daliang Li +5

Pretrained large language models (LLMs) are general purpose problem solvers applicable to a diverse set of tasks with prompts. They can be further improved towards a specific task…

cs.CL2022

ADDMU: Detection of Far-Boundary Adversarial Examples with Data and Model Uncertainty Estimation

Fan Yin, Yao Li, Cho-Jui Hsieh +1

Adversarial Examples Detection (AED) is a crucial defense technique against adversarial attacks and has drawn increasing attention from the Natural Language Processing (NLP) commun…

cs.LG2022★ 2 cited

Reducing Training Sample Memorization in GANs by Training with Memorization Rejection

Andrew Bai, Cho-Jui Hsieh, Wendy Kan +1

Generative adversarial network (GAN) continues to be a popular research direction due to its high generation quality. It is observed that many state-of-the-art GANs generate sample…

cs.LG2022★ 2 cited

Uncertainty in Extreme Multi-label Classification

Jyun-Yu Jiang, Wei-Cheng Chang, Jiong Zhong +2

Uncertainty quantification is one of the most crucial tasks to obtain trustworthy and reliable machine learning models for decision making. However, most research in this domain ha…

cs.LG2022★ 8 cited

Efficiently Computing Local Lipschitz Constants of Neural Networks via Bound Propagation

Zhouxing Shi, Yihan Wang, Huan Zhang +2

Lipschitz constants are connected to many properties of neural networks, such as robustness, fairness, and generalization. Existing methods for computing Lipschitz constants either…

cs.LG2022★ 2 cited

ELIAS: End-to-End Learning to Index and Search in Large Output Spaces

Nilesh Gupta, Patrick H. Chen, Hsiang-Fu Yu +2

Extreme multi-label classification (XMC) is a popular framework for solving many real-world problems that require accurate prediction from a very large number of potential output c…

cs.CL2022★ 11 cited

Watermarking Pre-trained Language Models with Backdooring

Chenxi Gu, Chengsong Huang, Xiaoqing Zheng +2

Large pre-trained language models (PLMs) have proven to be a crucial component of modern natural language processing systems. PLMs typically need to be fine-tuned on task-specific…

cs.LG2022

Efficient Non-Parametric Optimizer Search for Diverse Tasks

Ruochen Wang, Yuanhao Xiong, Minhao Cheng +1

Efficient and automated design of optimizers plays a crucial role in full-stack AutoML systems. However, prior methods in optimizer search are often limited by their scalability, g…

cs.LG2022★ 5 cited

Concept Gradient: Concept-based Interpretation Without Linear Assumption

Andrew Bai, Chih-Kuan Yeh, Pradeep Ravikumar +2

Concept-based interpretations of black-box models are often more intuitive for humans to understand. The most widely adopted approach for concept-based interpretation is Concept Ac…

cs.LG2022★ 33 cited

General Cutting Planes for Bound-Propagation-Based Neural Network Verification

Huan Zhang, Shiqi Wang, Kaidi Xu +5

Bound propagation methods, when combined with branch and bound, are among the most effective methods to formally verify properties of deep neural networks such as correctness, robu…