arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2510.05068cs.ITcs.CRcs.DCcs.NIeess.SPmath.IT
收藏

具备可行集隐私性的多智能体分布式优化

Multi-Agent Distributed Optimization With Feasible Set Privacy

University of Maryland, College Park(马里兰大学帕克分校)

Shreya Meel, Sennur Ulukus

AI总结:

针对多智能体分布式优化中可行集隐私保护需求,提出标称信息泄露下的解集获取方案,在环形和星形网络架构下验证其通信效率优于传统PSI方法。

摘要:

我们研究多智能体$E_1,\ldots,E_N$的去中心化约束优化问题:这些智能体希望联合学习最优解集,同时对彼此保密各自的可行集$\mathcal{P}_1,\ldots,\mathcal{P}_N$。我们假设目标函数$f$为所有智能体已知,且每个可行集均由通用字母表$\mathcal{P}_{alph}$中的点构成。一个指定智能体(领导者)发起与其余(非领导者)智能体的通信,且是首个获取解集的智能体。领导者通过向非领导者发送查询并接收答复来搜索解,使得领导者获知的各可行集信息不超过标称泄露量,即仅通过学习解集本身所泄露的信息量。我们提出了能实现标称信息泄露下解集获取的可实现方案,并刻画了两种智能体间通信架构下方案的通信开销。本研究聚焦两类网络架构:i)环形架构,每个智能体与两个相邻智能体通信;ii)星形架构,仅领导者与其余智能体通信。我们证明,若领导者先通过现有的隐私集合求交(PSI,Private Set Intersection)协议得到联合可行集,再推导解集,则领导者获取的信息量会高于标称泄露量。此外,我们建立了所提方案与阈值隐私集合求交(ThPSI,threshold PSI)的关联——ThPSI是PSI的一种变体,仅当交集的基数大于阈值时才会揭示交集。最后,对于被均匀随机映射到固定取值范围的各类$f$的实现,与通过PSI获取整个可行集的方式相比,我们的方案以高概率具备更高的通信效率。

英文摘要:

We consider the problem of decentralized constrained optimization with multiple agents $E_1,\ldots,E_N$ who jointly wish to learn the optimal solution set while keeping their feasible sets $\mathcal{P}_1,\ldots,\mathcal{P}_N$ private from each other. We assume that the objective function $f$ is known to all agents and each feasible set is a collection of points from a universal alphabet $\mathcal{P}_{alph}$. A designated agent (leader) starts the communication with the remaining (non-leader) agents, and is the first to retrieve the solution set. The leader searches for the solution by sending queries to and receiving answers from the non-leaders, such that the information on the individual feasible sets revealed to the leader should be no more than nominal, i.e., what is revealed from learning the solution set alone. We develop achievable schemes for obtaining the solution set at nominal information leakage, and characterize their communication costs under two communication setups between agents. In this work, we focus on two kinds of network setups: i) ring, where each agent communicates with two adjacent agents, and ii) star, where only the leader communicates with the remaining agents. We show that, if the leader first learns the joint feasible set through an existing private set intersection (PSI) protocol and then deduces the solution set, the information leaked to the leader is greater than nominal. Moreover, we draw connection of our schemes to threshold PSI (ThPSI), which is a PSI-variant where the intersection is revealed only when its cardinality is larger than a threshold value. Finally, for various realizations of $f$ mapped uniformly at random to a fixed range of values, our schemes are more communication-efficient with a high probability compared to retrieving the entire feasible set through PSI.

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

↑