Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing , pages =

Levin, Leonid , title = · 1985 · DOI 10.1145/22145.22185 · arXiv 2145.22185

1 Pith paper cite this work, alongside 97 external citations. Polarity classification is still indexing.

1 Pith paper citing it

97 external citations · external index

open at publisher browse 1 citing papers arXiv PDF

representative citing papers

stat.ML · 2026-07-07 · accept · novelty 8.0

A new boosting algorithm uses list-decodable codes to reduce weak-learner calls from O(log(1/ε)/γ²) to O(log(1/ε)) for XOR-closed concept classes.

Showing 1 of 1 citing paper.

Boosting with List-Decodable Codes stat.ML · 2026-07-07 · accept · none · ref 4
A new boosting algorithm uses list-decodable codes to reduce weak-learner calls from O(log(1/ε)/γ²) to O(log(1/ε)) for XOR-closed concept classes.