{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T04:56:52Z","timestamp":1740113812947,"version":"3.37.3"},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Networks"],"published-print":{"date-parts":[[2006,1]]},"DOI":"10.1016\/j.neunet.2005.02.008","type":"journal-article","created":{"date-parts":[[2005,10,4]],"date-time":"2005-10-04T18:23:10Z","timestamp":1128450190000},"page":"62-75","source":"Crossref","is-referenced-by-count":7,"title":["The asymptotic equipartition property in reinforcement learning and its relation to return maximization"],"prefix":"10.1016","volume":"19","author":[{"given":"Kazunori","family":"Iwata","sequence":"first","affiliation":[]},{"given":"Kazushi","family":"Ikeda","sequence":"additional","affiliation":[]},{"given":"Hideaki","family":"Sakai","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.neunet.2005.02.008_bib1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1109\/18.32118","article-title":"Statistical inference under multiterminal rate restrictions: a differential geometric approach","volume":"35","author":"Amari","year":"1989","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"10.1016\/j.neunet.2005.02.008_bib2","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1147\/rd.214.0350","article-title":"Algorithmic information theory","volume":"21","author":"Chaitin","year":"1977","journal-title":"IBM journal of research and development"},{"key":"10.1016\/j.neunet.2005.02.008_bib3","doi-asserted-by":"crossref","unstructured":"Chaitin, G.J. (1987). Algorithmic information theory (Vol. 1). Cambridge, UK: Cambridge University Press. (reprinted with revisions in 1988).","DOI":"10.1017\/CBO9780511608858"},{"year":"1991","series-title":"Elements of information theory","author":"Cover","key":"10.1016\/j.neunet.2005.02.008_bib4"},{"issue":"6","key":"10.1016\/j.neunet.2005.02.008_bib5","doi-asserted-by":"crossref","first-page":"2505","DOI":"10.1109\/18.720546","article-title":"The method of types","volume":"44","author":"Csisz\u00e1r","year":"1998","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/j.neunet.2005.02.008_bib6","unstructured":"Csisz\u00e1r, I., K\u00f6rner, J. (1997). Information theory: coding theorems for discrete memoryless systems (3rd ed.). Budapest, Hungary: Akad\u00e9miai Kiad\u00f3. (1st impression 1981, 2nd impression 1986)."},{"issue":"4","key":"10.1016\/j.neunet.2005.02.008_bib7","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/TIT.1981.1056377","article-title":"The error exponent for the noiseless encoding of finite ergodic markov sources","volume":"27","author":"Davisson","year":"1981","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"10.1016\/j.neunet.2005.02.008_bib8","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF00992701","article-title":"The convergence of TD(() for general","volume":"8","author":"Dayan","year":"1992","journal-title":"Machine Learning"},{"article-title":"Bayesian Q-learning","year":"1998","author":"Dearden","key":"10.1016\/j.neunet.2005.02.008_bib9"},{"issue":"1","key":"10.1016\/j.neunet.2005.02.008_bib10","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/TIT.1979.1056003","article-title":"Reliability function of a discrete memoryless channel at rates above capacity","volume":"25","author":"Dueck","year":"1979","journal-title":"IEEE Transactions on Information Theory"},{"year":"2002","series-title":"Mathematics of information and coding (vol. 203)","author":"Han","key":"10.1016\/j.neunet.2005.02.008_bib11"},{"issue":"4","key":"10.1016\/j.neunet.2005.02.008_bib12","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1109\/TNN.2004.828760","article-title":"A new criterion using information gain for action selection strategy in reinforcement learning","volume":"15","author":"Iwata","year":"2004","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"6","key":"10.1016\/j.neunet.2005.02.008_bib13","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1162\/neco.1994.6.6.1185","article-title":"On the convergence of stochastic iterative dynamic programming algorithms","volume":"6","author":"Jaakkola","year":"1994","journal-title":"Neural Computation"},{"issue":"1","key":"10.1016\/j.neunet.2005.02.008_bib14","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1109\/TIT.1967.1053968","article-title":"A lower bound for discrimination information in terms of variation","volume":"13","author":"Kullback","year":"1967","journal-title":"IEEE Transactions on Information Theory"},{"article-title":"Stochastic approximation algorithms and applications (vol. 35)","year":"1997","author":"Kushner","key":"10.1016\/j.neunet.2005.02.008_bib15"},{"year":"1997","series-title":"An introduction to kolmogorov complexity and its applications","author":"Li","key":"10.1016\/j.neunet.2005.02.008_bib16"},{"issue":"3","key":"10.1016\/j.neunet.2005.02.008_bib17","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1109\/18.79912","article-title":"Universal coding with minimum probability of codeword length over.ow","volume":"37","author":"Merhav","year":"1991","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"10.1016\/j.neunet.2005.02.008_bib18","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/18.108258","article-title":"Variable-to-fixed length codes provide better large deviations performance than fixed-to-variable length codes","volume":"38","author":"Merhav","year":"1992","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/j.neunet.2005.02.008_bib19","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell System Technical Journal"},{"key":"10.1016\/j.neunet.2005.02.008_bib20","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1007678930559","article-title":"Convergence results for single-step on-policy reinforcement-learning algorithms","volume":"39","author":"Singh","year":"2000","journal-title":"Machine Learning"},{"year":"1998","series-title":"Reinforcement learning: An introduction","author":"Sutton","key":"10.1016\/j.neunet.2005.02.008_bib21"},{"issue":"3","key":"10.1016\/j.neunet.2005.02.008_bib22","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF00993306","article-title":"Asynchronous stochastic approximation and Q-learning","volume":"16","author":"Tsitsiklis","year":"1994","journal-title":"Machine Learning"},{"key":"10.1016\/j.neunet.2005.02.008_bib23","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00992698","article-title":"Technical note: Q-learning","volume":"8","author":"Watkins","year":"1992","journal-title":"Machine Learning"},{"year":"1978","series-title":"Coding theorems of information theory","author":"Wolfowitz","key":"10.1016\/j.neunet.2005.02.008_bib24"}],"container-title":["Neural Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608005000808?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608005000808?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,7,3]],"date-time":"2022-07-03T00:09:58Z","timestamp":1656806998000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893608005000808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,1]]}},"alternative-id":["S0893608005000808"],"URL":"https:\/\/doi.org\/10.1016\/j.neunet.2005.02.008","relation":{},"ISSN":["0893-6080"],"issn-type":[{"type":"print","value":"0893-6080"}],"subject":[],"published":{"date-parts":[[2006,1]]}}}