DBScholar

Back to papers

HedgeCut: Maintaining Randomised Trees for Low-Latency Machine Unlearning

Summary: HedgeCut: an ensemble of randomized decision trees for low-latency machine unlearning. It supports removing data without retraining via vectorised tree operations, delivering ~100 microseconds unlearning latency and up to 36k predictions/sec, with training time and accuracy comparable to Random Forests. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6192
Venue
SIGMOD
Year
2021
Pagerank
6.9878154e-05
Overall Rank
3,960 | 72.84%
DOI
10.1145/3448016.3457239

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{schelter_sigmod21,
        title = {{HedgeCut: Maintaining Randomised Trees for Low-Latency Machine Unlearning}},
        author = {Schelter, Sebastian and Grafberger, Stefan and Dunning, Ted},
        series = {{SIGMOD} '21},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3448016.3457239},
        url = {https://dl.acm.org/doi/10.1145/3448016.3457239},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers