Lumberjack introduces a novel (ε,δ)-DP heavy hitter detection algorithm for hierarchical data with O(√log h) error that allows deeper trees and yields a new state-of-the-art privacy-utility tradeoff for random forests.
This is heuristically better than using the data points themselves, but it still breaks DP
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Lumberjack: Better Differentially Private Random Forests through Heavy Hitter Detection in Trees
Lumberjack introduces a novel (ε,δ)-DP heavy hitter detection algorithm for hierarchical data with O(√log h) error that allows deeper trees and yields a new state-of-the-art privacy-utility tradeoff for random forests.