{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:55:18Z","timestamp":1773377718380,"version":"3.50.1"},"reference-count":27,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518141","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"43-48","source":"Crossref","is-referenced-by-count":7,"title":["A Provably Convergent Information Bottleneck Solution via ADMM"],"prefix":"10.1109","author":[{"given":"Teng-Hui","family":"Huang","sequence":"first","affiliation":[{"name":"Purdue University,Department of Electrical and Computer Engineering,West Lafayette,IN,USA"}]},{"given":"Aly","family":"el Gamal","sequence":"additional","affiliation":[{"name":"Purdue University,Department of Electrical and Computer Engineering,West Lafayette,IN,USA"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Phase transitions for the information bottleneck in representation learning","author":"wu","year":"0","journal-title":"International Conference on Learning Representations"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3390\/e14030456"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2037045"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919752"},{"key":"ref14","author":"boyd","year":"2011","journal-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers"},{"key":"ref15","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref16","author":"nocedal","year":"2006","journal-title":"Numerical Optimization"},{"key":"ref17","first-page":"arxiv-1410","article-title":"Convergence of bregman alternating direction method with multipliers for nonconvex composite problems","author":"wang","year":"2014","journal-title":"ArXiv"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1186\/s13660-019-2080-0"},{"key":"ref19","first-page":"2816","article-title":"Bregman alternating direction method of multipliers","volume":"27","author":"wang","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970882"},{"key":"ref27","first-page":"10","article-title":"Deep ADMM-Net for compressive sensing mri","volume":"29","author":"sun","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref3","article-title":"Deep variational information bottleneck","volume":"abs 1612 410","author":"alemi","year":"2016","journal-title":"CoRR"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054855"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2009.2017823"},{"key":"ref8","first-page":"617","article-title":"Agglomerative information bottleneck","author":"slonim","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996419"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3390\/e21121181"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3390\/e21100924"},{"key":"ref1","article-title":"The information bottleneck method","author":"tishby","year":"2000","journal-title":"ArXiv"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/140998135"},{"key":"ref22","author":"cover","year":"2006","journal-title":"Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.5802\/aif.1638"},{"key":"ref24","article-title":"A provably convergent information bottleneck solution via ADMM","author":"huang","year":"2021","journal-title":"ArXiv Preprint"},{"key":"ref23","first-page":"429","article-title":"Local privacy and statistical minimax rates","author":"duchi","year":"0","journal-title":"2013 IEEE 54th Annual Symposium on Foundations of Computer Science"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2883941"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2016.0817"}],"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\/09518141.pdf?arnumber=9518141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:58Z","timestamp":1773347698000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518141\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518141","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}