arXiv:2505.18455stat.MLcs.LG2025-05NeurIPS被引 1

研究提示词微调中参数估计的极限性能,揭示知识重叠会导致效果变差。

On Minimax Estimation of Parameters in Softmax-Contaminated Mixture of Experts

  • 提出可区分性概念判断提示词与预训练模型是否能被有效区分
  • 在可区分条件下,达到最优参数估计速率;否则速率显著下降
  • 理论结果解释了微调失败的潜在原因,适合关注模型微调机制的研究者

softmax-污染混合专家(MoE)模型在大型预训练模型基础上添加可训练提示词作为新专家,用于下游任务微调。尽管广泛应用,其统计性质尚未被系统研究。本文分析最大似然估计器在门控和提示参数上的收敛速率,以揭示微调中的统计特性与挑战。我们引入新的可区分性概念,当提示词与预训练模型知识重叠时,参数不可估。在满足可区分性条件下,推导出所有门控和提示参数的极小极大最优估计速率。反之,若可区分性不成立,估计速率显著降低,依赖于提示词收敛至预训练模型的速度。通过多个数值实验验证了理论结果。

原文摘要 · Abstract (English)

The softmax-contaminated mixture of experts (MoE) model is deployed when a large-scale pre-trained model, which plays the role of a fixed expert, is fine-tuned for learning downstream tasks by including a new contamination part, or prompt, functioning as a new, trainable expert. Despite its popularity and relevance, the theoretical properties of the softmax-contaminated MoE have remained unexplored in the literature. In the paper, we study the convergence rates of the maximum likelihood estimator of gating and prompt parameters in order to gain insights into the statistical properties and potential challenges of fine-tuning with a new prompt. We find that the estimability of these parameters is compromised when the prompt acquires overlapping knowledge with the pre-trained model, in the sense that we make precise by formulating a novel analytic notion of distinguishability. Under distinguishability of the pre-trained and prompt models, we derive minimax optimal estimation rates for all the gating and prompt parameters. By contrast, when the distinguishability condition is violated, these estimation rates become significantly slower due to their dependence on the prompt convergence rate to the pre-trained model. Finally, we empirically corroborate our theoretical findings through several numerical experiments.

模型微调混合专家参数估计理论分析

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