<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-18T19:35:58Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/81761" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/81761</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_10761</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_10755</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Gerald DeJong</dc:contributor>
          <dc:creator>Epshteyn, Arkady</dc:creator>
          <dc:date>2015-09-25T20:20:20Z</dc:date>
          <dc:date>2015-09-25T20:20:20Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2007</dc:date>
          <dc:date>2007</dc:date>
          <dc:description>We explore this task in three contexts: classification (determining the subject of a newsgroup posting), control (learning to perform tasks such as driving a car up a mountain in simulation), and optimization (optimizing performance of linear algebra operations on different hardware platforms). For the text categorization problem, we introduce a novel algorithm which efficiently integrates prior knowledge into large margin classification. For reinforcement learning, we introduce a novel framework for defining and solving planning problems in terms of qualitative statements about the world. In compiler optimization, Bayesian prior based on an analytic model of hardware is combined with empirical measurements of performance of optimized code to determine the maximum-a-posteriori estimates of the optimization parameters.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:20:20Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
3269889.pdf: 3876494 bytes, checksum: f17461cb5d5dba04569aacb0a57920b1 (MD5)
  Previous issue date: 2007</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 83042
Lift date: Forever
Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:description>114 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/81761</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI3269889</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Artificial Intelligence</dc:subject>
          <dc:title>Combining Prior Knowledge and Data: Beyond the Bayesian Framework</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Computer Science</department>
            <discipline>Computer Science</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
