Regularized recursive least squares for anomaly detection in sparse channel tracking applications
Published Version
https://doi.org/10.1145/2103380.2103437Metadata
Show full item recordCitation
Babadi, 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.Abstract
In 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.Terms of Use
This article is made available under the terms and conditions applicable to Open Access Policy Articles, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#OAPCitable link to this page
http://nrs.harvard.edu/urn-3:HUL.InstRepos:13051802
Collections
- FAS Scholarly Articles [17813]
Contact administrator regarding this item (to report mistakes or request changes)
Comments made during the workflow steps
FAR 2012