<?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-01323671</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-24T23:07:28+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Approximation of additive random fields based on standard information: Average case and probabilistic settings</title>
            <author role="aut">
              <persName>
                <forename type="first">Mikhail</forename>
                <surname>Lifshits</surname>
              </persName>
              <idno type="halauthorid">192011-0</idno>
              <affiliation ref="#struct-234529"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Marguerite</forename>
                <surname>Zani</surname>
              </persName>
              <idno type="halauthorid">181224-0</idno>
              <orgName ref="#struct-300297"/>
              <affiliation ref="#struct-300297"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Marguerite</forename>
                <surname>Zani</surname>
              </persName>
              <email type="md5">e33aab61af2c6210a6952343515d9a03</email>
              <email type="domain">univ-orleans.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-05-30 21:34:24</date>
              <date type="whenModified">2024-04-19 15:11:20</date>
              <date type="whenReleased">2016-06-01 11:37:42</date>
              <date type="whenProduced">2015</date>
              <date type="whenEndEmbargoed">2016-05-30</date>
              <ref type="file" target="https://hal.science/hal-01323671v1/document">
                <date notBefore="2016-05-30"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01323671v1/file/LifshitsZani_r1.pdf" id="file-1323671-1403180">
                <date notBefore="2016-05-30"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1402.5489"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="181032">
                <persName>
                  <forename>Marguerite</forename>
                  <surname>Zani</surname>
                </persName>
                <email type="md5">e33aab61af2c6210a6952343515d9a03</email>
                <email type="domain">univ-orleans.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01323671</idno>
            <idno type="halUri">https://hal.science/hal-01323671</idno>
            <idno type="halBibtex">lifshits:hal-01323671</idno>
            <idno type="halRefHtml">&lt;i&gt;Journal of Complexity&lt;/i&gt;, 2015, &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.jco.2015.05.002"&gt;&amp;#x27E8;10.1016/j.jco.2015.05.002&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Journal of Complexity, 2015, &amp;#x27E8;10.1016/j.jco.2015.05.002&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1323671-1403180"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-ORLEANS">Université d'Orléans</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="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Approximation of additive random fields based on standard information: Average case and probabilistic settings</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Mikhail</forename>
                    <surname>Lifshits</surname>
                  </persName>
                  <idno type="halauthorid">192011-0</idno>
                  <affiliation ref="#struct-234529"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Marguerite</forename>
                    <surname>Zani</surname>
                  </persName>
                  <idno type="halauthorid">181224-0</idno>
                  <orgName ref="#struct-300297"/>
                  <affiliation ref="#struct-300297"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">15267</idno>
                <idno type="issn">0885-064X</idno>
                <idno type="eissn">1090-2708</idno>
                <title level="j">Journal of Complexity</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <date type="datePub">2015</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1016/j.jco.2015.05.002</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Approximation complexity</term>
                <term xml:lang="en">Additive random fields</term>
                <term xml:lang="en">Gaussian processes</term>
                <term xml:lang="en">Standard information</term>
                <term xml:lang="en">Tensor product random fields</term>
              </keywords>
              <classCode scheme="halDomain" n="math.math-pr">Mathematics [math]/Probability [math.PR]</classCode>
              <classCode scheme="halDomain" n="math.math-na">Mathematics [math]/Numerical Analysis [math.NA]</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 consider approximation problems for tensor product and additive random fields based on standard information in the average case setting. We also study the probabilistic setting of the mentioned problem for tensor products. The main question we are concerned with in this paper is " How much do we loose by considering standard information algorithms against those using general linear information? " For both types of the fields, the error of linear algorithms has been studied in great detail; however, the power of standard information was not addressed so far, which we do here. Our main result is that in most interesting cases there is no more than a logarithmic loss in approximation error when information is being restricted to the standard one. The results are obtained by randomization techniques.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-234529" status="INCOMING">
          <orgName>Department of Mathematics and Mechanics</orgName>
          <desc>
            <address>
              <addrLine>Department of Mathematics and Mechanics, St. Petersburg State University, Bibliotechnaya pl., 2, 198504, Stary Peterhof, Russia</addrLine>
              <country key="RU"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-119036" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300297" status="VALID">
          <idno type="IdRef">026402971</idno>
          <idno type="ISNI">0000 0001 2158 1666</idno>
          <idno type="ROR">https://ror.org/014zrew76</idno>
          <orgName>Université d'Orléans</orgName>
          <orgName type="acronym">UO</orgName>
          <desc>
            <address>
              <addrLine>Château de la Source - Avenue du Parc Floral - BP 6749 - 45067 Orléans cedex 2</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-orleans.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-119036" status="VALID">
          <idno type="IdRef">033629676</idno>
          <idno type="ROR">https://ror.org/023znxa73</idno>
          <orgName>St Petersburg State University</orgName>
          <orgName type="acronym">SPbU</orgName>
          <desc>
            <address>
              <addrLine>7/9 Universitetskaya emb., St. Petersburg, 199034</addrLine>
              <country key="RU"/>
            </address>
            <ref type="url">http://english.spbu.ru</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>