{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T10:00:59Z","timestamp":1782381659860,"version":"3.54.5"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science KAKENHI","doi-asserted-by":"publisher","award":["JP18K11184"],"award-info":[{"award-number":["JP18K11184"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1109\/tcyb.2021.3049845","type":"journal-article","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T21:17:21Z","timestamp":1611868641000},"page":"7328-7339","source":"Crossref","is-referenced-by-count":22,"title":["Riemannian Adaptive Optimization Algorithm and its Application to Natural Language Processing"],"prefix":"10.1109","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7144-1549","authenticated-orcid":false,"given":"Hiroyuki","family":"Sakai","sequence":"first","affiliation":[{"name":"Department of Computer Science, Meiji University, Kanagawa, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9173-6723","authenticated-orcid":false,"given":"Hideaki","family":"Iiduka","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Meiji University, Kanagawa, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1","article-title":"On the convergence of Adam and beyond","author":"reddi","year":"2018","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref11","author":"iiduka","year":"2020","journal-title":"Appropriate learning rates of adaptive learning rate optimization algorithms for training deep neural networks"},{"key":"ref12","first-page":"3262","article-title":"Riemannian adaptive stochastic gradient algorithms on matrix manifolds","author":"kasai","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref13","first-page":"1","article-title":"Riemannian adaptive optimization methods","author":"b\u00e9cigneul","year":"2019","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244"},{"key":"ref15","first-page":"1617","article-title":"First-order methods for geodesically convex optimization","author":"zhang","year":"2016","journal-title":"Proc Conf Learn Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1090\/mmono\/149"},{"key":"ref17","first-page":"541","article-title":"Iterative algorithms for nonexpansive mappings on Hadamard manifolds","volume":"14","author":"li","year":"2010","journal-title":"Taiwanese J Math"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01238646"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2200\/S00175ED1V01Y200901MAS004"},{"key":"ref4","first-page":"6338","article-title":"Poincaré embeddings for learning hierarchical representations","author":"nickel","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2871503"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/17M1116787"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2254619"},{"key":"ref8","first-page":"1","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2015","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref7","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"duchi","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2587825"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2401973"},{"key":"ref9","author":"zeiler","year":"2012","journal-title":"ADADELTA An Adaptive Learning Rate Method"},{"key":"ref20","first-page":"5345","article-title":"Hyperbolic neural networks","author":"ganea","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","author":"lecun","year":"1998","journal-title":"The MNIST database"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2933841"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/9833009\/09339934.pdf?arnumber=9339934","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T21:26:04Z","timestamp":1661808364000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9339934\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":22,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2021.3049845","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8]]}}}