{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:06Z","timestamp":1773378006587,"version":"3.50.1"},"reference-count":54,"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\/501100003711","name":"Ministry of Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003711","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006477","name":"National Taiwan University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006477","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003711","name":"Ministry of Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003711","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010002","name":"Ministry of Education","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006477","name":"National Taiwan University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006477","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.9834648","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"252-257","source":"Crossref","is-referenced-by-count":11,"title":["Minimizing Quantum R\u00e9nyi Divergences via Mirror Descent with Polyak Step Size"],"prefix":"10.1109","author":[{"given":"Jun-Kai","family":"You","sequence":"first","affiliation":[{"name":"National Taiwan University,Department of Computer Science and Information Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao-Chung","family":"Cheng","sequence":"additional","affiliation":[{"name":"National Taiwan University,Department of Mathematics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yen-Huan","family":"Li","sequence":"additional","affiliation":[{"name":"National Taiwan University,Department of Computer Science and Information Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0034-4877(86)90067-4"},{"key":"ref38","article-title":"Minimizing quantum Rényi divergences via mirror descent with Polyak step size","author":"you","year":"2021"},{"key":"ref33","first-page":"263","article-title":"Convergence rate of incremental subgradient algorithms","author":"nedi?","year":"2000","journal-title":"Stochastic Optimization Algorithms and Applications"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/S1052623499362111","article-title":"Incremental subgradient methods for nondifferentiable optimization","volume":"12","author":"nedi?","year":"2001","journal-title":"SIAM J Optim"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584346"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591740"},{"key":"ref37","article-title":"Stochastic mirror descent: Convergence analysis and adaptive variants via the mirror stochastic Polyak stepsize","author":"d\u2019orazio","year":"2021"},{"key":"ref36","article-title":"Stochastic gradient descent with Polyak’s learning rate","author":"oberman","year":"2019"},{"key":"ref35","first-page":"1306","article-title":"Stochastic Polyak step-size for SGD: An adaptive learning rate for fast convergence","author":"loizou","year":"2021","journal-title":"Proc 24th Int Conf Artificial Intelligence and Statistics"},{"key":"ref34","first-page":"799","article-title":"Training neural networks for and by interpolation","author":"berrada","year":"2020","journal-title":"Proc 37th Int Conf Machine Learning"},{"key":"ref28","author":"nemirovsky","year":"1983","journal-title":"Problem Complexity and Method Efficiency in Optimization"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1134\/S003294601904001X"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(69)90061-5"},{"key":"ref2","author":"wilde","year":"2017","journal-title":"Quantum information theory"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21891-5","author":"tomamichel","year":"2016","journal-title":"Quantum Information Processing with Finite Resources"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/ab0438"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403427823"},{"key":"ref21","author":"ben-tal","year":"2015","journal-title":"Lectures on Modern Convex Optimization"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/16M1099546"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2016.0817"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2016.10.012"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1284-2"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2215575"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1063\/1.4798396"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3058166"},{"key":"ref53","article-title":"Strong converse bounds in quantum network information theory: distributed hypothesis testing and source coding","author":"cheng","year":"2019"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849518"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1063\/1.4964755"},{"key":"ref11","article-title":"Privacy amplification and decoupling without smoothing","author":"dupuis","year":"2021"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1063\/1.4838856"},{"key":"ref12","article-title":"Security of quantum key distribution","author":"renner","year":"2005","journal-title":"PhD thesis"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025545"},{"key":"ref14","article-title":"Smooth entropies: A tutorial with focus on applications in cryptography","author":"tomamichel","year":"2012"},{"key":"ref15","article-title":"Duality between source coding with quantum side information and c-q channel coding","author":"cheng","year":"2018"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3038517"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.98.062336"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-018-1428-9"},{"key":"ref4","article-title":"Principles of quantum communication theory: A modern approach","author":"khatri","year":"2020"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-49725-8","author":"hayashi","year":"2017","journal-title":"Quantum information theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891347"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2726555"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-017-2928-4"},{"key":"ref7","article-title":"Properties of scaled noncom-mutative Rényi and Augustin information","author":"cheng","year":"2018"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2353614"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3041205"},{"key":"ref46","article-title":"Reversible framework for quantum resource theories","volume":"115","author":"fernando","year":"2015","journal-title":"Phys Rev Lett"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.78.2275"},{"key":"ref48","doi-asserted-by":"crossref","DOI":"10.1515\/9783110273403","author":"holevo","year":"2012","journal-title":"Quantum Systems, Channels, Information"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.91.025001"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1981.96.99"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-014-2122-x"},{"key":"ref44","first-page":"27","article-title":"Legendre functions and the method of random Bregman projections","volume":"1","author":"bauschke","year":"1997","journal-title":"J Convex Anal"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"}],"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\/09834648.pdf?arnumber=9834648","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:52Z","timestamp":1773347752000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834648\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":54,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834648","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}