activity
20142023
most citedA Tight Bound of Hard Thresholding

58 citations · 89 across the 14 of their papers we have counts for

collaborators
Showing 2020Show all

5 papers · 1 filter

cs.LG2020★ 1 cited

On the Power of Localized Perceptron for Label-Optimal Learning of Halfspaces with Adversarial Noise

Jie Shen

We study {\em online} active learning of homogeneous halfspaces in with adversarial noise where the overall probability of a noisy label is constrained to be at most…

cs.LG2020★ 2 cited

Efficient PAC Learning from the Crowd with Pairwise Comparisons

Shiwei Zeng, Jie Shen

We study crowdsourced PAC learning of threshold functions, where the labels are gathered from a pool of annotators some of whom may behave adversarially. This is yet a challenging…

cs.LG2020★ 1 cited

One-Bit Compressed Sensing via One-Shot Hard Thresholding

Jie Shen

This paper concerns the problem of 1-bit compressed sensing, where the goal is to estimate a sparse signal from a few of its binary measurements. We study a non-convex sparsity-con…

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…