{"total":13,"rows":[{"id":"2212.02264","title":"Bagging is an Optimal PAC Learner","created":"2022-12-05","cited_by_count":34,"area":null},{"id":"2301.09627","title":"The Impossibility of Parallelizing Boosting","created":"2023-01-23","cited_by_count":7,"area":null},{"id":"2301.11571","title":"AdaBoost is not an Optimal Weak to Strong Learner","created":"2023-01-27","cited_by_count":6,"area":null},{"id":"2502.16462","title":"Improved Margin Generalization Bounds for Voting Classifiers","created":"2025-02-23","cited_by_count":4,"area":null},{"id":"2402.02976","title":"Boosting, Voting Classifiers and Randomized Sample Compression Schemes","created":"2024-02-05","cited_by_count":3,"area":null},{"id":"2408.17148","title":"The Many Faces of Optimal Weak-to-Strong Learning","created":"2024-08-30","cited_by_count":3,"area":null},{"id":"2410.23632","title":"Sample-Efficient Agnostic Boosting","created":"2024-10-31","cited_by_count":3,"area":null},{"id":"2503.04706","title":"Sample-Optimal Agnostic Boosting with Unlabeled Data","created":"2025-03-06","cited_by_count":3,"area":null},{"id":"2408.16653","title":"Optimal Parallelization of Boosting","created":"2024-08-29","cited_by_count":2,"area":null},{"id":"2409.11597","title":"The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem","created":"2024-09-17","cited_by_count":2,"area":null},{"id":"2503.09384","title":"Revisiting Agnostic Boosting","created":"2025-03-12","cited_by_count":2,"area":null},{"id":"2511.20407","title":"Tight Margin-Based Generalization Bounds for Voting Classifiers over Finite Hypothesis Sets","created":"2025-11-25","cited_by_count":2,"area":null},{"id":"2601.11265","title":"Sample-Near-Optimal Agnostic Boosting with Improved Running Time","created":"2026-01-16","cited_by_count":1,"area":null}],"next_cursor":null}