Pith. sign in

39th Computational Complexity Conference (CCC 2024) , pages =

Blanc, Guy, Koch, Caleb, Strassle, Carmen, Tan, Li-Yang , title = · 2024 · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · DOI 10.4230/lipics.ccc.2024.16

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

1 Pith paper citing it
1 external citations · OpenAlex
open at publisher browse 1 citing papers

fields

stat.ML 1

years

2026 1

verdicts

ACCEPT 1

representative citing papers

Boosting with List-Decodable Codes

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Boosting with List-Decodable Codes stat.ML · 2026-07-07 · accept · none · ref 5

    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.