Mikael Høgsgaard

According to our database1, Mikael Høgsgaard authored at least 14 papers between 2023 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Uniform Mean Estimation for Heavy-Tailed Distributions via Median-of-Means.
CoRR, June, 2025

Revisiting Agnostic Boosting.
CoRR, March, 2025

On Agnostic PAC Learning in the Small Error Regime.
CoRR, February, 2025

Improved Margin Generalization Bounds for Voting Classifiers.
Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

Efficient Optimal PAC Learning.
Proceedings of the International Conference on Algorithmic Learning Theory, 2025

Understanding Aggregations of Proper Learners in Multiclass Classification.
Proceedings of the International Conference on Algorithmic Learning Theory, 2025

2024
Majority-of-Three: The Simplest Optimal Learner?
CoRR, 2024

The Many Faces of Optimal Weak-to-Strong Learning.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Optimal Parallelization of Boosting.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Sparse Dimensionality Reduction Revisited.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023
Optimally Interpolating between Ex-Ante Fairness and Welfare.
CoRR, 2023

Barriers for Faster Dimensionality Reduction.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

AdaBoost is not an Optimal Weak to Strong Learner.
Proceedings of the International Conference on Machine Learning, 2023

The Fast Johnson-Lindenstrauss Transform Is Even Faster.
Proceedings of the International Conference on Machine Learning, 2023


  Loading...