{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:59:38Z","timestamp":1774990778535,"version":"3.50.1"},"reference-count":11,"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.7541473","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"1118-1122","source":"Crossref","is-referenced-by-count":6,"title":["Estimation of KL divergence between large-alphabet distributions"],"prefix":"10.1109","author":[{"given":"Yuheng","family":"Bu","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, United States"}]},{"given":"Shaofeng","family":"Zou","sequence":"additional","affiliation":[{"name":"Syracuse University, United States"}]},{"given":"Yingbin","family":"Liang","sequence":"additional","affiliation":[{"name":"Syracuse University, United States"}]},{"given":"Venugopal V.","family":"Veeravalli","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, United States"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874854"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2068870"},{"key":"ref10","article-title":"KL divergence estimation over large alphabet","author":"bu","year":"2016","journal-title":"In preparation for submission"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993727"},{"key":"ref11","first-page":"2134","article-title":"Competitive distribution estimation: Why is good-turing good","author":"orlitsky","year":"2015","journal-title":"Proc Advances in Neural Information Processing Systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00646"},{"key":"ref8","article-title":"Maximum likelihood estimation of functionals of discrete distributions","author":"jiao","year":"0","journal-title":"arxiv 1406 6959"},{"key":"ref7","article-title":"Minimax rates of entropy estimation on large alphabets via best polynomial approximation","author":"wu","year":"2014","journal-title":"arXiv 1407 0381"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016060"},{"key":"ref9","author":"tsybakov","year":"2008","journal-title":"Introduction to Nonparametric Estimation"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.853314"}],"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\/07541473.pdf?arnumber=7541473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:51:35Z","timestamp":1774986695000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541473\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541473","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}