activity
20142023
most citedDeep Batch Active Learning by Diverse, Uncertain Gradient Lower Bounds

274 citations · 480 across the 29 of their papers we have counts for

collaborators

29 papers

cs.LG2023

Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded Rewards

Hao Qin, Kwang-Sung Jun, Chicheng Zhang

We study -armed bandit problems where the reward distributions of the arms are all supported on the interval. It has been a challenge to design regret-efficient randomiz…

stat.ML2022

PopArt: Efficient Sparse Regression and Experimental Design for Optimal Sparse Linear Bandits

Kyoungseok Jang, Chicheng Zhang, Kwang-Sung Jun

In sparse linear bandits, a learning agent sequentially selects an action and receive reward feedback, and the reward function depends linearly on a few coordinates of the covariat…

cs.LG2022★ 1 cited

On Efficient Online Imitation Learning via Classification

Yichen Li, Chicheng Zhang

Imitation learning (IL) is a general learning paradigm for tackling sequential decision-making problems. Interactive imitation learning, where learners can interactively query for…

cs.LG2022

Thompson Sampling for Robust Transfer in Multi-Task Bandits

Zhi Wang, Chicheng Zhang, Kamalika Chaudhuri

We study the problem of online multi-task learning where the tasks are performed within similar but not necessarily identical multi-armed bandit environments. In particular, we stu…

cs.LG2022★ 3 cited

Active Fairness Auditing

Tom Yan, Chicheng Zhang

The fast spreading adoption of machine learning (ML) by companies across industries poses significant regulatory challenges. One such challenge is scalability: how can regulatory b…

cs.LG2022

Margin-distancing for safe model explanation

Tom Yan, Chicheng Zhang

The growing use of machine learning models in consequential settings has highlighted an important and seemingly irreconcilable tension between transparency and vulnerability to gam…

cs.LG2021

SIM-ECG: A Signal Importance Mask-driven ECGClassification System

Dharma KC, Chicheng Zhang, Chris Gniady +2

Heart disease is the number one killer, and ECGs can assist in the early diagnosis and prevention of deadly outcomes. Accurate ECG interpretation is critical in detecting heart dis…

cs.CV2021★ 1 cited

Improving the trustworthiness of image classification models by utilizing bounding-box annotations

Dharma KC, Chicheng Zhang

We study utilizing auxiliary information in training data to improve the trustworthiness of machine learning models. Specifically, in the context of image classification, we propos…

cs.LG2021★ 1 cited

Provably Efficient Multi-Task Reinforcement Learning with Model Transfer

Chicheng Zhang, Zhi Wang

We study multi-task reinforcement learning (RL) in tabular episodic Markov decision processes (MDPs). We formulate a heterogeneous multi-player RL problem, in which a group of play…

cs.LG2021

Improved Algorithms for Efficient Active Learning Halfspaces with Massart and Tsybakov noise

Chicheng Zhang, Yinan Li

We give a computationally-efficient PAC active learning algorithm for -dimensional homogeneous halfspaces that can tolerate Massart noise (Massart and Nédélec, 2006) and Tsybako…

cs.LG2020★ 1 cited

Multitask Bandit Learning Through Heterogeneous Feedback Aggregation

Zhi Wang, Chicheng Zhang, Manish Kumar Singh +2

In many real-world applications, multiple agents seek to learn how to perform highly related yet slightly different tasks in an online bandit learning protocol. We formulate this p…

cs.LG2020★ 1 cited

Active Online Learning with Hidden Shifting Domains

Yining Chen, Haipeng Luo, Tengyu Ma +1

Online machine learning systems need to adapt to domain shifts. Meanwhile, acquiring label at every timestep is expensive. We propose a surprisingly simple algorithm that adaptivel…

cs.LG2020★ 5 cited

Crush Optimism with Pessimism: Structured Bandits Beyond Asymptotic Optimality

Kwang-Sung Jun, Chicheng Zhang

We study stochastic structured bandits for minimizing regret. The fact that the popular optimistic algorithms do not achieve the asymptotic instance-dependent regret optimality (as…

cs.LG2020★ 6 cited

Efficient Contextual Bandits with Continuous Actions

Maryam Majzoubi, Chicheng Zhang, Rajan Chari +3

We create a computationally tractable algorithm for contextual bandits with continuous actions having unknown structure. Our reduction-style algorithm composes with most supervised…

stat.ML2020★ 3 cited

Attribute-Efficient Learning of Halfspaces with Malicious Noise: Near-Optimal Label Complexity and Noise Tolerance

Jie Shen, Chicheng Zhang

This paper is concerned with computationally efficient learning of homogeneous sparse halfspaces in under noise. Though recent works have established attribute-effic…

cs.LG2020★ 18 cited

Efficient active learning of sparse halfspaces with arbitrary bounded noise

Chicheng Zhang, Jie Shen, Pranjal Awasthi

We study active learning of homogeneous -sparse halfspaces in under the setting where the unlabeled data distribution is isotropic log-concave and each label is f…

cs.LG2019★ 274 cited

Deep Batch Active Learning by Diverse, Uncertain Gradient Lower Bounds

Jordan T. Ash, Chicheng Zhang, Akshay Krishnamurthy +2

We design a new algorithm for batch active learning with deep neural network models. Our algorithm, Batch Active learning by Diverse Gradient Embeddings (BADGE), samples groups of…

cs.LG2019★ 3 cited

Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case

Alina Beygelzimer, Dávid Pál, Balázs Szörényi +3

We study the problem of efficient online multiclass linear classification with bandit feedback, where all examples belong to one of classes and lie in the -dimensional Eucli…

stat.ML2019★ 22 cited

Contextual Bandits with Continuous Actions: Smoothing, Zooming, and Adapting

Akshay Krishnamurthy, John Langford, Aleksandrs Slivkins +1

We study contextual bandit learning with an abstract policy class and continuous action space. We obtain two qualitatively different regret bounds: one competes with a smoothed ver…

cs.LG2019★ 12 cited

Warm-starting Contextual Bandits: Robustly Combining Supervised and Bandit Feedback

Chicheng Zhang, Alekh Agarwal, Hal Daumé +2

We investigate the feasibility of learning from a mix of both fully-labeled supervised data and contextual bandit data. We specifically consider settings in which the underlying le…

cs.LG2018★ 1 cited

Efficient active learning of sparse halfspaces

Chicheng Zhang

We study the problem of efficient PAC active learning of homogeneous linear classifiers (halfspaces) in , where the goal is to learn a halfspace with low error using…

cs.LG2018

Spectral Learning of Binomial HMMs for DNA Methylation Data

Chicheng Zhang, Eran A. Mukamel, Kamalika Chaudhuri

We consider learning parameters of Binomial Hidden Markov Models, which may be used to model DNA methylation data. The standard algorithm for the problem is EM, which is computatio…

cs.LG2017★ 1 cited

Efficient Online Bandit Multiclass Learning with Regret

Alina Beygelzimer, Francesco Orabona, Chicheng Zhang

We present an efficient second-order algorithm with regret for the bandit online multiclass problem. The regret bound holds simultaneously with respe…

cs.LG2017★ 20 cited

Revisiting Perceptron: Efficient and Label-Optimal Learning of Halfspaces

Songbai Yan, Chicheng Zhang

It has been a long-standing problem to efficiently learn a halfspace using as few labels as possible in the presence of noise. In this work, we propose an efficient Perceptron-base…