SqueezeBench: Saturation-Resilient Evaluation of Mathematical Capability
We present SqueezeBench, a benchmark that is resilient to saturation: a success raises the bar instead of removing the problem.
ProofPaper ↗
Key points
- AI systems are making rapid progress in mathematics, but this progress is hard to measure.
- Each problem fixes an integer function $f(n)$ whose values are known only for small $n$, and the benchmark keeps a lower and an upper record on it.
- A record is a computable Lean function with a machine-checked proof that it bounds $f$.
- We release ten problems from extremal combinatorics with twenty proved initial records and the admission tools.
Sources (1)
- [1]SqueezeBench: Saturation-Resilient Evaluation of Mathematical CapabilityarXiv (AI, ML, NLP, CV, robotics, multi-agent) · Oct 9, 11:59 AM
We present SqueezeBench, a benchmark that is resilient to saturation: a success raises the bar instead of removing the problem.
AI systems are making rapid progress in mathematics, but this progress is hard to measure.
Extractive summary: sentences quoted from the sources.