Hugging Face Revives PapersWithCode After Meta Let It Go Unmaintained
Original: Reviving PapersWithCode: Hugging Face Steps In After Meta Abandoned the Site View original →
A Beloved Resource Returns
PapersWithCode was the go-to resource for machine learning researchers: a hub connecting papers to code implementations, tracking state-of-the-art results, and maintaining benchmark leaderboards. After Meta acquired it, the site stagnated — no new papers, outdated leaderboards, and growing community frustration.
Hugging Face Steps In
Niels from Hugging Face's open-source team has launched paperswithcode.co as a community-driven revival. The new site uses AI agents to parse papers at scale and automatically generate leaderboards, currently focused on high-impact papers like Qwen 3.5/3.6, RF-DETR, DINOv3, and top embedding models from the MTEB leaderboard.
New and Improved Features
The revived site includes trending papers ranked by GitHub star velocity, domain categorization (OCR, object detection, ASR, etc.), a methods section (covering techniques like RLVR), per-benchmark leaderboards (MMTEB, COCO val2017), citation count sorting, and support for papers hosted outside arXiv.
The announcement on r/MachineLearning received 330+ upvotes, with the community expressing relief that this critical infrastructure is being maintained again — this time by an organization with strong alignment to the open-source ML ecosystem.
Related Articles
AdaJEPA targets a practical weakness in robot and agent planning: frozen world models drift under distribution shift. The method updates during MPC with one gradient step per replan and a buffer of five recent transitions.
Among timestamp-verified r/MachineLearning posts, MIRA stood out for using fast multiplayer game dynamics as the research target.
A Hacker News post on March 19, 2026 drew attention to agent-sat, an open-source project that lets AI agents iteratively improve weighted MaxSAT strategies. The repository says it has solved 220 of 229 instances from the 2024 MaxSAT Evaluation, beaten competition-best results on five instances, and produced one novel solve.