Image de couverture de livre

Sample-Near-Optimal Agnostic Boosting with Improved Running Time

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	da Cunha, Arthur, Høgsgaard, Mikael Møller, Paudice, Andrea
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Revisiting Agnostic Boosting
par: da Cunha, Arthur, et autres
Publié: (2025)

Uniform Mean Estimation for Heavy-Tailed Distributions via Median-of-Means
par: Høgsgaard, Mikael Møller, et autres
Publié: (2025)

Optimal Parallelization of Boosting
par: da Cunha, Arthur, et autres
Publié: (2024)

The Optimal Sample Complexity of Linear Contracts
par: Høgsgaard, Mikael Møller
Publié: (2026)

Efficient Optimal PAC Learning
par: Høgsgaard, Mikael Møller
Publié: (2025)

Agnostic Language Identification and Generation
par: Høgsgaard, Mikael Møller, et autres
Publié: (2026)

On Agnostic PAC Learning in the Small Error Regime
par: Asilis, Julian, et autres
Publié: (2025)

AdaBoost is not an Optimal Weak to Strong Learner
par: Høgsgaard, Mikael Møller, et autres
Publié: (2023)

The Interplay Between Interpolation and Aggregation in Regression: Optimal Sample Complexity
par: Høgsgaard, Mikael Møller, et autres
Publié: (2026)

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

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

Understanding Aggregations of Proper Learners in Multiclass Classification
par: Asilis, Julian, et autres
Publié: (2024)

Majority-of-Three: The Simplest Optimal Learner?
par: Aden-Ali, Ishaq, et autres
Publié: (2024)

Sample-Optimal Agnostic Boosting with Unlabeled Data
par: Ghai, Udaya, et autres
Publié: (2025)

Boosting, Voting Classifiers and Randomized Sample Compression Schemes
par: da Cunha, Arthur, et autres
Publié: (2024)

Private Realizable-to-Agnostic Transformation with Near-Optimal Sample Complexity
par: Li, Bo, et autres
Publié: (2025)

Sample-Efficient Agnostic Boosting
par: Ghai, Udaya, et autres
Publié: (2024)

Near-Optimality of Contrastive Divergence Algorithms
par: Glaser, Pierre, et autres
Publié: (2025)

MOSIC: Model-Agnostic Optimal Subgroup Identification with Multi-Constraint for Improved Reliability
par: Chen, Wenxin, et autres
Publié: (2025)

Near-Optimal Sample Complexity for Online Constrained MDPs
par: Liu, Chang, et autres
Publié: (2026)

Nearly Optimal Sample Complexity for Learning with Label Proportions
par: Busa-Fekete, Robert, et autres
Publié: (2025)

Heterogeneity-Aware Client Sampling for Optimal and Efficient Federated Learning
par: Weng, Shudi, et autres
Publié: (2025)

Near Optimal Non-asymptotic Sample Complexity of 1-Identification
par: Li, Zitian, et autres
Publié: (2025)

Near-Optimal Sample Complexity Bounds for Constrained Average-Reward MDPs
par: Wei, Yukuan, et autres
Publié: (2025)

High Probability Bounds for Stochastic Subgradient Schemes with Heavy Tailed Noise
par: Parletta, Daniela A., et autres
Publié: (2022)

Improved Canonicalization for Model Agnostic Equivariance
par: Panigrahi, Siba Smarak, et autres
Publié: (2024)

Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning
par: Kayal, Aya, et autres
Publié: (2025)

Span-Agnostic Optimal Sample Complexity and Oracle Inequalities for Average-Reward RL
par: Zurek, Matthew, et autres
Publié: (2025)

Near-Optimal Sample Complexities of Divergence-based S-rectangular Distributionally Robust Reinforcement Learning
par: Li, Zhenghao, et autres
Publié: (2025)

Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity
par: Shi, Laixi, et autres
Publié: (2022)

Is Backpropagation Optimal? When Synthetic Gradients Improve Sample Efficiency
par: Zhang, Yibo Jacky, et autres
Publié: (2026)

Boosting Efficiency in Task-Agnostic Exploration through Causal Knowledge
par: Yang, Yupei, et autres
Publié: (2024)

Near-Optimal Real-Time Personalization with Simple Transformers
par: An, Lin, et autres
Publié: (2025)

Improving Distribution Alignment with Diversity-based Sampling
par: Napoli, Andrea, et autres
Publié: (2024)

Near-Optimal Sample Complexity for Iterated CVaR Reinforcement Learning with a Generative Model
par: Deng, Zilong, et autres
Publié: (2025)

Empirical Bound Information-Directed Sampling for Norm-Agnostic Bandits
par: Suder, Piotr M., et autres
Publié: (2025)

Improved Bounds for Reward-Agnostic and Reward-Free Exploration
par: Ridel, Oran, et autres
Publié: (2026)

Toward Model-Agnostic Detection of New Physics Using Data-Driven Signal Regions
par: Yi, Soheun, et autres
Publié: (2024)

A Near-optimal SQ Lower Bound for Smoothed Agnostic Learning of Boolean Halfspaces
par: Sinen, Tim
Publié: (2026)

Optimally Interpolating between Ex-Ante Fairness and Welfare
par: Høgsgaard, Mikael Møller, et autres
Publié: (2023)