Pursuit of Low-Rank Models of Time-Varying Matrices Robust to Sparse and Measurement Noise

September 10, 2018 Β· Declared Dead Β· πŸ› AAAI Conference on Artificial Intelligence

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Albert Akhriev, Jakub Marecek, Andrea Simonetto arXiv ID 1809.03550 Category math.OC: Optimization & Control Cross-listed cs.CV, math.ST Citations 8 Venue AAAI Conference on Artificial Intelligence Last Checked 5 months ago
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 changedetection net, a benchmark.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Optimization & Control

Died the same way β€” πŸ‘» Ghosted