<?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-05326107</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-10T13:10:03+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">The Parameterized Complexity of Computing the VC-Dimension</title>
            <author role="aut">
              <persName>
                <forename type="first">Florent</forename>
                <surname>Foucaud</surname>
              </persName>
              <email type="md5">1ed88a90117097c6e89b550284193171</email>
              <email type="domain">uca.fr</email>
              <idno type="idhal" notation="string">florent-foucaud</idno>
              <idno type="idhal" notation="numeric">169708</idno>
              <idno type="halauthorid" notation="string">20994-169708</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8198-693X</idno>
              <affiliation ref="#struct-1063677"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Harmender</forename>
                <surname>Gahlawat</surname>
              </persName>
              <idno type="halauthorid">2095842-0</idno>
              <affiliation ref="#struct-1063677"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Fionn Mc</forename>
                <surname>Inerney</surname>
              </persName>
              <idno type="halauthorid">3085185-0</idno>
              <affiliation ref="#struct-97998"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Prafullkumar</forename>
                <surname>Tale</surname>
              </persName>
              <idno type="halauthorid">2580663-0</idno>
              <affiliation ref="#struct-215188"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Florent</forename>
                <surname>Foucaud</surname>
              </persName>
              <email type="md5">1ed88a90117097c6e89b550284193171</email>
              <email type="domain">uca.fr</email>
            </editor>
            <funder ref="#projanr-55789"/>
            <funder ref="#projanr-49675"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2025-10-22 13:46:34</date>
              <date type="whenWritten">2025-10-20</date>
              <date type="whenModified">2026-05-10 13:09:06</date>
              <date type="whenReleased">2025-10-22 13:46:34</date>
              <date type="whenProduced">2025-11-30</date>
              <ref type="externalLink" target="http://arxiv.org/pdf/2510.17451"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="150557">
                <persName>
                  <forename>Florent</forename>
                  <surname>Foucaud</surname>
                </persName>
                <email type="md5">1ed88a90117097c6e89b550284193171</email>
                <email type="domain">uca.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-05326107</idno>
            <idno type="halUri">https://hal.science/hal-05326107</idno>
            <idno type="halBibtex">foucaud:hal-05326107</idno>
            <idno type="halRefHtml">&lt;i&gt;39th Annual Conference on Neural Information Processing Systems (NeurIPS 2025)&lt;/i&gt;, Nov 2025, San Diego (Californie - EU) et Mexico City (Mexique), United States. pp.66046-66062</idno>
            <idno type="halRef">39th Annual Conference on Neural Information Processing Systems (NeurIPS 2025), Nov 2025, San Diego (Californie - EU) et Mexico City (Mexique), United States. pp.66046-66062</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="PRES_CLERMONT">Université de Clermont</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LIMOS" corresp="PRES_CLERMONT">Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="CAP20-25" corresp="PRES_CLERMONT">I-Site CAP 20-25</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="CLERMONT-AUVERGNE-INP">Clermont Auvergne INP</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">The Parameterized Complexity of Computing the VC-Dimension</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Florent</forename>
                    <surname>Foucaud</surname>
                  </persName>
                  <email type="md5">1ed88a90117097c6e89b550284193171</email>
                  <email type="domain">uca.fr</email>
                  <idno type="idhal" notation="string">florent-foucaud</idno>
                  <idno type="idhal" notation="numeric">169708</idno>
                  <idno type="halauthorid" notation="string">20994-169708</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8198-693X</idno>
                  <affiliation ref="#struct-1063677"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Harmender</forename>
                    <surname>Gahlawat</surname>
                  </persName>
                  <idno type="halauthorid">2095842-0</idno>
                  <affiliation ref="#struct-1063677"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Fionn Mc</forename>
                    <surname>Inerney</surname>
                  </persName>
                  <idno type="halauthorid">3085185-0</idno>
                  <affiliation ref="#struct-97998"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Prafullkumar</forename>
                    <surname>Tale</surname>
                  </persName>
                  <idno type="halauthorid">2580663-0</idno>
                  <affiliation ref="#struct-215188"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Advances in Neural Information Processing Systems</title>
                <meeting>
                  <title>39th Annual Conference on Neural Information Processing Systems (NeurIPS 2025)</title>
                  <date type="start">2025-11-30</date>
                  <date type="end">2025-12-07</date>
                  <settlement>San Diego (Californie - EU) et Mexico City (Mexique)</settlement>
                  <country key="US">United States</country>
                </meeting>
                <editor>D. Belgrave</editor>
                <editor>C. Zhang</editor>
                <editor>H. Lin</editor>
                <editor>R. Pascanu</editor>
                <editor>P. Koniusz</editor>
                <editor>M. Ghassemi</editor>
                <editor>N. Chen</editor>
                <imprint>
                  <publisher>Curran Associates</publisher>
                  <biblScope unit="volume">38</biblScope>
                  <biblScope unit="pp">66046-66062</biblScope>
                  <date type="datePub">2025</date>
                </imprint>
              </monogr>
              <idno type="arxiv">2510.17451</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">vertex cover</term>
                <term xml:lang="en">ETH</term>
                <term xml:lang="en">treewidth</term>
                <term xml:lang="en">VC-dimension</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</classCode>
              <classCode scheme="halDomain" n="info.info-ai">Computer Science [cs]/Artificial Intelligence [cs.AI]</classCode>
              <classCode scheme="halDomain" n="info.info-cc">Computer Science [cs]/Computational Complexity [cs.CC]</classCode>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
              <classCode scheme="halDomain" n="info.info-lg">Computer Science [cs]/Machine Learning [cs.LG]</classCode>
              <classCode scheme="halDomain" n="math.math-co">Mathematics [math]/Combinatorics [math.CO]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>The VC-dimension is a fundamental and well-studied measure of the complexity of a set system (or hypergraph) that is central to many areas of machine learning. We establish several new results on the complexity of computing the VC-dimension. In particular, given a hypergraph $\mathcal{H}=(\mathcal{V},\mathcal{E})$, we prove that the naive $2^{\mathcal{O}(|\mathcal{V}|)}$-time algorithm is asymptotically tight under the Exponential Time Hypothesis (ETH). We then prove that the problem admits a 1-additive fixed-parameter approximation algorithm when parameterized by the maximum degree of $\mathcal{H}$ and a fixed-parameter algorithm when parameterized by its dimension, and that these are essentially the only such exploitable structural parameters. Lastly, we consider a generalization of the problem, formulated using graphs, which captures the VC-dimension of both set systems and graphs. We show that it is fixed-parameter tractable parameterized by the treewidth of the graph (which, in the case of set systems, applies to the treewidth of its incidence graph). In contrast with closely related problems whose dependency on the treewidth is necessarily double-exponential (assuming the ETH), our algorithm has a relatively low dependency on the treewidth.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-1063677" status="VALID">
          <idno type="IdRef">155645919</idno>
          <idno type="RNSR">200212221E</idno>
          <idno type="ROR">00t3fpp34</idno>
          <orgName>Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes</orgName>
          <orgName type="acronym">LIMOS</orgName>
          <date type="start">2021-01-01</date>
          <desc>
            <address>
              <addrLine>Campus Universitaire des Cézeaux, 1 rue de la Chebarde, TSA 60125 / CS 60026, 63178 Aubière Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://limos.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UMR6158" active="#struct-359750" type="direct"/>
            <relation name="UMR6158" active="#struct-441569" type="direct"/>
            <relation name="UMR6158" active="#struct-1063463" type="direct"/>
            <relation name="UMR6158" active="#struct-1063539" type="direct"/>
            <relation active="#struct-1063463" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-97998" status="VALID">
          <orgName>Telefonica Investigación y Desarrollo</orgName>
          <orgName type="acronym">Telefonica I+D</orgName>
          <desc>
            <address>
              <country key="ES"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-301486" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-215188" status="VALID">
          <idno type="ROR">https://ror.org/028qa3n13</idno>
          <orgName>Indian Institute of Science Education and Research Pune</orgName>
          <orgName type="acronym">IISER Pune</orgName>
          <desc>
            <address>
              <addrLine>Pashan, Pune, Maharashtra 411021</addrLine>
              <country key="IN"/>
            </address>
            <ref type="url">http://www.iiserpune.ac.in/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-359750" status="VALID">
          <idno type="IdRef">028028694</idno>
          <orgName>Ecole Nationale Supérieure des Mines de St Etienne</orgName>
          <orgName type="acronym">ENSM ST-ETIENNE</orgName>
          <date type="start">1816-01-01</date>
          <desc>
            <address>
              <addrLine>158 Cour Fauriel, 42100 Saint-Étienne</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.mines-stetienne.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-1063463" status="VALID">
          <idno type="IdRef">252404955</idno>
          <idno type="ISNI">0000000115480420</idno>
          <idno type="ROR">https://ror.org/01a8ajp46</idno>
          <orgName>Université Clermont Auvergne</orgName>
          <orgName type="acronym">UCA</orgName>
          <date type="start">2021-01-01</date>
          <desc>
            <address>
              <addrLine>49, bd François-Mitterrand / CS 60032 / 63001 Clermont-Ferrand Cedex 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.uca.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-1063539" status="VALID">
          <idno type="IdRef">252428943</idno>
          <orgName>Institut national polytechnique Clermont Auvergne</orgName>
          <orgName type="acronym">INP Clermont Auvergne</orgName>
          <date type="start">2021-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-1063463" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-301486" status="VALID">
          <orgName>Telefonica Group</orgName>
          <desc>
            <address>
              <country key="ES"/>
            </address>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-55789" status="VALID">
          <idno type="anr">ANR-21-CE48-0004</idno>
          <orgName>GRALMECO</orgName>
          <desc>Algorithmique des problèmes de couverture métriques dans les graphes</desc>
          <date type="start">2021</date>
        </org>
        <org type="anrProject" xml:id="projanr-49675" status="VALID">
          <idno type="anr">ANR-16-IDEX-0001</idno>
          <orgName>CAP 20-25</orgName>
          <desc>CAP 20-25</desc>
          <date type="start">2016</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>