{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T22:28:36Z","timestamp":1775687316335,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541787","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"2689-2693","source":"Crossref","is-referenced-by-count":10,"title":["Learning Markov distributions: Does estimation trump compression?"],"prefix":"10.1109","author":[{"given":"Moein","family":"Falahatgar","sequence":"first","affiliation":[{"name":"University of California San Diego, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alon","family":"Orlitsky","sequence":"additional","affiliation":[{"name":"University of California San Diego, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatadheeraj","family":"Pichapati","sequence":"additional","affiliation":[{"name":"University of California San Diego, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ananda Theertha","family":"Suresh","sequence":"additional","affiliation":[{"name":"University of California San Diego, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056331"},{"key":"ref11","first-page":"16","article-title":"Redundancy of universal coding of arbitrary markov sources","volume":"10","author":"trofimov","year":"1974","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056652"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.782149"},{"key":"ref14","volume":"274","author":"krichevsky","year":"2013","journal-title":"Universal Compression and Retrieval"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.651051"},{"key":"ref16","first-page":"1033","article-title":"Variational minimax estimation of discrete distributions under kl loss","author":"paninski","year":"2004","journal-title":"Advances in neural information processing systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jat.2004.04.010"},{"key":"ref18","article-title":"On learning distributions from their samples","author":"kamath","year":"2015","journal-title":"COLT"},{"key":"ref4","article-title":"Minimax estimation of discrete distributions under &#x00A3;1 loss","author":"han","year":"2014","journal-title":"CoRR vol abs\/1411 1467"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2412945"},{"key":"ref6","article-title":"Testing shape restrictions of discrete distributions","author":"canonne","year":"2015","journal-title":"CoRR vol abs\/1507 03558"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF00332312"},{"key":"ref8","article-title":"Instance optimal learning","author":"valiant","year":"2015","journal-title":"arXiv preprint arXiv 1504 05321"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2432622.2432626"},{"key":"ref2","article-title":"Competitive distribution estimation: Why is Good-Turing good","author":"orlitsky","year":"2015","journal-title":"NIPS"},{"key":"ref1","first-page":"764","article-title":"Optimal probability estimation with applications to prediction and classification","author":"acharya","year":"2013"},{"key":"ref9","article-title":"Sample-optimal density estimation in nearly-linear time","author":"acharya","year":"2015","journal-title":"arXiv preprint arXiv 1506 01070"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541787.pdf?arnumber=7541787","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:53:06Z","timestamp":1774986786000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541787\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541787","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}