{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T05:56:22Z","timestamp":1712469382199},"reference-count":21,"publisher":"Cambridge University Press (CUP)","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Appl. Probab."],"published-print":{"date-parts":[[2012,9]]},"abstract":"<jats:p>Estimator algorithms in learning automata are useful tools for adaptive, real-time optimization in computer science and engineering applications. In this paper we investigate theoretical convergence properties for a special case of estimator algorithms - the pursuit learning algorithm. We identify and fill a gap in existing proofs of probabilistic convergence for pursuit learning. It is tradition to take the pursuit learning tuning parameter to be fixed in practical applications, but our proof sheds light on the importance of a vanishing sequence of tuning parameters in a theoretical convergence analysis.<\/jats:p>","DOI":"10.1017\/s0021900200009542","type":"journal-article","created":{"date-parts":[[2016,3,29]],"date-time":"2016-03-29T14:49:44Z","timestamp":1459262984000},"page":"795-805","source":"Crossref","is-referenced-by-count":7,"title":["On \u03b5-Optimality of the Pursuit Learning Algorithm"],"prefix":"10.1017","volume":"49","author":[{"given":"Ryan","family":"Martin","sequence":"first","affiliation":[]},{"given":"Omkar","family":"Tilak","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2016,2,4]]},"reference":[{"key":"S0021900200009542_ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1987.289334"},{"key":"S0021900200009542_ref20","first-page":"1213","volume":"41","year":"2011","journal-title":"IEEE Trans. Systems Man Cybernet. B."},{"key":"S0021900200009542_ref16","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"S0021900200009542_ref15","doi-asserted-by":"publisher","DOI":"10.1109\/3477.517033"},{"key":"S0021900200009542_ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090510"},{"key":"S0021900200009542_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0047-259X(76)90008-7"},{"key":"S0021900200009542_ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2003.811117"},{"key":"S0021900200009542_ref7","doi-asserted-by":"publisher","DOI":"10.1109\/21.199471"},{"key":"S0021900200009542_ref12","doi-asserted-by":"publisher","DOI":"10.1109\/21.105092"},{"key":"S0021900200009542_ref6","volume-title":"Stochastic Approximation and Recursive Algorithms and Applications","year":"2003"},{"key":"S0021900200009542_ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2009.2027220"},{"key":"S0021900200009542_ref5","doi-asserted-by":"publisher","DOI":"10.1239\/aap\/1275055235"},{"key":"S0021900200009542_ref10","volume-title":"Learning Automata: An Introduction","year":"1989"},{"key":"S0021900200009542_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00202-010-0147-5"},{"key":"S0021900200009542_ref3","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"S0021900200009542_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00090-6"},{"key":"S0021900200009542_ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2002.1049608"},{"key":"S0021900200009542_ref23","first-page":"159","volume-title":"2010 Internat. Conf. Communications and Mobile Computing","volume":"2","year":"2010"},{"key":"S0021900200009542_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2009.10.007"},{"key":"S0021900200009542_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.10.002"},{"key":"S0021900200009542_ref18","first-page":"168","volume":"15","year":"1985","journal-title":"IEEE Trans. Systems Man Cybernet"}],"container-title":["Journal of Applied Probability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0021900200009542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T07:13:00Z","timestamp":1682493180000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0021900200009542\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":21,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["S0021900200009542"],"URL":"https:\/\/doi.org\/10.1017\/s0021900200009542","relation":{},"ISSN":["0021-9002","1475-6072"],"issn-type":[{"value":"0021-9002","type":"print"},{"value":"1475-6072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9]]}}}