Three Meta Papers Show LLMs Struggle at Code Complexity Optimization, and How RL Can Fix It
TimDarcet · x · 2026-09-30
Meta researchers Pierre Chambon and Gabriel Synnaeve summarize their three-paper series on LLMs and code complexity optimization:
- BigO(Bench) (arXiv:2503.15242): a benchmark with 3,105 coding problems and 1.19M annotated solutions, using profiling to infer time/space complexity labels. Evaluations show reasoning models excel at code generation but not complexity understanding, suggesting poor generalization to tasks without training-time reward.
- Paper two: RL on code optimization is hard, and the capability is "embedded in the weight space."
- Paper three: they find a way to make the RL work despite the difficulty.
Together the papers map out both the genuine weakness of current models in algorithmic complexity control and a viable RL training path forward.
More from Research
- Why chirality matters for AI for Science: enantiomers behave differently in biology — madeofAjala · 2026-11-16
- Ropedia Xperience 2 embodied AI dataset lands on Hugging Face under CC BY-NC license — AdinaYakup · 2026-11-16
- RSS 2027 submissions open with FAQ clarifying two-stage review and negative-result bar — GeorgiaChal · 2026-11-16
- Mobile AI Factory: agents auto-build on-device SLMs with 19x less GPU time — pmttyji · 2026-11-16
- Berkeley paper: LLMs answer with stale values even when the update is in context — ombre-ai · 2026-11-16
- LatamGPT releases 178.4M-document open Latin American corpus on Hugging Face — OmarUFlorez · 2026-11-16