AI Paper Atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

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

Albert Akhriev, Jakub Marecek, Andrea Simonetto

AAAI 2020 · Learning theory and algorithms › Matrix and tensor methods · approach: Low-rank approximation theory · 5 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the proposed robust time-varying low-rank approach rather than OMoGMFchangedetection.net overall (6 categories) · changedetection.net overall (6 categories)F1: 0.44643 -> 0.57099Improved
Use the proposed approach rather than OMoGMFchangedetection.net baseline · changedetection.net baselineF1: 0.72611 -> 0.80254Improved
Use the proposed approach rather than TTD_3WDchangedetection.net baseline/highway · baseline/highwaymean time per frame: 10.343 -> 0.103 secondsImproved
Use Geman-McLure loss instead of the L1 norm (ablation)proposed approach · changedetection.net baselineF1: 0.79421 -> 0.80254Improved
Use Geman-McLure loss instead of the L1 norm (ablation)proposed approach · changedetection.net baseline/highwaymean time per frame: 0.194 -> 0.103 secondsHurt
Use Geman-McLure loss instead of the L1 norm (ablation)proposed approach · changedetection.net overall (6 categories)F1: 0.57099 -> 0.56514Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy