التفاصيل البيبلوغرافية
| العنوان: |
Byzantine-Resilient Decentralized Policy Evaluation With Linear Function Approximation. |
| المؤلفون: |
Wu, Zhaoxian1 (AUTHOR) wuzhx23@mail2.sysu.edu.cn, Shen, Han2 (AUTHOR) shenh5@rpi.edu, Chen, Tianyi2 (AUTHOR) chentianyi19@gmail.com, Ling, Qing1 (AUTHOR) lingqing556@mail.sysu.edu.cn |
| المصدر: |
IEEE Transactions on Signal Processing. 11/15/2021, p3839-3853. 15p. |
| مصطلحات موضوعية: |
*ALGORITHMS, *TASK analysis, REINFORCEMENT learning, APPROXIMATION algorithms, SIGNAL processing |
| مستخلص: |
In this paper, we consider the policy evaluation problem in reinforcement learning with agents on a decentralized and directed network. In order to evaluate the quality of a fixed policy in this decentralized setting, one option is for agents to run decentralized temporal-difference (TD) collaboratively. To account for the practical scenarios where the state and action spaces are large and malicious attacks emerge, we focus on the decentralized TD learning with linear function approximation in the presence of malicious agents (often termed as Byzantine agents). We propose a trimmed mean-based Byzantine-resilient decentralized TD algorithm to perform policy evaluation in this setting. We establish the finite-time convergence rate, as well as the asymptotic learning error that depends on the number of Byzantine agents. Numerical experiments corroborate the robustness of the proposed algorithm. [ABSTRACT FROM AUTHOR] |
|
Copyright of IEEE Transactions on Signal Processing is the property of IEEE and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Business Source Index |
