arXiv:2410.04808cs.CL2024-10EMNLP被引 11

自动设计语言模型零成本代理,提升搜索效率与准确性

LPZero: Language Model Zero-cost Proxy Search from Zero

  • 用符号方程建模代理,通过遗传编程搜索最优组合
  • 在三个大模型上排名一致性超越人工设计代理
  • 适合需要高效架构搜索的NLP研究者和工程师

尽管神经网络架构搜索(NAS)表现优异,但其计算开销巨大。零样本NAS通过零成本(ZC)代理显著降低计算需求,但现有代理依赖专家知识,试错成本高。尤其在自然语言处理任务中,多数现有代理性能未超过基线。为此,我们提出首个可自动设计ZC代理的框架LPZero,实现了比人工设计代理更高的排名一致性。具体地,将ZC代理建模为符号方程,构建统一代理搜索空间,包含预定义数学符号集合。通过遗传编程启发式搜索最优符号组合,并提出基于规则的剪枝策略(RPS),提前剔除低效代理,防止性能退化。在FlexiBERT、GPT-2和LLaMA-7B上的实验表明,LPZero在下游任务中的排名能力与性能均优于现有方法。

原文摘要 · Abstract (English)

In spite of the outstanding performance, Neural Architecture Search (NAS) is criticized for massive computation. Recently, Zero-shot NAS has emerged as a promising approach by exploiting Zero-cost (ZC) proxies, which markedly reduce computational demands. Despite this, existing ZC proxies heavily rely on expert knowledge and incur significant trial-and-error costs. Particularly in NLP tasks, most existing ZC proxies fail to surpass the performance of the naive baseline. To address these challenges, we introduce a novel framework, \textbf{LPZero}, which is the first to automatically design ZC proxies for various tasks, achieving higher ranking consistency than human-designed proxies. Specifically, we model the ZC proxy as a symbolic equation and incorporate a unified proxy search space that encompasses existing ZC proxies, which are composed of a predefined set of mathematical symbols. To heuristically search for the best ZC proxy, LPZero incorporates genetic programming to find the optimal symbolic composition. We propose a \textit{Rule-based Pruning Strategy (RPS),} which preemptively eliminates unpromising proxies, thereby mitigating the risk of proxy degradation. Extensive experiments on FlexiBERT, GPT-2, and LLaMA-7B demonstrate LPZero's superior ranking ability and performance on downstream tasks compared to current approaches.

架构搜索零成本代理遗传编程NLP

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