{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T08:20:18Z","timestamp":1781252418676,"version":"3.54.1"},"reference-count":74,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"publisher","award":["FA9550-19-1-0203"],"award-info":[{"award-number":["FA9550-19-1-0203"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"NSF","doi-asserted-by":"publisher","award":["1653435"],"award-info":[{"award-number":["1653435"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1109\/tit.2019.2956737","type":"journal-article","created":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T21:14:24Z","timestamp":1575062064000},"page":"3202-3231","source":"Crossref","is-referenced-by-count":31,"title":["Spectral State Compression of Markov Processes"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8721-5252","authenticated-orcid":false,"given":"Anru","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2101-9507","authenticated-orcid":false,"given":"Mengdi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v16-1624"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/BF01456804"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932678"},{"key":"ref70","doi-asserted-by":"crossref","first-page":"1564","DOI":"10.1214\/aos\/1017939142","article-title":"Information-theoretic determination of minimax rates of convergence","volume":"27","author":"yang","year":"1999","journal-title":"Ann Statist"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996452"},{"key":"ref39","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","author":"ng","year":"2002","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref38","article-title":"A random walks view of spectral segmentation","author":"meila","year":"2001"},{"key":"ref33","first-page":"1297","article-title":"Practical large-scale optimization for max-norm regularization","author":"lee","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1272"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref30","article-title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","author":"chen","year":"2015","journal-title":"arXiv 1509 03025"},{"key":"ref37","first-page":"1","article-title":"Estimation of Markov chain via rank-constrained likelihood","author":"li","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref36","article-title":"Recovering structured probability matrices","author":"huang","year":"2016","journal-title":"arXiv 1602 06586"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.12.025"},{"key":"ref34","first-page":"3619","article-title":"A max-norm constrained minimization approach to 1-bit matrix completion","volume":"14","author":"cai","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177707039"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2270464"},{"key":"ref61","article-title":"Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application","author":"wang","year":"2013","journal-title":"arXiv 1309 1541"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1257"},{"key":"ref28","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref64","author":"jolliffe","year":"2002","journal-title":"Principal Component Analysis"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref65","first-page":"1459","article-title":"Mixing time estimation in reversible Markov chains from a single sample path","author":"hsu","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref66","article-title":"Bernstein’s inequality for general Markov chains","author":"jiang","year":"2018","journal-title":"arXiv 1805 10721"},{"key":"ref29","first-page":"15","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems","volume":"6","author":"toh","year":"2010","journal-title":"Pacific J Optim"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v20-4039"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1904-8"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1880-7_29"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/16M1074023"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10109-012-0166-z"},{"key":"ref20","first-page":"2574","article-title":"An analysis of Laplacian methods for value function approximation in MDPs","author":"petrik","year":"2007","journal-title":"Proc IJCAI"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706876"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1561\/2200000003"},{"key":"ref24","author":"lehmann","year":"2006","journal-title":"Theory of Point Estimation"},{"key":"ref23","first-page":"128","article-title":"Minimax estimation for the multinomial and multivariate hypergeometric distributions","volume":"47","author":"wilczy?ski","year":"1985","journal-title":"Sankhya Indian J Stat"},{"key":"ref26","first-page":"1066","article-title":"On learning distributions from their samples","author":"kamath","year":"2015","journal-title":"Proc Conf Learn Theory"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2478816"},{"key":"ref50","article-title":"Learning low-dimensional state embeddings and metastable clusters from time series data","author":"sun","year":"2019","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref51","author":"norris","year":"1998","journal-title":"Markov Chains"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1017\/S0021900200107338"},{"key":"ref58","volume":"356","author":"kemeny","year":"1960","journal-title":"Finite Markov Chains"},{"key":"ref57","first-page":"2079","article-title":"Value function approximation using multiple aggregation for multiattribute resource management","volume":"9","author":"george","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref56","author":"bertsekas","year":"2007","journal-title":"Dynamic Programming and Optimal Control"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(84)90071-5"},{"key":"ref54","article-title":"Markov chains of finite rank","author":"hoekstra","year":"1983"},{"key":"ref53","article-title":"Markov processes in waiting-time and renewal theory","author":"runnenburg","year":"1966"},{"key":"ref52","author":"levin","year":"2009","journal-title":"Markov Chains and Mixing Times"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.72.3634"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1063\/1.4811489","article-title":"Identification of slow molecular order parameters for Markov model construction","volume":"139","author":"p\u00e9rez-hern\u00e1ndez","year":"2013","journal-title":"J Chem Phys"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS887"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/S0022112010001217"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00332-012-9130-9"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s00332-017-9437-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-200-7.50069-6"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"3819","DOI":"10.1109\/CDC.2002.1184960","article-title":"State aggregation in Markov decision processes","volume":"4","author":"ren","year":"2002","journal-title":"Proc 41st IEEE Conf Decis Control"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273545"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102421"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273589"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2016.1534"},{"key":"ref3","article-title":"Dynamic partition of complex networks","author":"yang","year":"2017","journal-title":"arXiv 1705 07881"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.39.4.553"},{"key":"ref5","article-title":"Spectral method and regularized MLE are both optimal for top-K ranking","author":"chen","year":"2017","journal-title":"arXiv 1707 09971"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF00114724"},{"key":"ref7","author":"bertsekas","year":"1996","journal-title":"Neuro-Dynamic Programming"},{"key":"ref49","article-title":"State aggregation learning from Markov transition data","author":"duan","year":"2019","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref9","first-page":"361","article-title":"Reinforcement learning with soft state aggregation","author":"singh","year":"1995","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.04.037"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","article-title":"Normalized cuts and image segmentation","volume":"22","author":"shi","year":"2000","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"7907","DOI":"10.1073\/pnas.0707563105","article-title":"Optimal partition and effective dynamics of complex networks","volume":"105","author":"weinan","year":"2008","journal-title":"Proc Nat Acad Sci USA"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1274"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.88.042822"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1541"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1423"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9075318\/8918022-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9075318\/08918022.pdf?arnumber=8918022","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,7]],"date-time":"2022-10-07T07:36:16Z","timestamp":1665128176000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8918022\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":74,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2956737","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5]]}}}