arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.01916cs.AI
收藏

针对排序聚合的序贯操纵:理论与算法

Sequential Manipulation Against Rank Aggregation: Theory and Algorithm

School of Electronic, Electrical and Communication Engineering, University of Chinese Academy of Sciences(中国科学院大学电子电气与通信工程学院);Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);School of Computer and Information Engineering, Jiangxi Normal University(江西师范大学计算机与信息工程学院);Tencent Data Platform(腾讯数据平台);School of Cyber Science and Technology, Shenzhen Campus of Sun Yat-sen University(中山大学深圳校区网络空间安全学院);School of Computer Science and Technology, University of Chinese Academy of Sciences(中国科学院大学计算机科学与技术学院)

Ke Ma, Qianqian Xu, Jinshan Zeng, Wei Liu, Xiaochun Cao, Yingfei Sun, Qingming Huang

AI总结:

本文研究成对比较排序聚合的数据收集风险,将在线操纵建模为分布鲁棒博弈,并提出 Bayesian 序贯操纵策略与鲁棒估计器,证明其渐近最优性和实证有效性。

摘要:

基于成对比较的排序聚合广泛存在于社会学、政治学、经济学、心理学、体育等领域。鉴于其巨大的社会影响以及随之而来的激励,潜在对手具有强烈动机操纵排名列表。然而,理想的攻击机会和过强的对抗能力导致现有方法并不实用。为充分挖掘潜在风险,我们利用针对脆弱数据收集过程的在线攻击。由于该过程独立于排序聚合且缺乏有效保护机制,我们在不知道未来数据或真实分布的情况下,通过伪造成对比较来破坏数据收集过程。从博弈论视角出发,在线操纵者与控制原始数据源的排序者之间的对抗场景,被构建为一个处理知识不确定性的分布鲁棒博弈。随后,通过分析 Bernoulli 和蓄水池等采样算法的脆弱性,我们证明上述博弈中的均衡可能有利于对手。基于上述理论分析,在 Bayesian 决策框架和一大类参数化成对比较模型下,提出了不同的序贯操纵策略。对于具备完备知识的攻击者,我们建立了所提策略的渐近最优性。为提高不完备知识下序贯操纵的成功率,一种分布鲁棒估计器在鞍点问题中替代最大似然估计,提供了保守的数据生成解决方案。最后,确凿的实证证据表明,所提方法能够以序贯方式操纵排序聚合方法的结果。

英文摘要:

Rank aggregation with pairwise comparisons is widely encountered in sociology, politics, economics, psychology, sports, etc . Given the enormous social impact and the consequent incentives, the potential adversary has a strong motivation to manipulate the ranking list. However, the ideal attack opportunity and the excessive adversarial capability cause the existing methods to be impractical. To fully explore the potential risks, we leverage an online attack on the vulnerable data collection process. Since it is independent of rank aggregation and lacks effective protection mechanisms, we disrupt the data collection process by fabricating pairwise comparisons without knowledge of the future data or the true distribution. From the game-theoretic perspective, the confrontation scenario between the online manipulator and the ranker who takes control of the original data source is formulated as a distributionally robust game that deals with the uncertainty of knowledge. Then we demonstrate that the equilibrium in the above game is potentially favorable to the adversary by analyzing the vulnerability of the sampling algorithms such as Bernoulli and reservoir methods. According to the above theoretical analysis, different sequential manipulation policies are proposed under a Bayesian decision framework and a large class of parametric pairwise comparison models. For attackers with complete knowledge, we establish the asymptotic optimality of the proposed policies. To increase the success rate of the sequential manipulation with incomplete knowledge, a distributionally robust estimator, which replaces the maximum likelihood estimation in a saddle point problem, provides a conservative data generation solution. Finally, the corroborating empirical evidence shows that the proposed method manipulates the results of rank aggregation methods in a sequential manner.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑