conftrace_

boosting algorithm

78 papers

Explore in graph

Co-occurring keywords

ensemble learning (1274) weak learner (33) loss function (462) agnostic learning (76) online learning (1777) decision tree (322) convex optimization (1321) multiclass classification (181) sample complexity (1169) ensemble method (564)

Papers

Improved Replicable Boosting with Majority-of-Majorities ALT 2026
Kernel-based L_2-Boosting with Structure Constraints JMLR 2025
Boosting Causal Additive Models JMLR 2025
Efficient Quantum Agnostic Improper Learning of Decision Trees AISTATS 2024
Sample-Efficient Agnostic Boosting NIPS 2024
Optimal Parallelization of Boosting NIPS 2024
The Many Faces of Optimal Weak-to-Strong Learning NIPS 2024
A Boosting-Type Convergence Result for AdaBoost.MH with Factorized Multi-Class Classifiers NIPS 2024
Random Classification Noise does not defeat All Convex Potential Boosters Irrespective of Model Choice ICML 2023
Boosted Off-Policy Learning AISTATS 2023
Fair Densities via Boosting the Sufficient Statistics of Exponential Families ICML 2023
Gap Minimization for Knowledge Sharing and Transfer JMLR 2023
On the Robustness of Randomized Ensembles to Adversarial Perturbations ICML 2023
AdaBoost is not an Optimal Weak to Strong Learner ICML 2023
ExactBoost: Directly Boosting the Margin in Combinatorial and Non-decomposable Metrics AISTATS 2022
Being Properly Improper ICML 2022
A Resilient Distributed Boosting Algorithm ICML 2022
Optimal Weak to Strong Learning NIPS 2022
Fair Wrapping for Black-box Predictions NIPS 2022
Online Agnostic Multiclass Boosting NIPS 2022
Boosting in the Presence of Massart Noise COLT 2021
Gradient-Based Algorithms for Machine Teaching CVPR 2021
Boosting for Online Convex Optimization ICML 2021
Precision-based Boosting AAAI 2021
Boosted CVaR Classification NIPS 2021