Image de couverture de livre

AdaBoost is not an Optimal Weak to Strong Learner

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Høgsgaard, Mikael Møller, Larsen, Kasper Green, Ritzert, Martin
Format:	Preprint
Publié:	2023
Sujets:	Machine Learning Computational Complexity Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Many Faces of Optimal Weak-to-Strong Learning
par: Høgsgaard, Mikael Møller, et autres
Publié: (2024)

Improved Margin Generalization Bounds for Voting Classifiers
par: Høgsgaard, Mikael Møller, et autres
Publié: (2025)

An Exponential Separation Between Quantum and Quantum-Inspired Classical Algorithms for Linear Systems
par: Grønlund, Allan, et autres
Publié: (2024)

The Sample Complexity of Replicable Realizable PAC Learning
par: Larsen, Kasper Green, et autres
Publié: (2026)

Derandomizing Multi-Distribution Learning
par: Larsen, Kasper Green, et autres
Publié: (2024)

Rate-optimal community detection near the KS threshold via node-robust algorithms
par: Ding, Jingqiu, et autres
Publié: (2025)

The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem
par: Blanc, Guy, et autres
Publié: (2024)

Cascaded Learned Bloom Filter for Optimal Model-Filter Size Balance and Fast Rejection
par: Sato, Atsuki, et autres
Publié: (2025)

Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation
par: Bringmann, Karl, et autres
Publié: (2024)

Superconstant Inapproximability of Decision Tree Learning
par: Koch, Caleb, et autres
Publié: (2024)

Exact and Approximate Algorithms for Polytree Learning
par: Harviainen, Juha, et autres
Publié: (2026)

Differentially Private Verification of Distribution Properties
par: Du, Elbert, et autres
Publié: (2026)

Efficient and Private Property Testing via Indistinguishability
par: Dwork, Cynthia, et autres
Publié: (2025)

Fast decision tree learning solves hard coding-theoretic problems
par: Koch, Caleb, et autres
Publié: (2024)

Adaptive and oblivious statistical adversaries are equivalent
par: Blanc, Guy, et autres
Publié: (2024)

A Distributional-Lifting Theorem for PAC Learning
par: Blanc, Guy, et autres
Publié: (2025)

Private graphon estimation via sum-of-squares
par: Chen, Hongjie, et autres
Publié: (2024)

Low-Degree Method Fails to Predict Robust Subspace Recovery
par: Jia, He, et autres
Publié: (2026)

Feature Selection and Junta Testing are Statistically Equivalent
par: Beretta, Lorenzo, et autres
Publié: (2025)

Omnipredictors for Regression and the Approximate Rank of Convex Functions
par: Gopalan, Parikshit, et autres
Publié: (2024)

On the Power of Interactive Proofs for Learning
par: Gur, Tom, et autres
Publié: (2024)

Samplability makes learning easier
par: Blanc, Guy, et autres
Publié: (2025)

Efficient Turing Machine Simulation with Transformers
par: Li, Qian, et autres
Publié: (2025)

Is nasty noise actually harder than malicious noise?
par: Blanc, Guy, et autres
Publié: (2025)

Active Learning for Decision Trees with Provable Guarantees
par: Moakhar, Arshia Soltani, et autres
Publié: (2026)

Low-degree phase transitions for detecting a planted clique in sublinear time
par: Mardia, Jay, et autres
Publié: (2024)

On the Hardness of Approximation of the Fair k-Center Problem
par: Thejaswi, Suhas
Publié: (2026)

Computational-Statistical Tradeoffs from NP-hardness
par: Blanc, Guy, et autres
Publié: (2025)

Learning-Augmented Algorithms for Boolean Satisfiability
par: Attias, Idan, et autres
Publié: (2025)

The Computational Complexity of Almost Stable Clustering with Penalties
par: Khodamoradi, Kamyar, et autres
Publié: (2025)

Hardness of Maximum Likelihood Learning of DPPs
par: Grigorescu, Elena, et autres
Publié: (2022)

Hardness of Learning Boolean Functions from Label Proportions
par: Guruswami, Venkatesan, et autres
Publié: (2024)

Supersimulators
par: Dwork, Cynthia, et autres
Publié: (2025)

Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences
par: Leake, Jonathan, et autres
Publié: (2025)

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds
par: Bringmann, Karl, et autres
Publié: (2023)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

The I/O Complexity of Attention, or How Optimal is Flash Attention?
par: Saha, Barna, et autres
Publié: (2024)

Efficient and Near-Optimal Noise Generation for Streaming Differential Privacy
par: Dvijotham, Krishnamurthy, et autres
Publié: (2024)

Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems
par: Blanchard, Moise
Publié: (2024)

Learning with Monotone Adversarial Corruptions
par: Larsen, Kasper Green, et autres
Publié: (2026)