<?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-00351144</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-17T15:00:09+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Feature Discovery in Approximate Dynamic Programming</title>
            <author role="aut">
              <persName>
                <forename type="first">Philippe</forename>
                <surname>Preux</surname>
              </persName>
              <email type="md5">ed04727a32f710ec23be1af252ed4c50</email>
              <email type="domain">inria.fr</email>
              <ptr type="url" target="https://philippe-preux.codeberg.page"/>
              <idno type="idhal" notation="string">preux-philippe</idno>
              <idno type="idhal" notation="numeric">5488</idno>
              <idno type="halauthorid" notation="string">5357-5488</idno>
              <idno type="IDREF">https://www.idref.fr/059896353</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-2067-2838</idno>
              <affiliation ref="#struct-2546"/>
              <affiliation ref="#struct-56016"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Sertan</forename>
                <surname>Girgin</surname>
              </persName>
              <idno type="halauthorid">242100-0</idno>
              <affiliation ref="#struct-2546"/>
              <affiliation ref="#struct-56016"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Manuel</forename>
                <surname>Loth</surname>
              </persName>
              <idno type="halauthorid">181225-0</idno>
              <affiliation ref="#struct-2546"/>
              <affiliation ref="#struct-56016"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Preux</forename>
                <surname>Philippe</surname>
              </persName>
              <email type="md5">ed04727a32f710ec23be1af252ed4c50</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2009-01-08 15:03:43</date>
              <date type="whenWritten">2008-10-28</date>
              <date type="whenModified">2025-02-26 15:33:49</date>
              <date type="whenReleased">2009-01-08 15:03:43</date>
              <date type="whenProduced">2009-03-30</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="114278">
                <persName>
                  <forename>Preux</forename>
                  <surname>Philippe</surname>
                </persName>
                <email type="md5">ed04727a32f710ec23be1af252ed4c50</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00351144</idno>
            <idno type="halUri">https://hal.science/hal-00351144</idno>
            <idno type="halBibtex">preux:hal-00351144</idno>
            <idno type="halRefHtml">&lt;i&gt;Approximate Dynamic Programming and Reinforcement Learning&lt;/i&gt;, Mar 2009, Nashville, United States</idno>
            <idno type="halRef">Approximate Dynamic Programming and Reinforcement Learning, Mar 2009, Nashville, United States</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-LILLE3">Université de Lille Sciences humaines et sociales</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-LILLE">INRIA Lille - Nord Europe</idno>
            <idno type="stamp" n="LIFL">Laboratoire d'Informatique Fondamentale de Lille</idno>
            <idno type="stamp" n="LAGIS">Laboratoire d'Automatique, Génie Informatique et Signal</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</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>
          </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">Feature Discovery in Approximate Dynamic Programming</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Philippe</forename>
                    <surname>Preux</surname>
                  </persName>
                  <email type="md5">ed04727a32f710ec23be1af252ed4c50</email>
                  <email type="domain">inria.fr</email>
                  <ptr type="url" target="https://philippe-preux.codeberg.page"/>
                  <idno type="idhal" notation="string">preux-philippe</idno>
                  <idno type="idhal" notation="numeric">5488</idno>
                  <idno type="halauthorid" notation="string">5357-5488</idno>
                  <idno type="IDREF">https://www.idref.fr/059896353</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-2067-2838</idno>
                  <affiliation ref="#struct-2546"/>
                  <affiliation ref="#struct-56016"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Sertan</forename>
                    <surname>Girgin</surname>
                  </persName>
                  <idno type="halauthorid">242100-0</idno>
                  <affiliation ref="#struct-2546"/>
                  <affiliation ref="#struct-56016"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Manuel</forename>
                    <surname>Loth</surname>
                  </persName>
                  <idno type="halauthorid">181225-0</idno>
                  <affiliation ref="#struct-2546"/>
                  <affiliation ref="#struct-56016"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Proc. Approximate Dynamic Programming and Reinforcement Learning (ADPRL)</title>
                <meeting>
                  <title>Approximate Dynamic Programming and Reinforcement Learning</title>
                  <date type="start">2009-03-30</date>
                  <settlement>Nashville</settlement>
                  <country key="US">United States</country>
                </meeting>
                <imprint>
                  <publisher>IEEE</publisher>
                  <biblScope unit="pp">?</biblScope>
                  <date type="datePub">2009-03-30</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="stat.ml">Statistics [stat]/Machine Learning [stat.ML]</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="info.info-ne">Computer Science [cs]/Neural and Evolutionary Computing [cs.NE]</classCode>
              <classCode scheme="halDomain" n="math.math-oc">Mathematics [math]/Optimization and Control [math.OC]</classCode>
              <classCode scheme="halDomain" n="stat.ot">Statistics [stat]/Other Statistics [stat.ML]</classCode>
              <classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</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>Feature discovery aims at finding the best representation of data. This is a very important topic in machine learning, and in reinforcement learning in particular. Based on our recent work on feature discovery in the context of reinforcement learning to discover a good, if not the best, representation of states, we report here on the use of the same kind of approach in the context of approximate dynamic programming. The striking difference with the usual approach is that we use a non parametric function approximator to represent the value function, instead of a parametric one. We also argue that the problem of discovering the best state representation and the problem of the value function approximation are just the two faces of the same coin, and that using a non parametric approach provides an elegant solution to both problems at once.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-2546" status="OLD">
          <orgName>Laboratoire d'Informatique Fondamentale de Lille</orgName>
          <orgName type="acronym">LIFL</orgName>
          <desc>
            <address>
              <addrLine>Bâtiment M3 59655 Villeneuve d'Ascq Cédex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lifl.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-92973" type="direct"/>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-301700" type="direct"/>
            <relation name="UMR8022" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-56016" status="OLD">
          <idno type="RNSR">200718281V</idno>
          <orgName>Sequential Learning</orgName>
          <orgName type="acronym">SEQUEL</orgName>
          <date type="start">2007-07-01</date>
          <date type="end">2014-12-31</date>
          <desc>
            <address>
              <addrLine>Centre Inria de l'Université de Lille ,170 Av. de Bretagne, 59000 Lille</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/sequel</ref>
          </desc>
          <listRelation>
            <relation active="#struct-2546" type="direct"/>
            <relation active="#struct-92973" type="indirect"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-301700" type="indirect"/>
            <relation name="UMR8022" active="#struct-441569" type="indirect"/>
            <relation active="#struct-104752" type="direct"/>
            <relation active="#struct-183073" type="direct"/>
            <relation active="#struct-120930" type="indirect"/>
            <relation name="UMR8219" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-92973" status="OLD">
          <idno type="IdRef">026404184</idno>
          <idno type="ROR">https://ror.org/0546v5182</idno>
          <orgName>Université de Lille, Sciences et Technologies</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>Cité Scientifique - 59655 Villeneuve d'Ascq Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lille1.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-301700" status="OLD">
          <idno type="IdRef">026404524</idno>
          <idno type="ISNI">0000000121517701</idno>
          <idno type="ROR">https://ror.org/025b4c754</idno>
          <orgName>Université de Lille, Sciences Humaines et Sociales</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>Domaine universitaire du "Pont de Bois"Rue du Barreau BP 60149 59653 Villeneuve d'Ascq Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lille3.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="laboratory" xml:id="struct-104752" status="VALID">
          <idno type="RNSR">200818245B</idno>
          <idno type="ROR">https://ror.org/04eej9726</idno>
          <orgName>Centre Inria de l'Université de Lille</orgName>
          <desc>
            <address>
              <addrLine>Parc Scientifique de la Haute Borne 40, avenue Halley Bât.A, Park Plaza 59650 Villeneuve d'Ascq</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/lille/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-183073" status="OLD">
          <orgName>Laboratoire d'Automatique, Génie Informatique et Signal</orgName>
          <orgName type="acronym">LAGIS</orgName>
          <desc>
            <address>
              <addrLine>LAGIS Ecole Centrale de Lille Cité Scientifique 59655 Villeneuve d'Ascq</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://lagis.ec-lille.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-92973" type="direct"/>
            <relation active="#struct-120930" type="direct"/>
            <relation name="UMR8219" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-120930" status="VALID">
          <idno type="IdRef">256304629</idno>
          <idno type="ISNI">0000000122034461</idno>
          <idno type="ROR">https://ror.org/01x441g73</idno>
          <orgName>Centrale Lille</orgName>
          <desc>
            <address>
              <addrLine>École Centrale de Lille - Cité Scientifique - CS 20048 59651 Villeneuve d'Ascq Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://centralelille.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>