Regularized recursive least squares for anomaly detection in sparse channel tracking applications
MetadataShow full item record
CitationBabadi, Behtash, and Vahid Tarokh. 2011. “Regularized Recursive Least Squares for Anomaly Detection in Sparse Channel Tracking Applications.” Proceedings of the 2011 ACM Symposium on Research in Applied Computation (March 21 - 24, 2011, TaiChung, Taiwan), 277-281.
AbstractIn this paper, we study the problem of anomaly detection in sparse channel tracking applications via the \(l_1\)-regularized least squares adaptive filter (SPARLS). Anomalies arise due to unexpected adversarial changes in the channel and quick detection of these anomalies is desired. We first prove analytically that the prediction error of the SPARLS algorithm can be substantially lower than that of the widely-used Recursive Least Squares (RLS) algorithm. Furthermore, we present Receiver Operating Characteristic (ROC) curves for the detection/false alarm trade-off of anomaly detection in a sparse multi-path fading channel tracking scenario. These curves reveal the considerable advantage of the SPARLS algorithm over the RLS algorithm.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:13051802
- FAS Scholarly Articles