Proposes sBDCA with preconditioning for the LTS estimator, claiming up to 3.25 times faster runtime and up to 90% lower objective values than Fast-LTS on synthetic and real data.
and Ryser, Herbert J
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Defines multiple digraph Laplacian matrices and proves spectral relations, a radius bound with equality case, and a determinantal identity linking regular digraphs to their line digraphs.
citing papers explorer
-
Faster than Fast-LTS: Robust Regression and Outlier Detection with DC Programming
Proposes sBDCA with preconditioning for the LTS estimator, claiming up to 3.25 times faster runtime and up to 90% lower objective values than Fast-LTS on synthetic and real data.