:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Larsen, Kasper Green, Mathiasen, Markus Engelund, Svendsen, Clement
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2501.18388
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

Boosting, Voting Classifiers and Randomized Sample Compression Schemes
by: da Cunha, Arthur, et al.
Published: (2024)

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

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

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

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

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)

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

Learning with Monotone Adversarial Corruptions
by: Larsen, Kasper Green, 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)

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

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

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

Majority of the Bests: Improving Best-of-N via Bootstrapping
by: Rakhsha, Amin, et al.
Published: (2025)

Majority Voting for Code Generation
by: Launer, Tim, et al.
Published: (2026)

Improving Relative Representations with Learned Anchors and Whitened Inner Products
by: Svendsen, Oscar Thorsted, et al.
Published: (2026)

On the Byzantine Fault Tolerance of signSGD with Majority Vote
by: Mengoli, Emanuele, et al.
Published: (2025)

Optimized Tradeoffs for Private Prediction with Majority Ensembling
by: Jiang, Shuli, et al.
Published: (2024)

Majorization-Minimization Dual Stagewise Algorithm for Generalized Lasso
by: Chen, Jianmin, et al.
Published: (2025)

Majorizing Stress Formula Two
by: de Leeuw, Jan
Published: (2024)

Inferring Effects of Major Events through Discontinuity Forecasting of Population Anxiety
by: Mangalik, Siddharth, et al.
Published: (2025)

Learning Majority-to-Minority Transformations with MMD and Triplet Loss for Imbalanced Classification
by: Cha, Suman, et al.
Published: (2025)

Best-of-Majority: Minimax-Optimal Strategy for Pass@$k$ Inference Scaling
by: Di, Qiwei, et al.
Published: (2025)

Generalized Criterion for Identifiability of Additive Noise Models Using Majorization
by: Dallakyan, Aramayis, et al.
Published: (2024)

Derandomizing Simultaneous Confidence Regions for Band-Limited Functions by Improved Norm Bounds and Majority-Voting Schemes
by: Csáji, Balázs Csanád, et al.
Published: (2025)

Federated Majorize-Minimization: Beyond Parameter Aggregation
by: Dieuleveut, Aymeric, et al.
Published: (2025)

Counting Network for Learning from Majority Label
by: Shiku, Kaito, et al.
Published: (2024)

Majority Vote for Distributed Differentially Private Sign Selection
by: Liu, Weidong, et al.
Published: (2022)

A Second Look on BASS -- Boosting Abstractive Summarization with Unified Semantic Graphs -- A Replication Study
by: Koraş, Osman Alperen, et al.
Published: (2024)

A Framework for Bounding Deterministic Risk with PAC-Bayes: Applications to Majority Votes
by: Leblanc, Benjamin, et al.
Published: (2025)

Rethinking Message Passing Neural Networks with Diffusion Distance-guided Stress Majorization
by: Zheng, Haoran, et al.
Published: (2025)

A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion
by: Liu, Xiaoqian, et al.
Published: (2023)

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

The Majority Vote Paradigm Shift: When Popular Meets Optimal
by: Purificato, Antonio, et al.
Published: (2025)

Inertial Quadratic Majorization Minimization with Application to Kernel Regularized Learning
by: Heng, Qiang, et al.
Published: (2025)

A Second-Order Majorant Algorithm for Nonnegative Matrix Factorization
by: Pham, Mai-Quyen, et al.
Published: (2023)