<?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-03751714</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-26T03:17:45+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Online learning for min-max discrete problems</title>
            <author role="aut">
              <persName>
                <forename type="first">Evripidis</forename>
                <surname>Bampis</surname>
              </persName>
              <email type="md5">86302bba886873f656fe083cf63d42ea</email>
              <email type="domain">ibisc.univ-evry.fr</email>
              <idno type="idhal" notation="numeric">1284586</idno>
              <idno type="halauthorid" notation="string">145111-1284586</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-4498-3040</idno>
              <idno type="IDREF">https://www.idref.fr/095348743</idno>
              <idno type="VIAF">https://viaf.org/viaf/23268861</idno>
              <idno type="ISNI">http://isni.org/isni/0000000043124960</idno>
              <affiliation ref="#struct-541718"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Dimitris</forename>
                <surname>Christou</surname>
              </persName>
              <idno type="halauthorid">2410969-0</idno>
              <affiliation ref="#struct-74980"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Bruno</forename>
                <surname>Escoffier</surname>
              </persName>
              <email type="md5">45ad6b7432df4bb0628803bf27a7e2e3</email>
              <email type="domain">upmc.fr</email>
              <idno type="idhal" notation="string">brunoescoffier</idno>
              <idno type="idhal" notation="numeric">5124</idno>
              <idno type="halauthorid" notation="string">24013-5124</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-6477-8706</idno>
              <idno type="IDREF">https://www.idref.fr/067352421</idno>
              <idno type="ISNI">http://isni.org/isni/0000000358818668</idno>
              <idno type="VIAF">https://viaf.org/viaf/211089377</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/CPG-4773-2022</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/CPG-4773-2022</idno>
              <affiliation ref="#struct-56663"/>
              <affiliation ref="#struct-541718"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Kim Thang</forename>
                <surname>Nguyen</surname>
              </persName>
              <email type="md5">a9b80e201669da0fcaedf2d8f3b3ea39</email>
              <email type="domain">ibisc.univ-evry.fr</email>
              <idno type="idhal" notation="string">nguyen-kim-thang</idno>
              <idno type="idhal" notation="numeric">1229140</idno>
              <idno type="halauthorid" notation="string">715841-1229140</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-6085-9453</idno>
              <idno type="IDREF">https://www.idref.fr/135943965</idno>
              <idno type="VIAF">https://viaf.org/viaf/191916480</idno>
              <affiliation ref="#struct-1042359"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Frédéric</forename>
                <surname>Davesne</surname>
              </persName>
              <email type="md5">fbe1d4bbaa9c5be84347d1c31a63a07a</email>
              <email type="domain">univ-evry.fr</email>
            </editor>
            <funder ref="#projanr-53275"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2022-08-15 14:50:38</date>
              <date type="whenModified">2025-04-17 10:06:02</date>
              <date type="whenReleased">2022-08-15 14:50:38</date>
              <date type="whenProduced">2022-09-21</date>
              <ref type="externalLink" target="http://arxiv.org/pdf/1907.05944"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="127748">
                <persName>
                  <forename>Frédéric</forename>
                  <surname>Davesne</surname>
                </persName>
                <email type="md5">fbe1d4bbaa9c5be84347d1c31a63a07a</email>
                <email type="domain">univ-evry.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03751714</idno>
            <idno type="halUri">https://univ-evry.hal.science/hal-03751714</idno>
            <idno type="halBibtex">bampis:hal-03751714</idno>
            <idno type="halRefHtml">&lt;i&gt;Theoretical Computer Science&lt;/i&gt;, 2022, 930, pp.209--217. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.tcs.2022.07.024"&gt;&amp;#x27E8;10.1016/j.tcs.2022.07.024&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Theoretical Computer Science, 2022, 930, pp.209--217. &amp;#x27E8;10.1016/j.tcs.2022.07.024&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-EVRY">Université d'Evry-Val d'Essonne</idno>
            <idno type="stamp" n="IBISC" corresp="UNIV-EVRY">Informatique, Biologie Intégrative et Systèmes Complexes</idno>
            <idno type="stamp" n="IBISC-AROBAS" corresp="IBISC">Algorithmique, Recherche Opérationnelle, Bioinformatique et Apprentissage Statistique</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="UNIV-EVRY-SACLAY" corresp="UNIV-PARIS-SACLAY">UNIV-EVRY-SACLAY</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SORBONNE-UNIV" corresp="SORBONNE-UNIVERSITE">Sorbonne Université 01/01/2018</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="UNIVERSITE-PARIS-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="GS-ENGINEERING">Graduate School Sciences de l'Ingénierie et des Systèmes</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="GS-LIFE-SCIENCES-HEALTH" corresp="UNIVERSITE-PARIS-SACLAY">Graduate School Life Sciences and Health</idno>
            <idno type="stamp" n="GS-SPORT-HUMAN-MOVEMENT">Graduate School Sport, Mouvement, Facteurs Humains</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="SUPRA_MATHS_INFO">Mathématiques + Informatique</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">Online learning for min-max discrete problems</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Evripidis</forename>
                    <surname>Bampis</surname>
                  </persName>
                  <email type="md5">86302bba886873f656fe083cf63d42ea</email>
                  <email type="domain">ibisc.univ-evry.fr</email>
                  <idno type="idhal" notation="numeric">1284586</idno>
                  <idno type="halauthorid" notation="string">145111-1284586</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-4498-3040</idno>
                  <idno type="IDREF">https://www.idref.fr/095348743</idno>
                  <idno type="VIAF">https://viaf.org/viaf/23268861</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000043124960</idno>
                  <affiliation ref="#struct-541718"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Dimitris</forename>
                    <surname>Christou</surname>
                  </persName>
                  <idno type="halauthorid">2410969-0</idno>
                  <affiliation ref="#struct-74980"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Bruno</forename>
                    <surname>Escoffier</surname>
                  </persName>
                  <email type="md5">45ad6b7432df4bb0628803bf27a7e2e3</email>
                  <email type="domain">upmc.fr</email>
                  <idno type="idhal" notation="string">brunoescoffier</idno>
                  <idno type="idhal" notation="numeric">5124</idno>
                  <idno type="halauthorid" notation="string">24013-5124</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-6477-8706</idno>
                  <idno type="IDREF">https://www.idref.fr/067352421</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000358818668</idno>
                  <idno type="VIAF">https://viaf.org/viaf/211089377</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/CPG-4773-2022</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/CPG-4773-2022</idno>
                  <affiliation ref="#struct-56663"/>
                  <affiliation ref="#struct-541718"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Kim Thang</forename>
                    <surname>Nguyen</surname>
                  </persName>
                  <email type="md5">a9b80e201669da0fcaedf2d8f3b3ea39</email>
                  <email type="domain">ibisc.univ-evry.fr</email>
                  <idno type="idhal" notation="string">nguyen-kim-thang</idno>
                  <idno type="idhal" notation="numeric">1229140</idno>
                  <idno type="halauthorid" notation="string">715841-1229140</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-6085-9453</idno>
                  <idno type="IDREF">https://www.idref.fr/135943965</idno>
                  <idno type="VIAF">https://viaf.org/viaf/191916480</idno>
                  <affiliation ref="#struct-1042359"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">19594</idno>
                <idno type="issn">0304-3975</idno>
                <idno type="eissn">1879-2294</idno>
                <title level="j">Theoretical Computer Science</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">930</biblScope>
                  <biblScope unit="pp">209--217</biblScope>
                  <date type="datePub">2022-09-21</date>
                  <date type="dateEpub">2022-07-29</date>
                </imprint>
              </monogr>
              <idno type="arxiv">1907.05944</idno>
              <idno type="doi">10.1016/j.tcs.2022.07.024</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">On-line learning</term>
                <term xml:lang="en">No-regret algorithm</term>
                <term xml:lang="en">Min-max problems</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ai">Computer Science [cs]/Artificial Intelligence [cs.AI]</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 study various discrete nonlinear combinatorial optimization problems in an online learning framework. In the first part, we address the computational complexity of designing vanishing regret (and vanishing approximate regret) algorithms. We provide a general reduction showing that many (min-max) polynomial time solvable problems not only do not have a vanishing regret, but also no vanishing approximation α-regret, for some α, unless NP=RP. In particular, for the min-max version of the vertex cover problem, which is solvable in polynomial time in the offline case, our reduction implies that there is no (2−ϵ)-regret online randomized algorithm unless Unique Game is in RP. Besides, we prove that the bound is tight by providing an online efficient algorithm based on the online gradient descent method. In the second part, we turn our attention to online learning algorithms that are based on an offline optimization oracle that, given a set of multiple instances of the problem, is able to compute the optimum static solution that performs best on the set of instances overall. We show that for several min-max (nonlinear) discrete optimization problems, it is strongly NP-hard to solve the offline optimization oracle, even for problems that can be solved in polynomial time in the single-instance static case (e.g. min-max vertex cover, min-max perfect matching, etc.). This also provides a useful insight into the connection between the non-linear nature of some problems and the drastic change of their computational hardness when moved to an online learning setting.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-541718" status="VALID">
          <orgName>Recherche Opérationnelle</orgName>
          <orgName type="acronym">RO</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-541703" type="direct"/>
            <relation active="#struct-413221" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-74980" status="VALID">
          <idno type="ROR">https://ror.org/00hj54h04</idno>
          <orgName>University of Texas at Austin [Austin]</orgName>
          <desc>
            <address>
              <addrLine>1 University Station Austin, Texas 78712</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">http://www.utexas.edu/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-56663" status="VALID">
          <idno type="IdRef">03442945X</idno>
          <idno type="ISNI">0000000119314817</idno>
          <idno type="ROR">https://ror.org/055khg266</idno>
          <idno type="Wikidata">Q1665127</idno>
          <orgName>Institut universitaire de France</orgName>
          <orgName type="acronym">IUF</orgName>
          <desc>
            <address>
              <addrLine>Maison des Universités 103 Boulevard Saint-Michel 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://iuf.amue.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301855" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-1042359" status="VALID">
          <idno type="IdRef">201055902</idno>
          <idno type="RNSR">201019077X</idno>
          <idno type="ROR">https://ror.org/01aqxgr98</idno>
          <idno type="Wikidata">Q51781503</idno>
          <orgName>Informatique, BioInformatique, Systèmes Complexes</orgName>
          <orgName type="acronym">IBISC</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>40,rue du pelvoux, Courcouronnes 91020 EVRY CEDEX</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ibisc.univ-evry.fr/</ref>
          </desc>
          <listRelation>
            <relation name="EA4526" active="#struct-300306" type="direct"/>
            <relation active="#struct-419361" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-541703" status="VALID">
          <idno type="IdRef">13558292X</idno>
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>LIP6</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-413221" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-413221" status="VALID">
          <idno type="IdRef">221333754</idno>
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Sorbonne Université</orgName>
          <orgName type="acronym">SU</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>21 rue de l’École de médecine - 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sorbonne-universite.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="institution" xml:id="struct-301855" status="VALID">
          <orgName>Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche</orgName>
          <orgName type="acronym">M.E.N.E.S.R.</orgName>
          <desc>
            <address>
              <addrLine>1 rue Descartes - 75231 Paris cedex 05</addrLine>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300306" status="VALID">
          <idno type="IdRef">030820529</idno>
          <idno type="ISNI">0000000121805818</idno>
          <idno type="ROR">https://ror.org/00e96v939</idno>
          <idno type="Wikidata">Q1531014</idno>
          <orgName>Université d'Évry-Val-d'Essonne</orgName>
          <orgName type="acronym">UEVE</orgName>
          <date type="start">1991-07-22</date>
          <desc>
            <address>
              <addrLine>Boulevard François Mitterrand 91025 Evry Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-evry.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-419361" status="VALID">
          <idno type="IdRef">241345251</idno>
          <idno type="ROR">https://ror.org/03xjwb503</idno>
          <orgName>Université Paris-Saclay</orgName>
          <desc>
            <address>
              <addrLine>Bâtiment Bréguet, 3 Rue Joliot Curie 2e ét, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.universite-paris-saclay.fr/fr</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-53275" status="VALID">
          <idno type="anr">ANR-19-CE48-0016</idno>
          <orgName>AlgoriDAM</orgName>
          <desc>Théorie algorithmique de nouveaux modèles de données</desc>
          <date type="start">2019</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>