paper-with-me

홈 › Papers

OKBench: Democratizing LLM Evaluation with Fully Automated, On-Demand, Open Knowledge Benchmarking

2025-10-31 · Yanhong Li, Tianyang Xu, Kenan Tang, Karen Livescu, David McAllester, Jiawei Zhou arxiv

Knowledge-intensive question answering is central to large language models (LLMs) and is typically assessed using static benchmarks derived from sources like Wikipedia and textbooks. However, these benchmarks fail to capture evolving knowledge in a dynamic world, and centralized curation struggles to keep pace with rapid LLM advancements. To address these drawbacks, we propose Open Knowledge Bench (OKBench), a fully automated framework for generating high-quality, dynamic knowledge benchmarks on demand. Focusing on the news domain where knowledge updates daily, OKBench is an agentic framework that automates the sourcing, creation, validation, and distribution of benchmarks. Our approach democratizes benchmark creation and facilitates thorough evaluation of retrieval-augmented methods by reducing overlap with pretraining data. We evaluate our framework on a wide range open-source and proprietary LLMs of various sizes and configurations, both with and without retrieval over freshly generated knowledge. Our results reveal distinct model behaviors when confronted with new information and highlight how retrieval narrows the performance gap between small and large models. These findings underscore the importance of evaluating LLMs on evolving knowledge benchmarks.

📄 PDF Abstract BibTeX arXiv:2511.08598

Code (0)

등록된 구현이 없습니다.

Tasks

Question Answering

Similar Papers 제목 키워드 기반

LookBench: A Live and Holistic Open Benchmark for Fashion Image Retrieval

2026-01-21 · Gensmo. ai, Chao Gao, Siqiao Xue, Jiwen Fu 외 arxiv

In this paper, we present LookBench (We use the term "look" to reflect retrieval that mirrors how people shop -- finding the exact item, a close substitute, or a visually consistent alternative.), a live, holistic and ch…

Image Retrieval

AutoOptLib: Tailoring Metaheuristic Optimizers via Automated Algorithm Design

2023-03-12 · Qi Zhao, Bai Yan, Taiwei Hu, Xianglong Chen 외

Metaheuristics are prominent gradient-free optimizers for solving hard problems that do not meet the rigorous mathematical assumptions of analytical solvers. The canonical manual optimizer design could be laborious, untr…

Metaheuristic Optimization

Grammars of Formal Uncertainty: When to Trust LLMs in Automated Reasoning Tasks

2025-05-26 · Debargha Ganguly, Vikash Singh, Sreehari Sankar, Biyao Zhang 외

Large language models (LLMs) show remarkable promise for democratizing automated reasoning by generating formal specifications. However, a fundamental tension exists: LLMs are probabilistic, while formal verification dem…

Uncertainty Quantification

CookBench: A Long-Horizon Embodied Planning Benchmark for Complex Cooking Scenarios

2025-08-05 · Muzhen Cai, Xiubo Chen, Yining An, Jiaxin Zhang 외 arxiv

Embodied Planning is dedicated to the goal of creating agents capable of executing long-horizon tasks in complex physical worlds. However, existing embodied planning benchmarks frequently feature short-horizon tasks and …

Legal Extractive Summarization of U.S. Court Opinions

2023-05-15 · Emmanuel Bauer, Dominik Stammbach, Nianlong Gu, Elliott Ash

This paper tackles the task of legal extractive summarization using a dataset of 430K U.S. court opinions with key passages annotated. According to automated summary quality metrics, the reinforcement-learning-based MemS…

Extractive Summarizationreinforcement-learning