<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/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-11-22T10:43:52Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/31116" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/31116</identifier><datestamp>2026-05-14T13:53:00Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Karampatziakis, Nikolaos</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair" lang="en_US">Kozen, Dexter Campbell</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Hooker, Giles J.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Joachims, Thorsten</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Kleinberg, Robert David</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2013-01-31T19:44:22Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2017-12-20T07:00:24Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2012-08-20</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/31116</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">7959860</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">This thesis studies three problems in online learning. For all the problems the proposed solutions are simple yet non-trivial adaptations of existing online machine learning algorithms. For the task of sequential prediction, a modified multiplicative update algorithm that produces small and accurate models is proposed. This algorithm makes no assumption about the complexity of the source that produces the given sequence. For the task of online learning when examples have varying importances, the proposed algorithm is a version of gradient descent in continuous time. Finally, for the task of efficient online active learning, the implementation we provide makes use of many shortcuts. These include replacing a batch learning algorithm with an online one, as well as a creative use of the aforementioned continuous time gradient descent to compute the desirability of asking for the label of a given example. As this thesis shows, online machine learning algorithms can be easily adapted to many new problems.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">machine learning</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">online learning</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">active learning</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Online Learning Algorithms For Sequence Prediction, Importance Weighted Classification, And Active Learning</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Computer Science</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor" lang="en_US">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Computer Science</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author" lang="en_US">Karampatziakis, Nikolaos</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="3e6108a6-5fa5-4406-ac87-6b5d9e38224f">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en_US&lt;/Language>
   	&lt;Title>Online Learning Algorithms For Sequence Prediction, Importance Weighted Classification, And Active Learning&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2012-08-20&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Karampatziakis, Nikolaos&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>machine learning&lt;/Keyword>
    &lt;Keyword>online learning&lt;/Keyword>
    &lt;Keyword>active learning&lt;/Keyword>
   	&lt;Abstract>This thesis studies three problems in online learning. For all the problems the proposed solutions are simple yet non-trivial adaptations of existing online machine learning algorithms. For the task of sequential prediction, a modified multiplicative update algorithm that produces small and accurate models is proposed. This algorithm makes no assumption about the complexity of the source that produces the given sequence. For the task of online learning when examples have varying importances, the proposed algorithm is a version of gradient descent in continuous time. Finally, for the task of efficient online active learning, the implementation we provide makes use of many shortcuts. These include replacing a batch learning algorithm with an online one, as well as a creative use of the aforementioned continuous time gradient descent to compute the desirability of asking for the label of a given example. As this thesis shows, online machine learning algorithms can be easily adapted to many new problems.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>