No confident code implementation found for this paper. 4 possible matches can be shown below.
No confident code match yet
We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 4 weaker matches are hidden by default — verify before relying on them.
No code implementations found yet.
Know of an implementation? Let us know in the comments below!
Two Sparse Matrices are Better than One: Sparsifying Neural Networks with Double Sparse Factorization
Position: Spectral GNNs Rely Less on Graph Fourier Basis than Conceived
Filtered not Mixed: Filtering-Based Online Gating for Mixture of Large Language Models
Position: Social Environment Design Should be Further Developed for AI-based Policy-Making
Two Heads are Better Than One: A Simple Exploration Framework for Efficient Multi-Agent Reinforcement Learning
𝒩-WL: A New Hierarchy of Expressivity for Graph Neural Networks
@article{snell2026scaling,
title = {Scaling LLM Test-Time Compute Optimally Can be More Effective than Scaling Parameters for Reasoning},
author = {C. Snell and Jaehoon Lee and Kelvin Xu and Aviral Kumar},
year = {2026},
url = {https://api.semanticscholar.org/CorpusID:3eb116c1934dcff731a6d68a8e64115f6c00b369},
journal = {ICLR 2025 2025}
}Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/3eb116c1934dcff731a6d68a8e64115f6c00b369)