解决移动端众包中工人谎报偏好导致模型偏差的问题
Truthful Online Preference Aggregation for LLM Fine-Tuning in Mobile Crowdsourcing

- 设计动态加权机制,根据反馈准确率实时调整工人工分
- 理论证明可实现次线性误差增长,比现有方法快一个数量级
- 适合需要高可信度在线反馈的智能导航等移动应用
为更好满足移动应用(如导航)的用户需求,移动众包平台可通过迭代收集众包工人对大语言模型生成内容(如交通状况预测)的反馈来优化模型。然而,工人可能出于提高影响力或收入的目的,故意歪曲在线偏好反馈。现有基于期望最大化(EM)的权重估计方法无法在在线场景中识别最准确的工人,导致在T个时间槽内产生线性误差$/mathcal{O}(T)$。本文研究移动端众包中用于大模型微调的可信在线偏好聚合问题,构建新的动态贝叶斯博弈模型,刻画平台与策略性移动工人间的多智能体在线学习过程。提出一种新型在线加权聚合机制,根据工人反馈准确性动态调整其权重。理论上证明该机制能激励工人诚实反馈,并在T个时间槽内实现次线性误差$/mathcal{O}(ackslashsqrt{T})$。进一步扩展至每轮反馈受限的场景,仍保证$/mathcal{O}(ackslashsqrt{T})$的次线性误差。在真实世界数据集上的实验表明,该机制在大模型微调任务中显著优于基线方案。
原文摘要 · Abstract (English)
To better serve users' demands in mobile applications (e.g., navigation), mobile crowdsourcing platforms can iteratively align large language model (LLM)-generated content (e.g., AI-generated traffic condition predictions) with human feedback collected from crowdsourcing workers (e.g., mobile users). However, workers may strategically misreport their online preference feedback to maximize their influence or payment. Existing pipelines in mobile crowdsourcing (e.g., EM-based weight estimation) fail to identify the most accurate worker in this online setting, resulting in a linear regret $\mathcal{O}(T)$ over $T$ time slots. In this paper, we study truthful online preference aggregation for LLM fine-tuning in mobile crowdsourcing. We formulate a new dynamic Bayesian game to model the multi-agent online learning process between the platform and strategic mobile workers. We propose a novel online weighted aggregation mechanism that dynamically adjusts each worker's weight in the preference aggregation according to their feedback accuracy. We prove that our mechanism ensures truthful feedback from strategic workers and achieves a sublinear regret $\mathcal{O}(\sqrt{T})$ over $T$ time slots. We further extend our mechanism to a challenging scenario with limited worker feedback per time slot, still guaranteeing a sublinear regret $\mathcal{O}(\sqrt{T})$. Experiments on LLM fine-tuning with real-world datasets further demonstrate significant performance gains of our mechanisms over benchmark schemes.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。