Pith. sign in

REVIEW 8 cited by

Counting-Stars: A Multi-evidence, Position-aware, and Scalable Benchmark for Evaluating Long-Context Large Language Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.11802 v5 pith:RNVMWOMW submitted 2024-03-18 cs.CL

classification cs.CL
keywords long-contextcounting-starsllmsmulti-evidencebenchmarkcapabilitiesevaluategemini
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Despite recent efforts to develop large language models with robust long-context capabilities, the lack of long-context benchmarks means that relatively little is known about their performance. To alleviate this gap, in this paper, we propose \textbf{Counting-Stars}, a multi-evidence, position-aware, and scalable benchmark designed to evaluate the multi-evidence retrieval capabilities of long-context LLMs. \textbf{Counting-Stars} comprises two counting-based multiple pieces of evidence retrieval sub-tasks: searching and reasoning. Using Counting-Stars, we conduct experiments to evaluate several long-context LLMs, including GPT-4 Turbo, Gemini 1.5 Pro, Claude3 Opus, GLM-4, and Moonshot-v1. Extensive experimental results demonstrate that Gemini 1.5 Pro achieves the best overall results, while GPT-4 Turbo exhibits the most stable performance across various tasks. Furthermore, our analysis of these LLMs, which have been extended to handle long-context scenarios, indicates that significant room for improvement remains as the length of the input context and the complexity of the tasks increase.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 8 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Ref-Long: Benchmarking the Long-context Referencing Capability of Long-context Language Models

    cs.CL 2025-07 conditional novelty 7.0 of 10

    Ref-Long is a new long-context referencing benchmark on which all 13 tested LCLMs perform poorly, revealing a capability gap that simple retrieval benchmarks miss.

  2. Minerva: A Programmable Memory Test Benchmark for Language Models

    cs.CL 2025-02 conditional novelty 6.0 of 10

    Minerva is a programmable memory-test benchmark showing that LLMs at 4k tokens perform well on search but drop sharply on editing, counting, state tracking, and composite tasks, revealing that retrieval ability does n...

  3. MiMoTable: A Multi-scale Spreadsheet Benchmark with Meta Operations for Table Reasoning

    cs.CL 2024-12 conditional novelty 6.0 of 10

    MiMoTable is a real-world spreadsheet benchmark with 1,719 bilingual question-answer pairs and a meta-operation difficulty criterion on which the best LLM scores 77.4%.

  4. NeMo: Needle in a Montage for Video-Language Understanding

    cs.CV 2025-09 conditional novelty 5.0 of 10

    NeMoBench, an automatically generated benchmark with 31,378 QA pairs, shows that video LLMs struggle with temporal grounding of relevant clips hidden in long montages.

  5. MiniLongBench: The Low-cost Long Context Understanding Benchmark for Large Language Models

    cs.CL 2025-05 conditional novelty 5.0 of 10

    MiniLongBench, a 237-sample compression of LongBench, is claimed to reproduce model rankings with a 0.97 Spearman correlation at 4.5% of the evaluation cost.

  6. 100-LongBench: Are de facto Long-Context Benchmarks Literally Evaluating Long-Context Ability?

    cs.CL 2025-05 conditional novelty 5.0 of 10

    100-LongBench and LongScore evaluate LLMs at controlled context lengths and rank models by relative performance drop from a short-context baseline, not by raw accuracy.

  7. Divide, Optimize, Merge: Fine-Grained LLM Agent Optimization at Scale

    cs.CL 2025-05 conditional novelty 5.0 of 10

    FGO is a divide-and-conquer framework that runs LLM-based agent optimization on dataset subsets and recursively merges the optimized prompts or tool sets into a final agent system.

  8. Federated In-Context LLM Agent Learning

    cs.LG 2024-12 reject novelty 5.0 of 10

    FICAL shares tool-usage text summaries instead of model weights in federated LLM agent learning, reporting similar accuracy with far less communication, but the evidence is incomplete.

Pith tools