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(中国科学院大学计算机科学与技术学院)
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.
Consensus in Motion: A Case of Dynamic Rationality of Sequential Learning in Probability Aggregation
1 Department of Statistics, Ludwig-Maximilians-Universität München\ 2 School of Computing \& Communication, Lancaster University Leipzig \ 3 Munich Center for Mathematical Philosophy, Ludwig-Maximilians-Universität München Correspondence
LEMMo-Plan: LLM-Enhanced Learning from Multi-Modal Demonstration for Planning Sequential Contact-Rich Manipulation Tasks
School of Computation, Information and Technology, Technical University of Munich(慕尼黑工业大学计算、信息与技术学院);Aalto University(阿尔托大学);Nanjing University (Suzhou Campus)(南京大学苏州校区);Mohamed Bin Zayed University of Artificial Intelligence(穆罕默德·本·扎耶德人工智能大学)
Relay Hindsight Experience Replay: Self-Guided Continual Reinforcement Learning for Sequential Object Manipulation Tasks with Sparse Rewards
Institute of Intelligent Machines, Hefei Institutes of Physical Science, Chinese Academy of Sciences(中国科学院合肥物质科学研究院智能机械研究所);University of Science and Technology of China(中国科学技术大学)
FedVLA: Federated Vision-Language-Action Learning with Dual Gating Mixture-of-Experts for Robotic Manipulation
National University of Defense Technology(国防科技大学);Bytedance Seed(字节跳动 Seed);Shenzhen MSU-BIT University(深圳北理莫斯科大学);Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ)(广东人工智能与数字经济实验室(深圳))
Measuring and Controlling Divisiveness in Rank Aggregation
IRIT, Université Toulouse Capitole(图卢兹第一大学IRIT研究所);Center for Collective Learning, ANITI, TSE, IAST, IRIT, Université de Toulouse(图卢兹大学集体学习中心(ANITI、TSE、IAST、IRIT));Alliance Manchester Business School, University of Manchester(曼彻斯特大学联盟曼彻斯特商学院);Center for Collective Learning, CIAS, Corvinus University(考文纽斯大学CIAS集体学习中心)