About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
AAAI 2020
Conference paper
Pursuit of low-rank models of time-varying matrices robust to sparse and measurement noise
Abstract
In tracking of time-varying low-rank models of time-varying matrices, we present a method robust to both uniformlydistributed measurement noise and arbitrarily-distributed "sparse"noise. In theory, we bound the tracking error. In practice, our use of randomised coordinate descent is scalable and allows for encouraging results on changedetection.net, a benchmark.