Abstract
In tracking of time-varying low-rank models of time-varying matrices, we present a method robust to both uniformly-distributed 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 a benchmark (changedetection net).
Abstract (translated by Google)
URL
http://arxiv.org/abs/1809.03550