One-pass algorithms achieve Õ(M²/ε) space for regression splits and Õ(1/ε) space for Gini splits with matching Ω lower bounds.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Nearly Optimal Bounds for Computing Decision Tree Splits in Data Streams
One-pass algorithms achieve Õ(M²/ε) space for regression splits and Õ(1/ε) space for Gini splits with matching Ω lower bounds.