browsecomp-plus-mini: 15 of BrowseComp-Plus's 830 queries that rank deep-research agents roughly like the full set, no LLM judge
I needed a cheap way to compare search agents on BrowseComp-Plus without burning hours of agent time every run.
Proof1 community thread
Key points
- So I built a 15-query subset of the full 830 that ranks systems roughly the way the full benchmark does.
- weighted Spearman rank agreement 0.88 averaged over 30 splits, versus 0.75 for a random 15
- two runs more than 10 points apart on the full benchmark keep their order about 96% of the time; 5 to 10 points apart, about 75%
- all answers are 1-4 words, so it grades by normalized exact match, no LLM judge
Sources (1)
- [1]browsecomp-plus-mini: 15 of BrowseComp-Plus's 830 queries that rank deep-research agents roughly like the full set, no LLM judger/LocalLLaMA (top, daily) · Oct 18, 02:30 PM
I needed a cheap way to compare search agents on BrowseComp-Plus without burning hours of agent time every run.
So I built a 15-query subset of the full 830 that ranks systems roughly the way the full benchmark does.
Extractive summary: sentences quoted from the sources.
Before this
- Oct 17, 2026deepseek-ai/DeepSeek-V4.1-Flash-1017
- Oct 17, 2026Nemotron 3.5 Bolt, Muse Spark Open, and a Fast LFM2.5 24B
- Oct 15, 2026nvidia/Nemotron-3.5-Embed-1B-BF16 · Hugging Face
- Oct 15, 2026open source framework that makes your AI agents generate UI elements
- Oct 15, 2026Granite Switch 4.1: Chat, Decisions, and Speech from One Endpoint
- Oct 15, 2026NVIDIA Nemotron 3.5 Super VL Powers Specialized Agents with Multimodal Reasoning