Pith. sign in

REVIEW 1 cited by

NeurIPS 2023 LLM Efficiency Fine-tuning Competition

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 2503.13507 v1 pith:PUMWVH5Z submitted 2025-03-13 cs.CL cs.AI

classification cs.CLcs.AI
keywords evaluationcompetitionfine-tuningoverfittingbenchmarkcurationdatallms
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Our analysis of the NeurIPS 2023 large language model (LLM) fine-tuning competition revealed the following trend: top-performing models exhibit significant overfitting on benchmark datasets, mirroring the broader issue of benchmark overfitting on popular leaderboards and that data curation is essential in order to get a high performing LLM. The competition, which consisted of two stages - an open evaluation stage with publicly available tasks and a closed evaluation stage with unseen tasks - allowed us to assess the generalizability of fine-tuned LLMs. Our results highlight the limitations of current benchmark-based evaluation schemes for generative models and demonstrate the need for more robust evaluation methods. Notably, the winning submissions utilized standard open-source libraries and focused primarily on data curation. To facilitate further research and promote reproducibility, we release all competition entries, Docker files, and evaluation infrastructure, providing a valuable resource for the community to explore fine-tuning, overfitting, and reproducibility in LLMs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Evaluating the Unseen Capabilities: How Many Theorems Do LLMs Know?

    cs.CL 2025-06 conditional novelty 6.0 of 10

    KnowSum extrapolates from observed LLM outputs to estimate unseen knowledge, and counting that hidden knowledge shifts model rankings in several evaluation tasks.

Pith tools