Markus Engelund Mathiasen

Orcid: 0009-0003-6612-3046

According to our database1, Markus Engelund Mathiasen authored at least 3 papers between 2024 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
The Sample Complexity of Replicable Realizable PAC Learning.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025
Improved Replicable Boosting with Majority-of-Majorities.
CoRR, January, 2025

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


  Loading...