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.
Communications of the ACM , year=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Boosting with List-Decodable Codes
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.