๐Ÿ“„Stalecollected in 17h

LLM-WikiRace Reveals LLM Planning Limits

LLM-WikiRace Reveals LLM Planning Limits
PostLinkedIn
๐Ÿ“„Read original on ArXiv AI
#benchmark#planning#reasoning#knowledge-graphsllm-wikirace

๐Ÿ’กNew benchmark shows even Gemini-3/GPT-5 fail 77% on hard LLM planning tasks

โšก 30-Second TL;DR

What Changed

Introduces Wikipedia hyperlink navigation task for LLM planning

Why It Matters

This benchmark exposes critical gaps in frontier LLMs' reasoning, pushing development toward better long-horizon planning. It provides a simple, reproducible testbed for improving agentic capabilities in real-world knowledge navigation.

What To Do Next

Visit https://llmwikirace.github.io to download code and benchmark your LLM on hard levels.

Who should care:Researchers & Academics

Key Points

  • โ€ขIntroduces Wikipedia hyperlink navigation task for LLM planning
  • โ€ขGemini-3 leads at 23% on hard levels, superhuman on easy
  • โ€ขWorld knowledge essential but long-horizon planning dominant
  • โ€ขTop models loop instead of replanning after failures
  • โ€ขOpen code and leaderboard at llmwikirace.github.io

๐Ÿง  Deep Insight

Background and context from public sources โ€” not the original article. 2 sources cited.

๐Ÿ”‘ Enhanced Key Takeaways

  • โ€ขLLM-WikiRace benchmarks LLMs on navigating Wikipedia hyperlinks from source to target pages, stratifying tasks into easy, medium, and hard splits based on shortest-path length[1][2].
  • โ€ขFrontier models like Gemini-3, GPT-5, and Claude Opus 4.5 achieve over 90% success on easy levels (superhuman performance) but drop to 23% for Gemini-3 on hard levels[1][2].
  • โ€ขWorld knowledge is essential up to a threshold, after which long-horizon planning and reasoning dominate performance[1][2].
  • โ€ขTop models fail to replan after errors, often entering loops instead of recovering[1][2].
  • โ€ขMetrics include success rate, suboptimal steps (excess beyond shortest path), and average cost (tokens and monetary for closed models); step limit is 30, providing 3x budget over optimal paths up to 8 steps[1].
๐Ÿ“Š Competitor Analysisโ–ธ Show
FeatureLLM-WikiRaceOther Benchmarks
TaskWikipedia hyperlink navigation for planning/reasoningVaries (e.g., multi-modal in others)
Difficulty SplitsEasy (>90% success), Medium (50-70%), Hard (<25%)Not specified
MetricsSuccess rate, suboptimal steps, avg costVaries
Frontier Model Hard SuccessGemini-3: 23%N/A (isolates textual planning)

๐Ÿ› ๏ธ Technical Deep Dive

  • โ€ขTask requires step-by-step hyperlink navigation with 30-step limit (plateaus beyond; longest optimal path is 8 steps)[1].
  • โ€ขAlgorithm detailed in Appendix B; evaluates full episodes including failures[1].
  • โ€ขFine-tuning improves easy split (22.5% to 67.5% after 300 steps), modest on medium (1.3% to 4.6%), none on hard (0%)[1].
  • โ€ขOpen code and leaderboard at llmwikirace.github.io[1][2].
  • โ€ขSubjects: Artificial Intelligence (cs.AI), Machine Learning (cs.LG)[2].

๐Ÿ”ฎ Future ImplicationsAI analysis grounded in cited sources

Highlights persistent gaps in long-horizon planning for frontier LLMs, emphasizing need for better replanning and recovery mechanisms; serves as open benchmark to drive progress in reasoning systems beyond world knowledge reliance.

โณ Timeline

2026-02
LLM-WikiRace paper released on arXiv (2602.16902v1), introducing benchmark with results on Gemini-3, GPT-5, Claude Opus 4.5

๐Ÿ“Ž Sources (2)

Factual claims are grounded in the sources below. Forward-looking analysis is AI-generated interpretation.

  1. arXiv โ€” 2602
  2. arXiv โ€” 2602
๐Ÿ“ฐ

Weekly AI Recap

Read this week's curated digest of top AI events โ†’

๐Ÿ‘‰Related Updates

AI-curated news aggregator. All content rights belong to original publishers.
Original source: ArXiv AI โ†—

This is a summary, not the original. Read the source, or get the weekly briefing.

Weekly AI briefing

One email a week. Unsubscribe anytime.