{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:55:07Z","timestamp":1773377707883,"version":"3.50.1"},"reference-count":31,"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"}],"funder":[{"DOI":"10.13039\/501100001839","name":"University Grants Committee","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001839","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834751","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"724-729","source":"Crossref","is-referenced-by-count":0,"title":["Smoothed InfoNCE: Breaking the log N Curse without Overshooting"],"prefix":"10.1109","author":[{"given":"Xu","family":"Wang","sequence":"first","affiliation":[{"name":"City University of Hong Kong,Department of Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Al-Bashabsheh","sequence":"additional","affiliation":[{"name":"School of General Engineering,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Zhao","sequence":"additional","affiliation":[{"name":"City University of Hong Kong,Department of Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung","family":"Chan","sequence":"additional","affiliation":[{"name":"City University of Hong Kong,Department of Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1002\/widm.8"},{"key":"ref30","first-page":"2818","article-title":"Rethinking the inception architecture for computer vision","author":"szegedy","year":"2016","journal-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978308"},{"key":"ref11","article-title":"Information-theoretic analysis of generalization capability of learning algorithms","author":"xu","year":"2017","journal-title":"NIPS"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2945779"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2991139"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.suppl_2.S231"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1162\/089976603321780272"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.52.2318"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"66138","DOI":"10.1103\/PhysRevE.69.066138","article-title":"Estimating mutual information","volume":"69","author":"kraskov","year":"2004","journal-title":"Phys Rev E"},{"key":"ref18","article-title":"Representation learning with contrastive predictive coding","author":"oord","year":"2018"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2068870"},{"key":"ref28","article-title":"Simpler, faster, stronger: Breaking the log-k curse on contrastive learners with flatnce","author":"chen","year":"2021"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2009.12.013"},{"key":"ref27","first-page":"1779","article-title":"Club: A contrastive log-ratio upper bound of mutual information","author":"cheng","year":"2020","journal-title":"International Conference on Machine Learning"},{"key":"ref3","author":"yeung","year":"2008","journal-title":"Information Theory and Network Coding"},{"key":"ref6","article-title":"Learning representations for neural network-based classification using the information bottleneck principle","author":"amjad","year":"2019","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.3160280102"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/34.982897"},{"key":"ref8","first-page":"531","article-title":"Mutual information neural estimation","volume":"80","author":"belghazi","year":"2018","journal-title":"Machine Learning Research"},{"key":"ref7","article-title":"f-gan: Training generative neural samplers using variational divergence minimization","author":"nowozin","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref9","first-page":"2180","article-title":"Infogan: Interpretable representation learning by information maximizing generative adversarial nets","author":"chen","year":"2016","journal-title":"Proceedings of the 30th International Conference on Neural Information Processing Systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref20","article-title":"On variational lower bounds of mutual information","author":"poole","year":"2018","journal-title":"NeurIPS Workshop on Bayesian Deep Learning (NeurIPS BDL)"},{"key":"ref22","first-page":"875","article-title":"Formal limitations on the measurement of mutual information","author":"mcallester","year":"2020","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref21","article-title":"Understanding the limitations of variational mutual information estimators","author":"song","year":"2020","journal-title":"International Conference on Learning Representations"},{"key":"ref24","first-page":"1083","article-title":"CCMI: Classifier based conditional mutual information estimation","author":"mukherjee","year":"2020","journal-title":"Uncertainty in Artificial Intelligence"},{"key":"ref23","article-title":"Neural methods for point-wise dependency estimation","author":"tsai","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref26","article-title":"Regularized mutual information neural estimation","author":"choi","year":"2020"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518097"}],"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\/09834751.pdf?arnumber=9834751","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:56Z","timestamp":1773347696000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834751\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834751","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}