{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T02:06:53Z","timestamp":1768874813106,"version":"3.49.0"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2021ZD0110700"],"award-info":[{"award-number":["2021ZD0110700"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62106191"],"award-info":[{"award-number":["62106191"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015401","name":"Key Research and Development Program of Shaanxi Province","doi-asserted-by":"publisher","award":["2021GXLH-Z-095"],"award-info":[{"award-number":["2021GXLH-Z-095"]}],"id":[{"id":"10.13039\/501100015401","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Innovative Research Group of the National Natural Science Foundation of China","award":["61721002"],"award-info":[{"award-number":["61721002"]}]},{"DOI":"10.13039\/501100019069","name":"Consulting Research Project of the Chinese Academy of Engineering, The Online and Offline Mixed Educational Service System for The Belt and Road Training in MOOC China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100019069","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012455","name":"Project of China Knowledge Centre for Engineering Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012455","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Innovation Team from the Ministry of Education","award":["IRT_17R86"],"award-info":[{"award-number":["IRT_17R86"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1109\/tit.2023.3260122","type":"journal-article","created":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T19:55:35Z","timestamp":1679428535000},"page":"4218-4234","source":"Crossref","is-referenced-by-count":5,"title":["Optimal Randomized Approximations for Matrix-Based R\u00e9nyi\u2019s Entropy"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4475-5056","authenticated-orcid":false,"given":"Yuxin","family":"Dong","sequence":"first","affiliation":[{"name":"Key Laboratory of Intelligent Networks and Network Security and School of Computer Science and Technology, Ministry of Education, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3840-441X","authenticated-orcid":false,"given":"Tieliang","family":"Gong","sequence":"additional","affiliation":[{"name":"Key Laboratory of Intelligent Networks and Network Security and School of Computer Science and Technology, Ministry of Education, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shujian","family":"Yu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0079-3106","authenticated-orcid":false,"given":"Chen","family":"Li","sequence":"additional","affiliation":[{"name":"Key Laboratory of Intelligent Networks and Network Security and School of Computer Science and Technology, Ministry of Education, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"547","article-title":"On measures of entropy and information","volume-title":"Proc. 4th Berkeley Symp. Math. Statist. Probab. Contrib. Theory Statist.","volume":"1","author":"R\u00e9nyi"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1570-2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2192713"},{"key":"ref4","article-title":"Information theoretic learning with infinitely divisible kernels","author":"Giraldo","year":"2013","journal-title":"arXiv:1301.3551"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17288"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.4171\/022-3\/31"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2370058"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1063\/1.4838856"},{"key":"ref9","first-page":"1","article-title":"Quantifying the informativeness of similarity measurements","volume":"18","author":"Brockmeier","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2932976"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2021.12.017"},{"key":"ref12","article-title":"Information theoretic representation distillation","author":"Miles","year":"2021","journal-title":"arXiv:2112.00459"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0803205106"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/060659454"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976496.16"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.2307\/27641890"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-014-9220-1"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1944345.1944349"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9414151"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2903050"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10605-2_2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.apnum.2015.02.004"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/16M1104974"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.105"},{"key":"ref25","article-title":"Some exact and asymptotic results for best uniform approximation","author":"Lam","year":"1972"},{"key":"ref26","volume-title":"Collected Works: Constructive Theory of Functions (1905\u20131930)","volume":"1","author":"Bernstein","year":"1952"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02145384"},{"issue":"2","key":"ref28","first-page":"169","article-title":"Sur la meilleure approximation de |x|p par des polyn\u00f4mes de degr\u00e9s tr\u00e8s \u00e9lev\u00e9s","volume":"2","author":"Bernstein","year":"1938","journal-title":"Izv. Akad. Nauk SSSR Ser. Mat."},{"key":"ref29","volume-title":"Eigen v3","author":"Guennebaud","year":"2010"},{"key":"ref30","first-page":"368","article-title":"The information bottleneck method","volume-title":"Proc. 37th Annu. Allerton Conf. Commun., Control Comput.","author":"Tishby"},{"key":"ref31","first-page":"1","article-title":"Training normalizing flows with the information bottleneck for competitive generative classification","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ardizzone"},{"key":"ref32","first-page":"20437","article-title":"Graph information bottleneck","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wu"},{"key":"ref33","first-page":"1","article-title":"Deep variational information bottleneck","volume-title":"Proc. 5th Int. Conf. Learn. Represent. (ICLR)","author":"Alemi"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2909031"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/ab3985"},{"key":"ref36","article-title":"Unpacking information bottlenecks: Unifying information-theoretic objectives in deep learning","author":"Kirsch","year":"2020","journal-title":"arXiv:2003.12537"},{"key":"ref37","first-page":"3438","article-title":"Invariance principle meets information bottleneck for out-of-distribution generalization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Ahuja"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00961"},{"key":"ref39","first-page":"1","article-title":"Very deep convolutional networks for large-scale image recognition","volume-title":"Proc. 3rd Int. Conf. Learn. Represent. (ICLR)","author":"Simonyan"},{"key":"ref40","first-page":"1","article-title":"Don\u2019t decay the learning rate, increase the batch size","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Smith"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/S0098-1354(97)00227-5"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/BF00117813"},{"key":"ref43","author":"Press","year":"1992","journal-title":"Numerical Recipes in C"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/bf00153761"},{"key":"ref45","first-page":"181","article-title":"Entropy based feature evaluation and selection technique","volume-title":"Proc. 4th Austral. Conf. Neural Netw. (ACNN)","author":"Chi"},{"key":"ref46","volume-title":"UCI Machine Learning Repository","author":"Dua","year":"2017"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2015.11.007"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.compag.2020.105507"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.3847\/1538-4365\/aa9e8a"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8953"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1177\/147447409700400103"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/72.298224"},{"issue":"1","key":"ref53","first-page":"49","article-title":"A new perspective for information theoretic feature selection","volume-title":"J. Mach. Learn. Res.","volume":"5","author":"Brown"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.3115\/1075527.1075574"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.159"},{"key":"ref56","first-page":"687","article-title":"Data visualization and feature selection: New algorithms for nongaussian data","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yang"},{"issue":"9","key":"ref57","first-page":"1","article-title":"Fast binary feature selection with conditional mutual information","volume":"5","author":"Fleuret","year":"2004","journal-title":"J. Mach. Learn. Res."},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s13324-017-0198-0"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-010-0309-4"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10155402\/10077595.pdf?arnumber=10077595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T07:36:40Z","timestamp":1709451400000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10077595\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7]]},"references-count":59,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3260122","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7]]}}}