:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	da Cunha, Arthur, Larsen, Kasper Green, Ritzert, Martin
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2402.02976
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

AdaBoost is not an Optimal Weak to Strong Learner
by: Høgsgaard, Mikael Møller, et al.
Published: (2023)

Optimal Parallelization of Boosting
by: da Cunha, Arthur, et al.
Published: (2024)

Improved Margin Generalization Bounds for Voting Classifiers
by: Høgsgaard, Mikael Møller, et al.
Published: (2025)

Tight Margin-Based Generalization Bounds for Voting Classifiers over Finite Hypothesis Sets
by: Larsen, Kasper Green, et al.
Published: (2025)

Improved Replicable Boosting with Majority-of-Majorities
by: Larsen, Kasper Green, et al.
Published: (2025)

Sample-Near-Optimal Agnostic Boosting with Improved Running Time
by: da Cunha, Arthur, et al.
Published: (2026)

The Interplay Between Interpolation and Aggregation in Regression: Optimal Sample Complexity
by: Høgsgaard, Mikael Møller, et al.
Published: (2026)

Tight Generalization Bounds for Large-Margin Halfspaces
by: Larsen, Kasper Green, et al.
Published: (2025)

A Fine-Grained Understanding of Uniform Convergence for Halfspaces
by: Kontorovich, Aryeh, et al.
Published: (2026)

The Sample Complexity of Replicable Realizable PAC Learning
by: Larsen, Kasper Green, et al.
Published: (2026)

An Exponential Separation Between Quantum and Quantum-Inspired Classical Algorithms for Linear Systems
by: Grønlund, Allan, et al.
Published: (2024)

Revisiting Agnostic Boosting
by: da Cunha, Arthur, et al.
Published: (2025)

Learning with Monotone Adversarial Corruptions
by: Larsen, Kasper Green, et al.
Published: (2026)

Sample Compression Scheme Reductions
by: Attias, Idan, et al.
Published: (2024)

Revisiting Agnostic PAC Learning
by: Hanneke, Steve, et al.
Published: (2024)

Derandomizing Multi-Distribution Learning
by: Larsen, Kasper Green, et al.
Published: (2024)

The Many Faces of Optimal Weak-to-Strong Learning
by: Høgsgaard, Mikael Møller, et al.
Published: (2024)

The Effects of Randomness on the Stability of Node Embeddings
by: Schumacher, Tobias, et al.
Published: (2020)

Agnostic Sample Compression Schemes for Regression
by: Attias, Idan, et al.
Published: (2018)

Majority-of-Three: The Simplest Optimal Learner?
by: Aden-Ali, Ishaq, et al.
Published: (2024)

Replicable Learning of Large-Margin Halfspaces
by: Kalavasis, Alkis, et al.
Published: (2024)

Actively Learning Halfspaces without Synthetic Data
by: Black, Hadley, et al.
Published: (2025)

MNIST-Nd: a set of naturalistic datasets to benchmark clustering across dimensions
by: Turishcheva, Polina, et al.
Published: (2024)

Internal Evaluation of Density-Based Clusterings with Noise
by: Beer, Anna, et al.
Published: (2025)

Ensemble Performance Through the Lens of Linear Independence of Classifier Votes in Data Streams
by: Bektas, Enes, et al.
Published: (2025)

Distinguished In Uniform: Self Attention Vs. Virtual Nodes
by: Rosenbluth, Eran, et al.
Published: (2024)

Hierarchical clustering with maximum density paths and mixture models
by: Ritzert, Martin, et al.
Published: (2025)

Reconcile Certified Robustness and Accuracy for DNN-based Smoothed Majority Vote Classifier
by: Jin, Gaojie, et al.
Published: (2025)

Expediting In-Network Federated Learning by Voting-Based Consensus Model Compression
by: Su, Xiaoxin, et al.
Published: (2024)

Polynomially Over-Parameterized Convolutional Neural Networks Contain Structured Strong Winning Lottery Tickets
by: da Cunha, Arthur, et al.
Published: (2023)

Random Feature Representation Boosting
by: Zozoulenko, Nikita, et al.
Published: (2025)

Supervised Learning via Ensembles of Diverse Functional Representations: the Functional Voting Classifier
by: Riccio, Donato, et al.
Published: (2024)

Probabilistic Scores of Classifiers, Calibration is not Enough
by: Machado, Agathe Fernandes, et al.
Published: (2024)

ARBITER: Reasoning Trajectory Basins and Majority Vote Failures in Test-Time Sampling
by: Cai, Meng, et al.
Published: (2026)

iBRF: Improved Balanced Random Forest Classifier
by: Newaz, Asif, et al.
Published: (2024)

Boosting Fair Classifier Generalization through Adaptive Priority Reweighing
by: Hu, Zhihao, et al.
Published: (2023)

E-Valuating Classifier Two-Sample Tests
by: Pandeva, Teodora, et al.
Published: (2022)

Fixed Random Classifier Rearrangement for Continual Learning
by: Huang, Shengyang, et al.
Published: (2024)

Transparent Neighborhood Approximation for Text Classifier Explanation
by: Cai, Yi, et al.
Published: (2024)

Understanding Gradient Boosting Classifier: Training, Prediction, and the Role of $γ_j$
by: Chen, Hung-Hsuan
Published: (2024)