{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T06:01:59Z","timestamp":1776146519146,"version":"3.50.1"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"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":["IEEE Signal Process. Mag."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1109\/msp.2025.3611564","type":"journal-article","created":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T19:38:42Z","timestamp":1776109122000},"page":"10-23","source":"Crossref","is-referenced-by-count":0,"title":["Rapture of the Deep: Highs and lows of sparsity in a world of depths"],"prefix":"10.1109","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9450-8125","authenticated-orcid":false,"given":"R\u00e9mi","family":"Gribonval","sequence":"first","affiliation":[{"name":"Ecole Normale Supérieure de Lyon, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0864-6116","authenticated-orcid":false,"given":"Elisa","family":"Riccietti","sequence":"additional","affiliation":[{"name":"Ecole Normale Supérieure de Lyon, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9952-2194","authenticated-orcid":false,"given":"Quoc-Tung","family":"Le","sequence":"additional","affiliation":[{"name":"Toulouse School of Economics, Toulouse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-0635-7595","authenticated-orcid":false,"given":"L\u00e9on","family":"Zheng","sequence":"additional","affiliation":[{"name":"Huawei Lagrange Mathematics and Computing Research Center, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/msp.2008.915557"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/icassp.2013.6638838"},{"key":"ref3","first-page":"27,549","article-title":"Local identifiability of deep ReLU neural networks: The theory","volume-title":"Proc. 36th Int. Conf. Neural Inf. Process. Syst. (NIPS)","author":"Bona-Pellissier","year":"2022"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/24m1657948"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2107151119"},{"key":"ref6","first-page":"4690","article-title":"Monarch: Expressive structured matrices for efficient and accurate training","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","author":"Dao","year":"2022"},{"key":"ref7","first-page":"1517","article-title":"Learning fast algorithms for linear transforms using butterfly factorizations","volume-title":"Proc. Mach. Learn. Res.","author":"Dao","year":"2019"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/8.144597"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s40324-018-0177-x"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4948-7"},{"key":"ref11","article-title":"The early phase of neural network training","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Frankle","year":"2020"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/110820361"},{"key":"ref13","article-title":"A path-norm toolkit for modern networks: Consequences, promises and challenges","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Gonon","year":"2024"},{"key":"ref14","article-title":"A rescaling-invariant lipschitz bound based on path-metrics for modern ReLU network parameterizations","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gonon","year":"2025"},{"key":"ref15","first-page":"20,075","article-title":"Fast inference with Kronecker-sparse matrices","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gonon","year":"2025"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-1599-1_27"},{"key":"ref17","article-title":"Optimal quantization of rank-one matrices in floating-point arithmeticWith applications to butterfly factorizations","volume-title":"HAL Open Sci.","author":"Gribonval","year":"2023"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-47324-5","volume-title":"Hierarchical Matrices: Algorithms and Analysis (Springer Series in Computational Mathematics)","volume":"49","author":"Hackbusch","year":"2015"},{"key":"ref19","first-page":"1135","article-title":"Learning both weights and connections for efficient neural networks","volume":"1","author":"Han","year":"2015","journal-title":"Proc. 29th Int. Conf. Neural Inf. Process. Syst. (NIPS)"},{"issue":"241","key":"ref20","first-page":"1","article-title":"Sparsity in deep learning: Pruning and growth for efficient inference and training in neural networks","volume":"22","author":"Hoefler","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref21","article-title":"1-path-norm regularization of deep neural networks","volume-title":"Proc. LatinX AI Workshop ICML","author":"Latorre","year":"2023"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/22M1496657"},{"key":"ref23","first-page":"65,265","article-title":"Does a sparse ReLU network training problem always admit an optimum?","volume-title":"Proc. 37th Int. Conf. Neural Inf. Process. Syst. (NIPS)","author":"Le","year":"2023"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/24m1708796"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-021-09545-2"},{"key":"ref26","first-page":"16,145","article-title":"Deformable butterfly: A highly structured and sparse linear transform","volume-title":"Proc. 35th Int. Conf. Neural Inf. Process. Syst. (NIPS)","author":"Lin","year":"2021"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539792240406"},{"key":"ref29","first-page":"2422","article-title":"Path-SGD: Path-normalized optimization in deep neural networks","volume":"2","author":"Neyshabur","year":"2015","journal-title":"Proc. 29th Int. Conf. Neural Inf. Process. Syst. (NIPS)"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/msp.2023.3286988"},{"key":"ref31","first-page":"7695","article-title":"Neural networks are convex regularizers: Exact polynomial-time convex optimization formulations for two-layer networks","volume-title":"Proc. 37th Int. Conf. Mach. Learn. (ICML)","author":"Pilanci","year":"2020"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01923-3"},{"issue":"235","key":"ref33","article-title":"SIDUSThe solution for extreme deduplication of an operating system","volume":"2013","author":"Quemener","year":"2013","journal-title":"Linux J."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/08072975x"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/06066518x"},{"key":"ref36","article-title":"Equi-normalization of neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Stock","year":"2019"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-022-09578-1"},{"key":"ref38","volume-title":"Equivalences between sparse models and neural networks","author":"Tibshirani","year":"2021"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/msp.2010.939537"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/070709967"},{"key":"ref41","first-page":"569","article-title":"Butterfly factorization by algorithmic identification of rank-one blocks","volume-title":"XXIXme Colloque Francophone Traitement Signal Des Images","author":"Zheng","year":"2023"}],"container-title":["IEEE Signal Processing Magazine"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/79\/11479943\/11480036.pdf?arnumber=11480036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T05:21:07Z","timestamp":1776144067000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11480036\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":41,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/msp.2025.3611564","relation":{},"ISSN":["1053-5888","1558-0792"],"issn-type":[{"value":"1053-5888","type":"print"},{"value":"1558-0792","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]}}}