Attritable Multi-Agent Learning

被引:0
作者
Cybenko, George [1 ]
Hallman, Roger [1 ,2 ]
机构
[1] Dartmouth Coll, Thayer Sch Engn, Hanover, NH 03753 USA
[2] Naval Informat Warfare Ctr NIWC Pacific, San Diego, CA 92152 USA
来源
DISRUPTIVE TECHNOLOGIES IN INFORMATION SCIENCES V | 2021年 / 11751卷
关键词
Machine learning; mosaic warfare; multi-agent systems; attrition; blockchain;
D O I
10.1117/12.2588607
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Autonomous systems will operate in highly contested environments in which it must be assumed that adversaries are equally capable, agile and informed. To achieve and sustain dominant performance in such environments, autonomous systems must be able to adapt through online machine learning while managing and tolerating attrition - that is, improve their performance quickly, even over the duration of a single engagement with principled asset losses. However, there are novel challenges to adapting effectively in such environments. We present an approach that leverages several recent innovations in reinforcement learning, distributed computing and trusted consensus algorithms such as Blockchain. We note that multi-agent systems operating in contested environments must leverage their redundancy for learning while also remaining resilient with respect to component failures and com- promises. In particular, to enable and accelerate learning, such systems will have to allow some number of components to operate sub-optimally to achieve the right exploration-exploitation balance needed for rapid and effective learning. At the same time that some number of components are possibly being sacrificed due to sub-optimal performance, the underlying mission of the system must be maintained. This leads to challenges in distributed trusted computing such as Byzantine agreement problems. Simulations demonstrating these various tradeoffs using epidemiological models are presented.
引用
收藏
页数:6
相关论文
共 15 条
[1]  
ANDERSON R M, 1991
[2]  
Auer P., 2003, Journal of Machine Learning Research, V3, P397, DOI 10.1162/153244303321897663
[3]  
Boyd J.R., 1987, A Discourse on Winning and Losing
[4]  
Brose C, 2019, FOREIGN AFF, V98, P122
[5]  
Campbell A. M., 2018, THESIS MIT
[6]   On the impossibility of predicting the behavior of rational agents [J].
Foster, DP ;
Young, HP .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2001, 98 (22) :12848-12853
[7]  
Gaul A., 2019, ARXIV PREPRINT ARXIV
[8]  
Grayson T., 2018, MOS WARF MULT BATTL
[9]  
Groce A, 2012, LECT NOTES COMPUT SC, V7392, P561, DOI 10.1007/978-3-642-31585-5_50
[10]   Flexible Byzantine Fault Tolerance [J].
Malkhi, Dahlia ;
Nayak, Kartik ;
Ren, Ling .
PROCEEDINGS OF THE 2019 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'19), 2019, :1041-1053