{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T07:31:42Z","timestamp":1767166302194,"version":"3.48.0"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"ANR-JCJC","award":["ANR-23-CE48-0011-01"],"award-info":[{"award-number":["ANR-23-CE48-0011-01"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Lett."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/lsp.2025.3643385","type":"journal-article","created":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T18:48:43Z","timestamp":1765478923000},"page":"326-330","source":"Crossref","is-referenced-by-count":0,"title":["Concentration Inequalities for Semidefinite Least Squares Based on Data"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9911-4758","authenticated-orcid":false,"given":"Filippo","family":"Fabiani","sequence":"first","affiliation":[{"name":"IMT School for Advanced Studies Lucca, Lucca, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Simonetto","sequence":"additional","affiliation":[{"name":"Unit&#x00E9; de Math&#x00E9;matiques Appliqu&#x00E9;es, ENSTA, Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2514\/3.4736"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7949(98)00045-5"},{"article-title":"Numerical solution of semidefinite constrained least squares problems","year":"2003","author":"Krislock","key":"ref3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.2514\/6.2017-1902"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479802413856"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/040609902"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2017976"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2022.3147007"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(88)90223-6"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2021.07.048"},{"volume-title":"Learning Theory From First Principles","year":"2024","author":"Bach","key":"ref11"},{"key":"ref12","first-page":"1225","article-title":"Train faster, generalize better: Stability of stochastic gradient descent","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hardt","year":"2016"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MCS.2023.3310345"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/23M161714X"},{"key":"ref15","article-title":"Finite-sample guarantees for data-driven forward-backward operator methods","author":"Fabiani","year":"2025","journal-title":"IEEE Trans. Autom. Control"},{"key":"ref16","article-title":"Algorithmic stability and generalization performance","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"13","author":"Bousquet","year":"2000"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9099-z"},{"article-title":"Concentration of the adjacency matrix and of the Laplacian in random graphs with independent edges","year":"2009","author":"Oliveira","key":"ref18"},{"article-title":"PAC-Bayesian bounds for the gram matrix and least squares regression with a random design","year":"2016","author":"Catoni","key":"ref19"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1642"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/9781009128490"},{"key":"ref22","first-page":"384","article-title":"Hard shape-constrained kernel machines","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Aubin-Frankowski","year":"2020"},{"key":"ref23","first-page":"499","article-title":"Stability and generalization","volume":"2","author":"Bousquet","year":"2002","journal-title":"J. Mach. Learn. Res."},{"article-title":"The MOSEK optimization toolbox for MATLAB","year":"2025","author":"ApS","key":"ref24"},{"key":"ref25","first-page":"284","article-title":"YALMIP: A toolbox for modeling and optimization in MATLAB","volume-title":"Proc. CACSD Conf.","author":"Lfberg","year":"2004"}],"container-title":["IEEE Signal Processing Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/97\/11304147\/11298386.pdf?arnumber=11298386","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T07:27:30Z","timestamp":1767166050000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11298386\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/lsp.2025.3643385","relation":{},"ISSN":["1070-9908","1558-2361"],"issn-type":[{"type":"print","value":"1070-9908"},{"type":"electronic","value":"1558-2361"}],"subject":[],"published":{"date-parts":[[2026]]}}}