hcarlens
State of ML Competitions (Feb 2025)
DeCAF: "the OG foundation model in vision" (ICML 2024)
The Wikipedia article doesn't have that much detail on M5 or M6, but the M5 papers are in the International Journal of Forecasting[1] and M6 should be published later this year (there's already a preprint on arxiv [2]).
I recently spent some time looking into the history and results of the M competitions and had a chance to speak to Professor Makridakis about them, as well as the winners of each of the M6 competition tracks [3]. While the methods have become more sophisticated, some conclusions from M1 still seem to hold: in particular, that there is no overall "best" method, and that the winning method tends to be different for different types of data, time horizons, and evaluation metrics.
[1]: https://www.sciencedirect.com/science/article/pii/S016920702... [2]: https://arxiv.org/abs/2310.13357 [3]: https://mlcontests.com/state-of-competitive-machine-learning...
($10m prize for models that can perform well at IMO)
(In turn, in the Phi-2 post they compare Phi-2 to Llama-2 instead of CodeLlama, making it even harder)
[1]: https://www.microsoft.com/en-us/research/blog/phi-2-the-surp...
My AI Timelines Have Sped Up (Again)
Platforms like Kaggle, DrivenData, Zindi, AIcrowd, CodaLab and others are running dozens-hundreds of competitions a year in total, including ones linked to top academic conferences. One interesting recent one is this one on LLM efficiency - trying to see to what extent people can fine-tune an LLM with just 1GPU and 24h: https://llm-efficiency-challenge.github.io/
Or the Makridakis series of challenges, running since the 80s, which are a great testbed for time-series models (the 6th one finished just last year): https://mofc.unic.ac.cy/the-m6-competition/
My basic understanding is that it combines "standard" supervised learning techniques (neural nets + SGD) with a set of logical requirements (e.g. in the case of annotating autonomous driving data, things like "a traffic light cannot be red and green at the same time"). The logical requirements not only make the solution more practically useful, but can also help it learn the "right" solution with less labelled data.
[1] I don't know if they had a NeurIPS paper about this; I was talking to the authors about the NeurIPS competition they were running related to this approach: https://sites.google.com/view/road-r/home
NeurIPS 2023: Day 1
Also as the other comment mentioned, https://positron.ai seems to be live now.
NeurIPS 2023: Expo Day
Open to any feedback/suggestions! Will be adding 4090/H100 shortly.
For a list of cloud GPU providers with rough price comparisons, I created this page: https://cloud-gpus.com
Happy to get any feedback on this!
If you wanted to show different infinities, there might be a way to make Cantor's diagonal argument more accessible to children, to show them countable vs uncountable infinities, but that's a lot less intuitive!
What I mean by a bijection: in your example, you can map the nth dog to the nth paw, and each dog will always have a unique corresponding paw (albeit not its own paw, except for the first dog). Showing them different infinities would mean showing two sets where it's not possible to have this kind of mapping.
For example, an integer numbering to the set of all possible dog names (of unbounded length)
Cloud GPUs: AWS vs. Google vs. Others
How to Win at Kaggle (2022)
An analysis of competitive ML in 2021
Top Cloud GPU Providers for ML (2022)
Source is at https://github.com/mlcontests/mlcontests.github.io, and I'm always happy to accept contributions :)
Show HN: Discover Ongoing ML Competitions
I just linked to it in case someone here had a subscription.