Establishes deterministic greedy sparsification for PSD matrix sums with piecewise error bounds achieving epsilon-approximation using O(M log(2d) eps^{-2}) terms.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.FA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Greedy sparsifications of sums of positive semidefinite matrices
Establishes deterministic greedy sparsification for PSD matrix sums with piecewise error bounds achieving epsilon-approximation using O(M log(2d) eps^{-2}) terms.