Q-Learning Algorithms with Random Truncation Bounds and Applications to Effective Parallel Computing
G. Yin (),
C. Z. Xu and
L. Y. Wang
Additional contact information
G. Yin: Wayne State University
C. Z. Xu: Wayne State University
L. Y. Wang: Wayne State University
Journal of Optimization Theory and Applications, 2008, vol. 137, issue 2, No 12, 435-451
Abstract:
Abstract Motivated by an important problem of load balancing in parallel computing, this paper examines a modified algorithm to enhance Q-learning methods, especially in asynchronous recursive procedures for self-adaptive load distribution at run-time. Unlike the existing projection method that utilizes a fixed region, our algorithm employs a sequence of growing truncation bounds to ensure the boundedness of the iterates. Convergence and rates of convergence of the proposed algorithm are established. This class of algorithms has broad applications in signal processing, learning, financial engineering, and other related fields.
Keywords: Q-learning; Recursive algorithms; Convergence; Rate of convergence (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10957-007-9331-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:137:y:2008:i:2:d:10.1007_s10957-007-9331-9
Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2
DOI: 10.1007/s10957-007-9331-9
Access Statistics for this article
Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull
More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().