[1510.03349] Toward a Better Understanding of Leaderboard
source link: https://arxiv.org/abs/1510.03349
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
[Submitted on 12 Oct 2015 (v1), last revised 7 Jun 2017 (this version, v2)]
Toward a Better Understanding of Leaderboard
The leaderboard in machine learning competitions is a tool to show the performance of various participants and to compare them. However, the leaderboard quickly becomes no longer accurate, due to hack or overfitting. This article gives two pieces of advice to prevent easy hack or overfitting. By following these advice, we reach the conclusion that something like the Ladder leaderboard introduced in [blum2015ladder] is inevitable. With this understanding, we naturally simplify Ladder by eliminating its redundant computation and explain how to choose the parameter and interpret it. We also prove that the sample complexity is cubic to the desired precision of the leaderboard.
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK