<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-03410829</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-08T01:57:18+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Sliding window strategy for convolutional spike sorting with Lasso Algorithm, theoretical guarantees and complexity</title>
            <author role="aut">
              <persName>
                <forename type="first">Laurent</forename>
                <surname>Dragoni</surname>
              </persName>
              <email type="md5">9e558944678390ffcf91547cf8ab1061</email>
              <email type="domain">univ-cotedazur.fr</email>
              <idno type="idhal" notation="numeric">1115500</idno>
              <idno type="halauthorid" notation="string">2326100-1115500</idno>
              <affiliation ref="#struct-199970"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Rémi</forename>
                <surname>Flamary</surname>
              </persName>
              <email type="md5">eaf26482480444e1fdf28e5dd475ae06</email>
              <email type="domain">polytechnique.edu</email>
              <idno type="idhal" notation="string">remi-flamary</idno>
              <idno type="idhal" notation="numeric">22</idno>
              <idno type="halauthorid" notation="string">19724-22</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=zDnwxFQAAAAJ&amp;hl=fr</idno>
              <idno type="IDREF">https://www.idref.fr/188395008</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-4212-6627</idno>
              <idno type="ARXIV">https://arxiv.org/a/flamary_r_1</idno>
              <affiliation ref="#struct-89626"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Karim</forename>
                <surname>Lounici</surname>
              </persName>
              <idno type="halauthorid">271873-0</idno>
              <affiliation ref="#struct-89626"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Patricia</forename>
                <surname>Reynaud-Bouret</surname>
              </persName>
              <email type="md5">7c0552269302cb6b71a0ae1145ef1864</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">patricia-reynaud-bouret</idno>
              <idno type="idhal" notation="numeric">8239</idno>
              <idno type="halauthorid" notation="string">14705-8239</idno>
              <idno type="IDREF">https://www.idref.fr/083750266</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-3054-1137</idno>
              <affiliation ref="#struct-199970"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Laurent</forename>
                <surname>Dragoni</surname>
              </persName>
              <email type="md5">27bc90eedb3a58565b91cb2b5f2fb579</email>
              <email type="domain">gmail.com</email>
            </editor>
            <funder ref="#projanr-50589"/>
            <funder ref="#projanr-50864"/>
            <funder ref="#projanr-53380"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2021-11-01 17:14:33</date>
              <date type="whenModified">2025-09-02 14:21:55</date>
              <date type="whenReleased">2021-11-02 09:32:36</date>
              <date type="whenProduced">2022-05-11</date>
              <date type="whenEndEmbargoed">2021-11-01</date>
              <ref type="file" target="https://hal.science/hal-03410829v1/document">
                <date notBefore="2021-11-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-03410829v1/file/paper_hal_version.pdf" id="file-3410829-2990593">
                <date notBefore="2021-11-01"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="1091689">
                <persName>
                  <forename>Laurent</forename>
                  <surname>Dragoni</surname>
                </persName>
                <email type="md5">27bc90eedb3a58565b91cb2b5f2fb579</email>
                <email type="domain">gmail.com</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03410829</idno>
            <idno type="halUri">https://hal.science/hal-03410829</idno>
            <idno type="halBibtex">dragoni:hal-03410829</idno>
            <idno type="halRefHtml">&lt;i&gt;Acta Applicandae Mathematicae&lt;/i&gt;, 2022, &lt;a target="_blank" href="https://dx.doi.org/10.1007/s10440-022-00494-x"&gt;&amp;#x27E8;10.1007/s10440-022-00494-x&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Acta Applicandae Mathematicae, 2022, &amp;#x27E8;10.1007/s10440-022-00494-x&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://hal.science/licences/copyright/">Copyright - All rights reserved<ref corresp="#file-3410829-2990593"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNICE">Université Nice Sophia Antipolis</idno>
            <idno type="stamp" n="X">École polytechnique</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INSMI">CNRS-INSMI - INstitut des Sciences Mathématiques et de leurs Interactions</idno>
            <idno type="stamp" n="X-CMAP" corresp="X">Centre de Mathématiques Appliquées (CMAP)</idno>
            <idno type="stamp" n="X-DEP-MATHA">Département de mathématiques appliquées de l’École polytechnique</idno>
            <idno type="stamp" n="DIEUDONNE">Laboratoire Jean-Alexandre Dieudonné</idno>
            <idno type="stamp" n="CMAP">Centre de Mathématiques Appliquées (CMAP)</idno>
            <idno type="stamp" n="DIEUDONNE-PS" corresp="DIEUDONNE">Laboratoire J.A. Dieudonné - UMR 7351 - Probabilités et Statistiques</idno>
            <idno type="stamp" n="UNIV-COTEDAZUR">Université Côte d'Azur</idno>
            <idno type="stamp" n="IDEX-UNIV-COTEDAZUR">IDEX Université Côte d'Azur</idno>
            <idno type="stamp" n="IP_PARIS">Institut Polytechnique de Paris</idno>
            <idno type="stamp" n="TEST-HALCNRS">Collection test HAL CNRS</idno>
            <idno type="stamp" n="PNRIA">Programme National de Recherche en IA</idno>
            <idno type="stamp" n="3IA-COTEDAZUR">3IA Côte d’Azur – Interdisciplinary Institute for Artificial Intelligence</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="UNIV-COTEDAZUR_COLLECTION_DEFAUT">UNIV-COTEDAZUR_COLLECTION_DEFAUT</idno>
            <idno type="stamp" n="ANR-IA-19" corresp="ANR-IA">ANR-IA-19</idno>
            <idno type="stamp" n="ANR-IA">ANR-IA</idno>
            <idno type="stamp" n="TEST-NICE">test nice</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Sliding window strategy for convolutional spike sorting with Lasso Algorithm, theoretical guarantees and complexity</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Laurent</forename>
                    <surname>Dragoni</surname>
                  </persName>
                  <email type="md5">9e558944678390ffcf91547cf8ab1061</email>
                  <email type="domain">univ-cotedazur.fr</email>
                  <idno type="idhal" notation="numeric">1115500</idno>
                  <idno type="halauthorid" notation="string">2326100-1115500</idno>
                  <affiliation ref="#struct-199970"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Rémi</forename>
                    <surname>Flamary</surname>
                  </persName>
                  <email type="md5">eaf26482480444e1fdf28e5dd475ae06</email>
                  <email type="domain">polytechnique.edu</email>
                  <idno type="idhal" notation="string">remi-flamary</idno>
                  <idno type="idhal" notation="numeric">22</idno>
                  <idno type="halauthorid" notation="string">19724-22</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=zDnwxFQAAAAJ&amp;hl=fr</idno>
                  <idno type="IDREF">https://www.idref.fr/188395008</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-4212-6627</idno>
                  <idno type="ARXIV">https://arxiv.org/a/flamary_r_1</idno>
                  <affiliation ref="#struct-89626"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Karim</forename>
                    <surname>Lounici</surname>
                  </persName>
                  <idno type="halauthorid">271873-0</idno>
                  <affiliation ref="#struct-89626"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Patricia</forename>
                    <surname>Reynaud-Bouret</surname>
                  </persName>
                  <email type="md5">7c0552269302cb6b71a0ae1145ef1864</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">patricia-reynaud-bouret</idno>
                  <idno type="idhal" notation="numeric">8239</idno>
                  <idno type="halauthorid" notation="string">14705-8239</idno>
                  <idno type="IDREF">https://www.idref.fr/083750266</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-3054-1137</idno>
                  <affiliation ref="#struct-199970"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">9546</idno>
                <idno type="issn">0167-8019</idno>
                <idno type="eissn">1572-9036</idno>
                <title level="j">Acta Applicandae Mathematicae</title>
                <imprint>
                  <publisher>Springer Verlag</publisher>
                  <date type="datePub">2022-05-11</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/s10440-022-00494-x</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Spike sorting</term>
                <term xml:lang="en">Neuroscience</term>
                <term xml:lang="en">Optimization</term>
                <term xml:lang="en">Lasso</term>
                <term xml:lang="en">Sparsity</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ts">Computer Science [cs]/Signal and Image Processing</classCode>
              <classCode scheme="halDomain" n="info.info-lg">Computer Science [cs]/Machine Learning [cs.LG]</classCode>
              <classCode scheme="halDomain" n="info.info-ai">Computer Science [cs]/Artificial Intelligence [cs.AI]</classCode>
              <classCode scheme="halDomain" n="math.math-st">Mathematics [math]/Statistics [math.ST]</classCode>
              <classCode scheme="halDomain" n="stat.ml">Statistics [stat]/Machine Learning [stat.ML]</classCode>
              <classCode scheme="halDomain" n="scco.neur">Cognitive science/Neuroscience</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We present a fast algorithm for the resolution of the Lasso for convolutional models in high dimension, with a particular focus on the problem of spike sorting in neuroscience. Making use of biological properties related to neurons, we explain how the particular structure of the problem allows several optimizations, leading to an algorithm with a temporal complexity which grows linearly with respect to the size of the recorded signal and can be performed online. Moreover the spatial separability of the initial problem allows to break it into subproblems, further reducing the complexity and making possible its application on the latest recording devices which comprise a large number of sensors. We provide several mathematical results: the size and numerical complexity of the subproblems can be estimated mathematically by using percolation theory. We also show under reasonable assumptions that the Lasso estimator retrieves the true support with large probability. Finally the theoretical time complexity of the algorithm is given. Numerical simulations are also provided in order to illustrate the efficiency of our approach.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-199970" status="VALID">
          <idno type="IdRef">060325887</idno>
          <idno type="RNSR">201220430J</idno>
          <idno type="ROR">https://ror.org/0274zdr66</idno>
          <orgName>Laboratoire Jean Alexandre Dieudonné</orgName>
          <orgName type="acronym">LJAD</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>Université Côte d'Azur U.M.R. no 7351 du C.N.R.S. Parc Valrose 06108 Nice Cedex 02 France</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://math.unice.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-117617" type="direct"/>
            <relation name="UMR7351" active="#struct-441569" type="direct"/>
            <relation active="#struct-1039632" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-89626" status="VALID">
          <idno type="IdRef">197373461</idno>
          <idno type="ISNI">000000010944436X</idno>
          <idno type="RNSR">199719340P</idno>
          <idno type="ROR">https://ror.org/012e1xn46</idno>
          <idno type="Wikidata">Q16008922</idno>
          <orgName>Centre de Mathématiques Appliquées de l'Ecole polytechnique</orgName>
          <orgName type="acronym">CMAP</orgName>
          <date type="start">2005-01-01</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91128 Palaiseau Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://cmap.ip-paris.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-300340" type="direct"/>
            <relation active="#struct-563936" type="indirect"/>
            <relation name="UMR7641" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-117617" status="VALID">
          <idno type="IdRef">026403498</idno>
          <idno type="ISNI">0000000123372892</idno>
          <idno type="ROR">https://ror.org/02k9vew78</idno>
          <orgName>Université Nice Sophia Antipolis (1965 - 2019)</orgName>
          <orgName type="acronym">UNS</orgName>
          <date type="start">1965-10-23</date>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Parc Valrose, 06100 Nice</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://unice.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-1039632" status="VALID">
          <idno type="IdRef">241035694</idno>
          <idno type="ROR">https://ror.org/019tgvf94</idno>
          <orgName>Université Côte d'Azur</orgName>
          <orgName type="acronym">UniCA</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>Parc Valrose, 28, avenue Valrose 06108 Nice Cedex 2</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://univ-cotedazur.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300340" status="VALID">
          <idno type="IdRef">027309320</idno>
          <idno type="ISNI">0000000121581279</idno>
          <idno type="ROR">https://ror.org/05hy3tk52</idno>
          <idno type="Wikidata">Q273626</idno>
          <orgName>École polytechnique</orgName>
          <orgName type="acronym">X</orgName>
          <date type="start">1794-03-11</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91128 Palaiseau Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.polytechnique.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-563936" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-563936" status="VALID">
          <idno type="IdRef">238327159</idno>
          <idno type="ISNI">0000000502717600</idno>
          <idno type="ROR">https://ror.org/042tfbd02</idno>
          <idno type="Wikidata">Q48759778</idno>
          <orgName>Institut Polytechnique de Paris</orgName>
          <orgName type="acronym">IP Paris</orgName>
          <date type="start">2019-06-02</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91120 Palaiseau Cedex, France</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ip-paris.fr</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-50589" status="VALID">
          <idno type="anr">ANR-19-P3IA-0002</idno>
          <orgName>3IA@cote d'azur</orgName>
          <desc>3IA Côte d'Azur</desc>
          <date type="start">2019</date>
        </org>
        <org type="anrProject" xml:id="projanr-50864" status="VALID">
          <idno type="anr">ANR-15-IDEX-0001</idno>
          <orgName>UCA JEDI</orgName>
          <desc>Idex UCA JEDI</desc>
          <date type="start">2015</date>
        </org>
        <org type="anrProject" xml:id="projanr-53380" status="VALID">
          <idno type="anr">ANR-19-CE40-0024</idno>
          <orgName>ChaMaNe</orgName>
          <desc>Enjeux mathématiques issus des neurosciences</desc>
          <date type="start">2019</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>