首页> 外文会议>International Conference on Unconventional Computation >Tug-of-War Model for Multi-armed Bandit Problem
【24h】

Tug-of-War Model for Multi-armed Bandit Problem

机译:多武装强盗问题的拔河模型

获取原文

摘要

We propose a model - the "tug-of-war (TOW) model" - to conduct unique parallel searches using many nonlocally correlated search agents. The model is based on the property of a single-celled amoeba, the true slime mold Physarum, which maintains a constant intracellular resource volume while collecting environmental information by concurrently expanding and shrinking its branches. The conservation law entails a "nonlocal correlation" among the branches, i.e., volume increment in one branch is immediately compensated by volume decrement(s) in the other branch(es). This nonlocal correlation was shown to be useful for decision making in the case of a dilemma. The multi-armed bandit problem is to determine the optimal strategy for maximizing the total reward sum with incompatible demands. Our model can efficiently manage this "exploration-exploitation dilemma" and exhibits good performances. The average accuracy rate of our model is higher than those of well-known algorithms such as the modified e-greedy algorithm and modified softmax algorithm.
机译:我们提出了一种模型 - “瓦夫 - 战争(拖曳)模型” - 使用许多非相互关联的搜索代理进行独特的并行搜索。该模型基于单细胞AmoEBA的性质,真正的粘液模具生物体,通过同时扩张和缩小其分支,在收集环境信息的同时保持恒定的细胞内资源体积。保护法在分支中需要“非局部相关性”,即一个分支中的体积增量由另一个分支中的体积减量立即补偿。该非局部相关性被证明是在困境的情况下的决策中有用。多武装强盗问题是确定最佳策略,以最大化具有不兼容的需求的总奖励和。我们的模型可以有效地管理此“勘探开发困境”并表现出良好的表现。我们模型的平均精度率高于众所周知的算法,例如修改的电子贪婪算法和修改的Softmax算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号