{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:55:09Z","timestamp":1740131709105,"version":"3.37.3"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1109\/tit.2019.2961814","type":"journal-article","created":{"date-parts":[[2019,12,23]],"date-time":"2019-12-23T20:33:41Z","timestamp":1577133221000},"page":"1702-1713","source":"Crossref","is-referenced-by-count":2,"title":["Time-Series Information and Unsupervised Learning of Representations"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5080-9930","authenticated-orcid":false,"given":"Daniil","family":"Ryabko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Methods for computing state similarity in Markov decision processes","author":"ferns","year":"2006","journal-title":"Proc UAI"},{"key":"ref11","first-page":"1649","article-title":"Bounding performance loss in approximate MDP homomorphisms","volume":"21","author":"taylor","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref12","first-page":"608","article-title":"Relativized options: Choosing the right transformation","volume":"20","author":"ravindran","year":"2003","journal-title":"Proc ICML"},{"key":"ref13","first-page":"2627","article-title":"Selecting the state-representation in reinforcement learning","author":"maillard","year":"2011","journal-title":"Proc NIPS"},{"key":"ref14","first-page":"543","article-title":"Optimal regret bounds for selecting the state representation in reinforcement learning","volume":"28","author":"maillard","year":"2013","journal-title":"Proc Conf ICML ser JMLR Workshop"},{"key":"ref15","first-page":"645","article-title":"Pattern recognition for conditionally independent data","volume":"7","author":"ryabko","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2024-2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-0489-0"},{"journal-title":"Statistical Learning Theory","year":"1998","author":"vapnik","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0711-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.2478\/v10229-011-0002-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16108-7_29"},{"key":"ref6","first-page":"142","article-title":"Coding theorems for a discrete source with a fidelity criterion","author":"shannon","year":"1959","journal-title":"IRE Nat Conv Rec"},{"key":"ref5","first-page":"368","article-title":"The information bottleneck method","author":"tishby","year":"1999","journal-title":"Proc 37th Annu Allerton Conf Commun Control Comput"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010388907793"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.79.041925"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MASSP.1986.1165342"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00376-4"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-7152(02)00124-4"},{"key":"ref22","first-page":"400","article-title":"Hypotheses testing on infinite random graphs","volume":"76","author":"ryabko","year":"2017","journal-title":"Proc Int Conf Algorithmic Learning Theory (ALT)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8024-4"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1214\/09-IMSCOLL508"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v17-2401"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.903122"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8999759\/08939553.pdf?arnumber=8939553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:30:02Z","timestamp":1651080602000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8939553\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":25,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2961814","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2020,3]]}}}