{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:54Z","timestamp":1773377634502,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1717610"],"award-info":[{"award-number":["CCF-1717610"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517714","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"49-54","source":"Crossref","is-referenced-by-count":3,"title":["SDP Methods for Sensitivity-Constrained Privacy Funnel and Information Bottleneck Problems"],"prefix":"10.1109","author":[{"given":"Yuheng","family":"Bu","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology,Cambridge,MA,02139"}]},{"given":"Tony","family":"Wang","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology,Cambridge,MA,02139"}]},{"given":"Gregory W.","family":"Wornell","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology,Cambridge,MA,02139"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Deep variational information bottleneck","author":"alemi","year":"2016","journal-title":"ArXiv Preprint"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3390\/e22020151"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989355"},{"key":"ref13","article-title":"On universal features for high-dimensional learning and inference","author":"huang","year":"2019","journal-title":"Preprint"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437632"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896860"},{"key":"ref16","first-page":"78","article-title":"Communication subject to state obfuscation","author":"wang","year":"0","journal-title":"Proc Int Zurich Seminar on Information and Communication (IZS) ETH Zurich"},{"key":"ref17","first-page":"8","article-title":"Introduction to semidefinite programming (SDP)","author":"freund","year":"2004","journal-title":"Massachusetts Institute of Technology"},{"key":"ref18","author":"grant","year":"2014","journal-title":"CVX Matlab Software for Disciplined Convex Programming Version 2 1"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-155-8_7"},{"key":"ref4","article-title":"Machine bias: There's software used across the country to predict future criminals. And it's biased against blacks","author":"angwin","year":"2016","journal-title":"ProPublica"},{"key":"ref3","author":"barocas","year":"2019","journal-title":"Fairness and Machine Learning fairmlbook org"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-016-0043-6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1089\/big.2016.0047"},{"key":"ref8","article-title":"Invariant risk minimization","author":"arjovsky","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref7","first-page":"10","article-title":"Domain generalization via invariant feature representation","author":"muandet","year":"0","journal-title":"Proc of the International Conference on Machine Learning (ICML)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970882"},{"key":"ref1","article-title":"The information bottleneck method","author":"tishby","year":"2000","journal-title":"Arxiv Preprint Physics\/0004057"},{"key":"ref9","article-title":"Infor-mation bottleneck for Gaussian variables","volume":"6","author":"chechik","year":"2005","journal-title":"J Mach Learn Res"},{"key":"ref20","article-title":"A maximal correlation approach to imposing fairness in machine learning","author":"lee","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3278721.3278779"},{"key":"ref21","first-page":"3992","article-title":"Optimized pre-processing for discrimination prevention","author":"calmon","year":"0","journal-title":"Proc Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref23","article-title":"AI Fairness 360: An extensible toolkit for detecting, understanding, and mitigating unwanted algorithmic bias","author":"bellamy","year":"2018","journal-title":"ArXiv Preprint"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517714.pdf?arnumber=9517714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:41Z","timestamp":1773347681000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517714\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517714","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}