{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:57:47Z","timestamp":1773377867612,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834530","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1909-1914","source":"Crossref","is-referenced-by-count":4,"title":["Minimax Robust Quickest Change Detection using Wasserstein Ambiguity Sets"],"prefix":"10.1109","author":[{"given":"Liyan","family":"Xie","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Shenzhen,School of Data Science,Shenzhen,China"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2740202"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104993"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.23919\/FUSION49465.2021.9626915"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3006755"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/058"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729694"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3072962"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177693055"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176346587"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2693198"},{"key":"ref28","volume":"338","author":"villani","year":"2008","journal-title":"Optimal Transport Old and New"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.2307\/2333009"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176350164"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-411597-2.00006-0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177699803"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"2917","DOI":"10.1109\/18.737522","article-title":"Information bounds and quick detection of parameter changes in stochastic systems","volume":"44","author":"lai","year":"1998","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3061298"},{"key":"ref7","first-page":"7902","article-title":"Robust hypothesis testing using Wasserstein uncertainty sets","author":"gao","year":"2018","journal-title":"Proceedings of the Advances in Neural Information Processing Systems (NeurIPS)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1862-1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517852"},{"key":"ref1","author":"tartakovsky","year":"2015","journal-title":"Sequential Analysis Hypothesis Testing and Change-Point Detection"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008128"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"2599","DOI":"10.1214\/19-AOS1899","article-title":"Minimax optimal sequential hypothesis tests for Markov processes","volume":"48","author":"fau\u00df","year":"2020","journal-title":"Annals of Statistics"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176342363"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1172-1"},{"key":"ref23","article-title":"Distributionally robust stochastic optimization with Wasserstein distance","author":"gao","year":"2016","journal-title":"arXiv preprint arXiv 1604 02199"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2881666"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-014-0583-7"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834530.pdf?arnumber=9834530","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:24Z","timestamp":1773347724000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834530\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834530","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}