{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T14:54:01Z","timestamp":1767192841511,"version":"3.29.0"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T00:00:00Z","timestamp":1727136000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T00:00:00Z","timestamp":1727136000000},"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":[[2024,9,24]]},"DOI":"10.1109\/allerton63246.2024.10735290","type":"proceedings-article","created":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T18:31:52Z","timestamp":1730745112000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["Structured Regularization for SPD Optimization with Side Information"],"prefix":"10.1109","author":[{"given":"Andrew","family":"Cheng","sequence":"first","affiliation":[{"name":"Harvard University,Cambridge,MA"}]},{"given":"Melanie","family":"Weber","sequence":"additional","affiliation":[{"name":"Harvard University,Cambridge,MA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-020-00173-3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1515\/9783110361629"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drx080"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0653-8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2254619"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126523"},{"key":"ref7","article-title":"The difference of convex algorithm on riemannian manifolds","author":"Ferreira","year":"2021","journal-title":"arXiv preprint"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511550683"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00245-019-09564-3"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2013.03.006"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.2307\/2290063"},{"key":"ref12","article-title":"On the conver-gence of the concave-convex procedure","volume":"22","author":"Lanckriet","year":"2009","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"18","key":"ref13","first-page":"593","article-title":"Regression on fixed-rank positive semidefinite matrices: A Riemannian approach","volume":"12","author":"Meyer","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"ref14","first-page":"2389","article-title":"Fixed-point algorithms for learning determinantal point processes","volume-title":"International Conference on Machine Learning","author":"Mariet"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10440-005-9003-4"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791"},{"key":"ref17","article-title":"Calculating op-timistic likelihoods using (geodesically) convex optimization","author":"Nguyen","year":"2019","journal-title":"Neural Information Processing Systems"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2360826"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2017.1302882"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-985X.2005.00368_10.x"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2653803"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-015-0282-7"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1090\/proc\/12953"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2025-2_4"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176350263"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8390-9"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2218241"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drab066"},{"volume-title":"Computing Brascamp-Lieb Constants through the lens of Thompson Geometry","year":"2022","author":"Weber","key":"ref29"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01840-5"},{"key":"ref31","first-page":"36790","article-title":"Global optimality for Euclidean CCCP under Riemannian convexity","volume-title":"Proceedings of the 40th International Conference on Machine Learning","volume":"202","author":"Weber"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iav012"},{"key":"ref33","article-title":"Riemannian SVRG: Fast stochastic optimization on Riemannian manifolds","volume":"29","author":"Zhang","year":"2016","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref34","first-page":"1617","article-title":"First-order methods for geodesically convex optimization","volume-title":"Conference on Learning Theory","author":"Zhang"}],"event":{"name":"2024 60th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2024,9,24]]},"location":"Urbana, IL, USA","end":{"date-parts":[[2024,9,27]]}},"container-title":["2024 60th Annual Allerton Conference on Communication, Control, and Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10735178\/10735179\/10735290.pdf?arnumber=10735290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T05:08:14Z","timestamp":1732684094000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10735290\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,24]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/allerton63246.2024.10735290","relation":{},"subject":[],"published":{"date-parts":[[2024,9,24]]}}}