4 citations · 11 across the 5 of their papers we have counts for
8 papers
Benefit of Interpolation in Nearest Neighbor Algorithms
Yue Xing, Qifan Song, Guang Cheng
In some studies \citep[e.g.,][]{zhang2016understanding} of deep learning, it is observed that over-parametrized deep neural networks achieve a small testing error even when the tra…
Unlabeled Data Help: Minimax Analysis and Adversarial Robustness
Yue Xing, Qifan Song, Guang Cheng
The recent proposed self-supervised learning (SSL) approaches successfully demonstrate the great potential of supplementing learning algorithms with additional unlabeled data. Howe…
Adversarially Robust Estimate and Risk Analysis in Linear Regression
Yue Xing, Ruizhi Zhang, Guang Cheng
Adversarially robust learning aims to design algorithms that are robust to small adversarial perturbations on input variables. Beyond the existing studies on the predictive perform…
On the Generalization Properties of Adversarial Training
Yue Xing, Qifan Song, Guang Cheng
Modern machine learning and deep learning models are shown to be vulnerable when testing data are slightly perturbed. Existing theoretical studies of adversarial training algorithm…
Directional Pruning of Deep Neural Networks
Shih-Kang Chao, Zhanyu Wang, Yue Xing +1
In the light of the fact that the stochastic gradient descent (SGD) often finds a flat minimum valley in the training loss, we propose a novel directional pruning method which sear…
Predictive Power of Nearest Neighbors Algorithm under Random Perturbation
Yue Xing, Qifan Song, Guang Cheng
We consider a data corruption scenario in the classical Nearest Neighbors (-NN) algorithm, that is, the testing data are randomly perturbed. Under such a scenario, the impac…