3 accepted papers
In this paper, we investigate the adversarial robustness of principal component analysis (PCA) algorithms. In the considered setup, there is a powerful adversary who can add a carefully designed data point to the original data matrix. The goal of the adversary is to maximize the distance between the…
In this paper, we investigate the adversarial robustness of subspace learning problems. Different from the scenario addressed by classic robust algorithms that assume fractions of data are corrupted, we consider a more powerful adversary who can observe the whole data and modify all of them. The goa…
In this paper, we study the problem of sparse signal recovery when partial but partly erroneous prior knowledge of the signal's support is available. Based on the conventional sparse Bayesian learning framework, we propose an improved hierarchical prior model. The proposed modeling constitutes a thr…