{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:50:53Z","timestamp":1773377453663,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849279","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"3052-3056","source":"Crossref","is-referenced-by-count":4,"title":["Mean estimation for entangled single-sample distributions"],"prefix":"10.1109","author":[{"given":"Ankit","family":"Pensia","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Wisconsin, Madison"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Varun","family":"Jog","sequence":"additional","affiliation":[{"name":"Department of Electrical &#x0026; Computer Engineering, University of Wisconsin, Madison"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Po-Ling","family":"Loh","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Wisconsin, Madison"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"i","article-title":"Mixture models: Theory, geometry and applications","author":"lindsay","year":"1995","journal-title":"NSF-CBMS Regional Conference Series in Probability and Statistics"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814639"},{"key":"ref12","first-page":"247","article-title":"Learning mixtures of arbitrary Gaussians","author":"arora","year":"2001","journal-title":"Proceedings of the 3rd Annual ACM Symposium on Theory of Computing"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_30"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_31"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1135065"},{"key":"ref17","author":"boucheron","year":"2016","journal-title":"Concentration Inequalities A Nonasymptotic Theory of Independence"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703732"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1109\/TIFS.2014.2368363","article-title":"Correlated differential privacy: Hiding information in non-iid data set","volume":"10","author":"zhu","year":"2015","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"ref3","first-page":"1768","article-title":"Fast learning from non-iid observations","author":"steinwart","year":"2009","journal-title":"Advances in NIPS"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.38"},{"key":"ref5","first-page":"22","article-title":"Gaussian processes for independence tests with non-iid data in causal inference","volume":"7","author":"flaxman","year":"2016","journal-title":"ACM Trans TIST"},{"key":"ref8","author":"andrews","year":"1972","journal-title":"Robust Estimates of Location Survey and Advances"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02868560"},{"key":"ref2","first-page":"756","article-title":"Learning classifiers when the training data is not iid","author":"dundar","year":"2007","journal-title":"IJCAI"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176351062"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176347498"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849279.pdf?arnumber=8849279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:33:46Z","timestamp":1773347626000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849279\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849279","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}