UQ: Assessing Language Models on Unsolved Questions
Not on the map. Why?
Abstract (arXiv)
Benchmarks shape progress in AI research. A useful benchmark should be both difficult and realistic: questions should challenge frontier models while also reflecting real-world usage. Yet, current paradigms face a difficulty-realism tension: exam-style benchmarks are often made artificially difficult with limited real-world value, while benchmarks based on real user interaction often skew toward easy, high-frequency problems. In this work, we explore a radically different paradigm: assessing models on unsolved questions. Rather than a static benchmark scored once, we curate unsolved questions and evaluate models asynchronously over time with validator-assisted screening and community verification. We introduce UQ, a testbed of 500 challenging, diverse questions sourced from Stack Exchange, spanning topics from CS theory and math to sci-fi and history, probing capabilities including reasoning, factuality, and browsing. UQ is difficult and realistic by construction: unsolved questions are often hard and naturally arise when humans seek answers, thus solving them yields direct real-world value. Our contributions are threefold: (1) UQ-Dataset and its collection pipeline combining rule-based filters, LLM judges, and human review to ensure question quality (e.g., well-defined and difficult); (2) UQ-Validators, compound validation strategies that leverage the generator-validator gap to provide evaluation signals and pre-screen candidate solutions for human review; and (3) UQ-Platform, an open platform where experts collectively verify questions and solutions. The top model passes UQ-validation on only 15% of questions, and preliminary human verification has already identified correct answers among those that passed. UQ charts a path for evaluating frontier models on real-world, open-ended challenges, where success pushes the frontier of human knowledge. We release UQ at https://uq.stanford.edu.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 25 Aug 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2025: 3; 2026: 6.
9 papers.
- 2026Towards Autonomous Mathematics Researchcited by 40
- 2025IMProofBench: Benchmarking AI on Research-Level Mathematical Proof Generationcited by 13
- 2025LiveTradeBench: Seeking Real-World Alpha with Large Language Modelscited by 13
- 2025MATH-Beyond: A Benchmark for RL to Expand Beyond the Base Modelcited by 10
- 2026MathNet: a Global Multimodal Benchmark for Mathematical Reasoning and Retrievalcited by 6
- 2026Quantifying the Effect of Test Set Contamination on Generative Evaluationscited by 2
- 2026Self-Verified Distillation: Your Language Model Is Secretly Its Own Synthetic Data Pipelinecited by 2
- 2026Judging What We Cannot Solve: A Consequence-Based Approach for Oracle-Free Evaluation of Research-Level Mathcited by 1
- 2026OpenProblemBench: Benchmarking AI on Open Problems in the Foundational Theoretical Sciencescited by 0
- 2026OpenProblemBench: Benchmarking AI on Open Problems in the Foundational Theoretical Sciences8 Oct 2026
- 2026Self-Verified Distillation: Your Language Model Is Secretly Its Own Synthetic Data Pipeline20 May 2026
- 2026MathNet: a Global Multimodal Benchmark for Mathematical Reasoning and Retrieval20 Apr 2026
- 2026Towards Autonomous Mathematics Research10 Feb 2026
- 2026Judging What We Cannot Solve: A Consequence-Based Approach for Oracle-Free Evaluation of Research-Level Math6 Feb 2026
- 2026Quantifying the Effect of Test Set Contamination on Generative Evaluations7 Jan 2026
- 2025LiveTradeBench: Seeking Real-World Alpha with Large Language Models5 Nov 2025
- 2025MATH-Beyond: A Benchmark for RL to Expand Beyond the Base Model13 Oct 2025
- 2025IMProofBench: Benchmarking AI on Research-Level Mathematical Proof Generation30 Sep 2025