arXivDaily arXiv每日学术速递 周一至周五更新
看起来今天可以划水了
arXiv 2011.04686eess.SYcs.LGcs.SYmath.OC
收藏

线性二次平均场群的Thompson抽样

Thompson sampling for linear quadratic mean-field teams

USC(南加州大学);McGill(麦吉尔大学);Preferred Networks

Mukul Gagrani, Sagar Sudhakara, Aditya Mahajan, Ashutosh Nayyar, Yi Ouyang

摘要:

我们考虑未知多智能体线性二次(LQ)系统的最优控制,其中动态和成本通过平均场(即,经验平均值)的状态和控制。在这种模型中直接使用单智能体LQ学习算法会导致后悔,后悔随着智能体的数量呈多项式增加。我们提出了一个新的汤普森采样为基础的学习算法,利用系统模型的结构,并表明我们提出的算法的预期贝叶斯遗憾的系统与代理的$|M|$不同类型的时间范围$T$是$\tilde{\mathcal{O}} \big( |M|^{1.5} \sqrt{T} \big)$,无论代理的总数,其中$\tilde{\mathcal{O}}$符号隐藏在$T$的对数因子。我们提出了详细的数值实验来说明所提出的算法的显着特点。

英文摘要:

We consider optimal control of an unknown multi-agent linear quadratic (LQ) system where the dynamics and the cost are coupled across the agents through the mean-field (i.e., empirical mean) of the states and controls. Directly using single-agent LQ learning algorithms in such models results in regret which increases polynomially with the number of agents. We propose a new Thompson sampling based learning algorithm which exploits the structure of the system model and show that the expected Bayesian regret of our proposed algorithm for a system with agents of $|M|$ different types at time horizon $T$ is $\tilde{\mathcal{O}} \big( |M|^{1.5} \sqrt{T} \big)$ irrespective of the total number of agents, where the $\tilde{\mathcal{O}}$ notation hides logarithmic factors in $T$. We present detailed numerical experiments to illustrate the salient features of the proposed algorithm.

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

↑