ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2212.02264
  4. Cited By
Bagging is an Optimal PAC Learner

Bagging is an Optimal PAC Learner

5 December 2022
Kasper Green Larsen
ArXivPDFHTML

Papers citing "Bagging is an Optimal PAC Learner"

6 / 6 papers shown
Title
Are Ensembles Getting Better all the Time?
Are Ensembles Getting Better all the Time?
Pierre-Alexandre Mattei
Damien Garreau
OOD
FedML
46
1
0
29 Nov 2023
Optimal PAC Bounds Without Uniform Convergence
Optimal PAC Bounds Without Uniform Convergence
Ishaq Aden-Ali
Yeshwanth Cherapanamjeri
Abhishek Shetty
Nikita Zhivotovskiy
35
16
0
18 Apr 2023
Bagging Provides Assumption-free Stability
Bagging Provides Assumption-free Stability
Jake A. Soloff
Rina Foygel Barber
Rebecca Willett
24
9
0
30 Jan 2023
AdaBoost is not an Optimal Weak to Strong Learner
AdaBoost is not an Optimal Weak to Strong Learner
M. Hogsgaard
Kasper Green Larsen
Martin Ritzert
13
5
0
27 Jan 2023
The Impossibility of Parallelizing Boosting
The Impossibility of Parallelizing Boosting
Amin Karbasi
Kasper Green Larsen
21
3
0
23 Jan 2023
The One-Inclusion Graph Algorithm is not Always Optimal
The One-Inclusion Graph Algorithm is not Always Optimal
Ishaq Aden-Ali
Yeshwanth Cherapanamjeri
Abhishek Shetty
Nikita Zhivotovskiy
29
7
0
19 Dec 2022
1