Jie Shen

Proceedings of the International Conference on Machine Learning, 2023

Semi-Verified PAC Learning from the Crowd.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

Fast spectral analysis for approximate nearest neighbor search.

[BibT_eX]

[DOI]

Mach. Learn., 2022

List-Decodable Sparse Mean Estimation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Residual-Based Sampling for Online Outlier-Robust PCA.

[BibT_eX]

[DOI]

Tianhao Zhu

Proceedings of the International Conference on Machine Learning, 2022

Efficient PAC Learning from the Crowd with Pairwise Comparisons.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Metric-Fair Active Learning.

[BibT_eX]

[DOI]

Nan Cui

Proceedings of the International Conference on Machine Learning, 2022

2021

Semi-verified Learning from the Crowd with Pairwise Comparisons.

[BibT_eX]

[DOI]

CoRR, 2021

Sample-Optimal PAC Learning of Halfspaces with Malicious Noise.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

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

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

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

[BibT_eX]

[DOI]

Chicheng Zhang

Proceedings of the Algorithmic Learning Theory, 2021

2020

Learning Halfspaces with Pairwise Comparisons: Breaking the Barriers of Query Complexity via Crowd Wisdom.

[BibT_eX]

[DOI]

CoRR, 2020

One-Bit Compressed Sensing via One-Shot Hard Thresholding.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, 2020

Efficient active learning of sparse halfspaces with arbitrary bounded noise.

[BibT_eX]

[DOI]

Chicheng Zhang

Pranjal Awasthi

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Robust Matrix Completion from Quantized Observations.

[BibT_eX]

[DOI]

Pranjal Awasthi

Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018

Provable Variable Selection for Streaming Features.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

2017

Object proposal with kernelized partial ranking.

[BibT_eX]

[DOI]

Pattern Recognit., 2017

Online optimization for max-norm regularization.

[BibT_eX]

[DOI]

Huan Xu

Mach. Learn., 2017

A Tight Bound of Hard Thresholding.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2017

Online Matrix Completion for Signed Link Prediction.

[BibT_eX]

[DOI]

Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, 2017

Partial Hard Thresholding: Towards A Principled Analysis of Support Recovery.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

On the Iteration Complexity of Support Recovery via Hard Thresholding Pursuit.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Machine Learning, 2017

2016

Online Low-Rank Subspace Clustering by Basis Dictionary Pursuit.

[BibT_eX]

[DOI]

Huan Xu

Proceedings of the 33nd International Conference on Machine Learning, 2016

Learning Structured Low-Rank Representation via Matrix Factorization.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2015

Social Trust Prediction via Max-norm Constrained 1-bit Matrix Completion.

[BibT_eX]

[DOI]

Huan Xu

CoRR, 2015

Object Proposal via Partial Re-ranking.

[BibT_eX]

[DOI]