{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:38:30Z","timestamp":1773376710449,"version":"3.50.1"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"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":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619516","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"2466-2471","source":"Crossref","is-referenced-by-count":0,"title":["An Expectation-Maximization Relaxed Method for Privacy Funnel"],"prefix":"10.1109","author":[{"given":"Lingyi","family":"Chen","sequence":"first","affiliation":[{"name":"Tsinghua University,Department of Mathematical Sciences,Beijing,China,100084"}]},{"given":"Jiachuan","family":"Ye","sequence":"additional","affiliation":[{"name":"Tsinghua University,Department of Mathematical Sciences,Beijing,China,100084"}]},{"given":"Shitong","family":"Wu","sequence":"additional","affiliation":[{"name":"Tsinghua University,Department of Mathematical Sciences,Beijing,China,100084"}]},{"given":"Huihui","family":"Wu","sequence":"additional","affiliation":[{"name":"Yangtze Delta Region Institute (Huzhou), University of Electronic Science and Technology of China,Huzhou,Zhejiang,P.R. China,313000"}]},{"given":"Hao","family":"Wu","sequence":"additional","affiliation":[{"name":"Tsinghua University,Department of Mathematical Sciences,Beijing,China,100084"}]},{"given":"Wenyi","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China,Department of Electronic Engineering and Information Science,Hefei,Anhui,China,230027"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483382"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970882"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282765"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2700857"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2865558"},{"key":"ref6","article-title":"Generating Optimal Privacy-Protection Mechanisms via Machine Learning","author":"Romanelli","year":"2019","journal-title":"arXiv preprint"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919758"},{"key":"ref8","first-page":"614","article-title":"Adversarially Learned Representations for Information Obfuscation and Inference","volume-title":"36th International Conference on Ma-chine Learning (ICML)","volume":"97","author":"Bertran"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611429"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517714"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054855"},{"key":"ref12","first-page":"368","article-title":"The Information Bottleneck Method","volume-title":"37th Annual Allerton Conference on Communications, Control and Computing (Allerton)","author":"Tishby"},{"key":"ref13","article-title":"Efficient and Provably Convergent Computation of Information Bottleneck: A Semi-Relaxed Approach","volume-title":"IEEE International Conference on Communications (ICC)","author":"Chen"},{"key":"ref14","article-title":"A Submodularity-Based Agglomerative Clustering Algorithm for the Privacy Funnel","author":"Ding","year":"2019","journal-title":"arXiv preprint"},{"key":"ref15","article-title":"Agglomerative Information Bottleneck","volume":"12","author":"Slonim","year":"1999","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3262112"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP48485.2024.10446646"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3229765"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT-W61686.2024.10591770"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1561\/9781601984319"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3390\/e21121181"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM48099.2022.10000926"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITW55543.2023.10161675"},{"key":"ref24","article-title":"An Expectation-Maximization Relaxed Method for Privacy Funnel","author":"Chen","year":"2024","journal-title":"arXiv preprint"},{"key":"ref25","volume-title":"UCI Repository of Machine Learning Databases","author":"Blake","year":"1998"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619516.pdf?arnumber=10619516","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:51Z","timestamp":1773347271000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619516\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619516","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}