arXiv:2502.17262cs.CLcs.AI2025-02中稿 · The Fourteenth Int…被引 11

通过聚类任务难度,提升大模型下游性能预测精度

Unveiling Downstream Performance Scaling of LLMs: A Clustering-Based Perspective

  • 按任务难度聚类,构建稳定可预测的子集
  • 70B模型在8个基准上平均误差仅1.55%
  • 适合关注模型训练效率与资源分配的研究者

大语言模型(LLM)训练规模和成本持续攀升,亟需准确预测预训练后下游任务表现以理解其缩放规律。当前方法面临两大挑战:1)能力涌现现象,即关键模型规模下突然出现不可预测的能力;2)任务难度不均与性能缩放模式不一致,导致指标波动大。现有预测方法准确性与可靠性不足。本文提出基于难度聚类的COD框架,通过识别任务难度缩放特征进行聚类,构建具有稳定缩放特性的子集。采用性能缩放定律对簇内表现进行理论预测,子集表现作为全集评估的中间预测器,并推导映射函数将子集性能精确外推至全集。应用于700亿参数模型时,COD在8个关键基准上实现1.55%的平均预测误差,为模型缩放特性分析与训练监控提供可操作洞见。

原文摘要 · Abstract (English)

The escalating scale and cost of Large Language Models (LLMs) training necessitate accurate pre-training prediction of downstream task performance for comprehensive understanding of scaling properties. This is challenged by: 1) the emergence phenomenon, where unpredictable capabilities appearing suddenly at critical model scales; and 2) uneven task difficulty and inconsistent performance scaling patterns, leading to high metric variability. Current prediction methods lack accuracy and reliability. We propose a Clustering-On-Difficulty (COD) framework for downstream performance prediction. The COD framework clusters tasks by their difficulty scaling features, thereby constructing a more stable and predictable task subset that exhibits well-behaved scaling characteristics with the increase of compute budget. We adopt a performance scaling law to predict cluster-wise performance with theoretical support. Predictable subset performance acts as an intermediate predictor for the full evaluation set. We further derive a mapping function to accurately extrapolate the performance of the subset to the full set. Applied to an LLM with 70B parameters, COD achieved a 1.55\% average prediction error across eight key LLM benchmarks, thus providing actionable insights for scaling properties and training monitoring during LLM pre-training.

大模型性能预测聚类缩放规律

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。