1 Robust PCA
Don Dennis редактировал(а) эту страницу 2018-01-09 01:59:48 +05:30
Этот файл содержит неоднозначные символы Юникода!

Этот файл содержит неоднозначные символы Юникода, которые могут быть перепутаны с другими в текущей локали. Если это намеренно, можете спокойно проигнорировать это предупреждение. Используйте кнопку Экранировать, чтобы подсветить эти символы.

Downloads: [PDF] [Matlab ZIP] [More Code] [Poster] [COLT 2017 Slides]

Robust Principal Components Analysis (Robust PCA) is a general-purpose anomaly detection algorithm that can be deployed in tiny iot devices.

PCA-based outlier or anomaly detection algorithm is an unsupervised learning algorithm, that tries to model the “normal” class by a linear subspace. At prediction time, the points that are “distant” from the subspace are detected as anomalies. In many cases, training with anomalies (outliers) in the (unlabeled) training data might lead to learning wrong detection models. Robust PCA iteratively learns the linear subspace as well as identifies the anomalies in the training data - thereby removing the detected anomalies, and retraining with each iteration. This makes the method suited for anomaly detection in iot scenarios where labeling comes at the cost of experts time and labor - no pre-processing of training data is required.

The model size is controlled by a single hyperparameter k (dimension of the linear subspace). The prediction time is very fast, similar to the case of ProtoNN.

Refer to our paper, where precise theoretical guarantees are developed; the iterative algorithm provably converges to the true subspace of the normal class, despite the presence of a constant fraction of outliers (anomalies) in the training data.