{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:13:50Z","timestamp":1774628030327,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T00:00:00Z","timestamp":1635638400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T00:00:00Z","timestamp":1635638400000},"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":[[2021,10,31]]},"DOI":"10.1109\/ieeeconf53345.2021.9723149","type":"proceedings-article","created":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T20:26:46Z","timestamp":1646425606000},"page":"477-484","source":"Crossref","is-referenced-by-count":4,"title":["A Minimax Lower Bound for Low-Rank Matrix-Variate Logistic Regression"],"prefix":"10.1109","author":[{"given":"Batoul","family":"Taki","sequence":"first","affiliation":[{"name":"Rutgers University–New Brunswick,Department of Electrical and Computer Engineering,Piscataway,NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohsen","family":"Ghassemi","sequence":"additional","affiliation":[{"name":"Rutgers University–New Brunswick,Department of Electrical and Computer Engineering,Piscataway,NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand D.","family":"Sarwate","sequence":"additional","affiliation":[{"name":"Rutgers University–New Brunswick,Department of Electrical and Computer Engineering,Piscataway,NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Waheed U.","family":"Bajwa","sequence":"additional","affiliation":[{"name":"Rutgers University–New Brunswick,Department of Electrical and Computer Engineering,Piscataway,NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2884963"},{"key":"ref11","article-title":"Sparse bilinear logistic regression","author":"shi","year":"2014"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0234975"},{"key":"ref13","first-page":"2719","article-title":"Statistical and computational rates in graph logistic regression","author":"berthet","year":"2020","journal-title":"Proc Int Conf on Artificial Intelligence and Statistics (PMLR)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2517006"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541479"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1880-7_29"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref18","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"13","author":"negahban","year":"2012","journal-title":"J Machine Learning Research (JMLR)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1123095"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxs023"},{"key":"ref3","article-title":"Learning product graphs underlying smooth graph signals","author":"lodhi","year":"2020"},{"key":"ref6","article-title":"Minimax bounds for distributed logistic regression","author":"barnes","year":"2019"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1162\/neco_a_01038"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOS1725"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/19M126476X"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1364\/OL.44.003968"},{"key":"ref1","first-page":"217","article-title":"Logistic regression","author":"wright","year":"1995","journal-title":"Reading and understanding multivariate statistics"},{"key":"ref9","first-page":"167","article-title":"Logistic regression: The importance of being improper","author":"foster","year":"2018","journal-title":"Proc Conf Learn Theory"},{"key":"ref20","author":"cover","year":"2012","journal-title":"Elements of Information Theory"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2799931"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032816"}],"event":{"name":"2021 55th Asilomar Conference on Signals, Systems, and Computers","location":"Pacific Grove, CA, USA","start":{"date-parts":[[2021,10,31]]},"end":{"date-parts":[[2021,11,3]]}},"container-title":["2021 55th Asilomar Conference on Signals, Systems, and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9723034\/9723086\/09723149.pdf?arnumber=9723149","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T20:15:48Z","timestamp":1655324148000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9723149\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,31]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/ieeeconf53345.2021.9723149","relation":{},"subject":[],"published":{"date-parts":[[2021,10,31]]}}}