activity
20172022
most citedNon-convex Finite-Sum Optimization Via SCSG Methods

129 citations · 459 across the 10 of their papers we have counts for

collaborators

11 papers

stat.ME2022★ 2 cited

QuTE: decentralized multiple testing on sensor networks with false discovery rate control

Aaditya Ramdas, Jianbo Chen, Martin J. Wainwright +1

This paper designs methods for decentralized multiple hypothesis testing on graphs that are equipped with provable guarantees on the false discovery rate (FDR). We consider the set…

cs.LG2019★ 15 cited

ML-LOO: Detecting Adversarial Examples with Feature Attribution

Puyudi Yang, Jianbo Chen, Cho-Jui Hsieh +2

Deep neural networks obtain state-of-the-art performance on a series of tasks. However, they are easily fooled by adding a small adversarial perturbation to input. The perturbation…

cs.LG2019★ 69 cited

HopSkipJumpAttack: A Query-Efficient Decision-Based Attack

Jianbo Chen, Michael I. Jordan, Martin J. Wainwright

The goal of a decision-based adversarial attack on a trained model is to generate adversarial examples based solely on observing output labels returned by the targeted model. We de…

cs.LG2019★ 5 cited

LS-Tree: Model Interpretation When the Data Are Linguistic

Jianbo Chen, Michael I. Jordan

We study the problem of interpreting trained classification models in the setting of linguistic data sets. Leveraging a parse tree, we propose to assign least-squares based importa…

cs.LG2018★ 37 cited

L-Shapley and C-Shapley: Efficient Model Interpretation for Structured Data

Jianbo Chen, Le Song, Martin J. Wainwright +1

We study instancewise feature importance scoring as a method for model interpretation. Any such method yields, for each predicted instance, a vector of importance scores associated…

cs.LG2018★ 29 cited

Greedy Attack and Gumbel Attack: Generating Adversarial Examples for Discrete Data

Puyudi Yang, Jianbo Chen, Cho-Jui Hsieh +2

We present a probabilistic framework for studying adversarial attacks on discrete data. Based on this framework, we derive a perturbation-based method, Greedy Attack, and a scalabl…

cs.LG2018★ 105 cited

Learning to Explain: An Information-Theoretic Perspective on Model Interpretation

Jianbo Chen, Le Song, Martin J. Wainwright +1

We introduce instancewise feature selection as a methodology for model interpretation. Our method is based on learning a function to extract a subset of features that are most info…

cs.CV2017

Language-Based Image Editing with Recurrent Attentive Models

Jianbo Chen, Yelong Shen, Jianfeng Gao +2

We investigate the problem of Language-Based Image Editing (LBIE). Given a source image and a natural language description, we want to generate a target image by editing the source…

stat.ME2017★ 7 cited

DAGGER: A sequential algorithm for FDR control on DAGs

Aaditya Ramdas, Jianbo Chen, Martin J. Wainwright +1

We propose a linear-time, single-pass, top-down algorithm for multiple testing on directed acyclic graphs (DAGs), where nodes represent hypotheses and edges specify a partial order…

stat.ML2017★ 61 cited

Kernel Feature Selection via Conditional Covariance Minimization

Jianbo Chen, Mitchell Stern, Martin J. Wainwright +1

We propose a method for feature selection that employs kernel-based measures of independence to find a subset of covariates that is maximally predictive of the response. Building o…

math.OC2017★ 129 cited

Non-convex Finite-Sum Optimization Via SCSG Methods

Lihua Lei, Cheng Ju, Jianbo Chen +1

We develop a class of algorithms, as variants of the stochastically controlled stochastic gradient (SCSG) methods (Lei and Jordan, 2016), for the smooth non-convex finite-sum optim…