{"id":"https://openalex.org/W260562682","doi":"https://doi.org/10.1023/a:1007472513967","title":"Tracking the Best Disjunction","display_name":"Tracking the Best Disjunction","publication_year":1998,"publication_date":"1998-08-01","ids":{"openalex":"https://openalex.org/W260562682","doi":"https://doi.org/10.1023/a:1007472513967","mag":"260562682"},"language":"en","primary_location":{"id":"doi:10.1023/a:1007472513967","is_oa":true,"landing_page_url":"https://doi.org/10.1023/a:1007472513967","pdf_url":"https://link.springer.com/content/pdf/10.1023/A:1007472513967.pdf","source":{"id":"https://openalex.org/S62148650","display_name":"Machine Learning","issn_l":"0885-6125","issn":["0885-6125","1573-0565"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Machine Learning","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1023/A:1007472513967.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073954294","display_name":"Peter Auer","orcid":"https://orcid.org/0000-0001-8385-9635"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"P. Auer","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Cruz, Santa Cruz, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108549518","display_name":"Manfred K. Warmuth","orcid":null},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.K. Warmuth","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Cruz, Santa Cruz, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073954294"],"corresponding_institution_ids":["https://openalex.org/I185103710"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.03628063,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"32","issue":"2","first_page":"127","last_page":"150"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9854000210762024,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.9757999777793884,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mistake","display_name":"Mistake","score":0.6932253837585449},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6764003038406372},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6225541234016418},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5657334327697754},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5098646879196167},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5056459903717041},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.4925733208656311},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.4848081171512604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4614142179489136},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45103439688682556},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.44783806800842285},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.1277616024017334}],"concepts":[{"id":"https://openalex.org/C2777179996","wikidata":"https://www.wikidata.org/wiki/Q911222","display_name":"Mistake","level":2,"score":0.6932253837585449},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6764003038406372},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6225541234016418},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5657334327697754},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5098646879196167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5056459903717041},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.4925733208656311},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.4848081171512604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4614142179489136},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45103439688682556},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.44783806800842285},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.1277616024017334},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1023/a:1007472513967","is_oa":true,"landing_page_url":"https://doi.org/10.1023/a:1007472513967","pdf_url":"https://link.springer.com/content/pdf/10.1023/A:1007472513967.pdf","source":{"id":"https://openalex.org/S62148650","display_name":"Machine Learning","issn_l":"0885-6125","issn":["0885-6125","1573-0565"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Machine Learning","raw_type":"journal-article"},{"id":"doi:10.1109/sfcs.1995.492487","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1995.492487","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of IEEE 36th Annual Foundations of Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.50.9252","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.9252","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.ucsc.edu/~manfred/pubs/trackdisj.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.88.1948","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.1948","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.ucsc.edu/~manfred/pubs/J40.pdf","raw_type":"text"},{"id":"mag:260562682","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc7.html#ECCC-TR00-070","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":{"id":"doi:10.1023/a:1007472513967","is_oa":true,"landing_page_url":"https://doi.org/10.1023/a:1007472513967","pdf_url":"https://link.springer.com/content/pdf/10.1023/A:1007472513967.pdf","source":{"id":"https://openalex.org/S62148650","display_name":"Machine Learning","issn_l":"0885-6125","issn":["0885-6125","1573-0565"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Machine Learning","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6299999952316284,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G6405476643","display_name":"Amortized Analysis for On-Line Learning Algorithms","funder_award_id":"9700201","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W260562682.pdf","grobid_xml":"https://content.openalex.org/works/W260562682.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W994102297","https://openalex.org/W1483114294","https://openalex.org/W1979675141","https://openalex.org/W2006863141","https://openalex.org/W2024591429","https://openalex.org/W2031979166","https://openalex.org/W2040870580","https://openalex.org/W2041204102","https://openalex.org/W2065861851","https://openalex.org/W2069317438","https://openalex.org/W2087614174","https://openalex.org/W2093825590","https://openalex.org/W2114704327","https://openalex.org/W2123959253","https://openalex.org/W2129113961","https://openalex.org/W3083047178","https://openalex.org/W4230234330","https://openalex.org/W4235920691","https://openalex.org/W4239123612","https://openalex.org/W4246994868","https://openalex.org/W4247131500","https://openalex.org/W4248175720","https://openalex.org/W6678851513","https://openalex.org/W6776565550","https://openalex.org/W6783228008","https://openalex.org/W7075666595"],"related_works":["https://openalex.org/W2114704327","https://openalex.org/W2087614174","https://openalex.org/W1503712225","https://openalex.org/W2157506390","https://openalex.org/W2611627047","https://openalex.org/W2168314852","https://openalex.org/W2161529474","https://openalex.org/W2136687243","https://openalex.org/W2094771962","https://openalex.org/W2083394445","https://openalex.org/W2012715465","https://openalex.org/W2010886500","https://openalex.org/W1974333170","https://openalex.org/W1724735345","https://openalex.org/W1546740833","https://openalex.org/W1535810436","https://openalex.org/W1533787913","https://openalex.org/W3106162655","https://openalex.org/W2041954531","https://openalex.org/W2065861851"],"abstract_inverted_index":{"Littlestone":[0],"developed":[1],"a":[2,34,62,70],"simple":[3],"deterministic":[4],"on-line":[5],"learning":[6,9],"algorithm":[7,13,48,101,119,165],"for":[8,20,43,49,112,144],"k-literal":[10],"disjunctions.":[11],"This":[12,118],"(called":[14],"$${WINNOW}$$":[15],")":[16],"keeps":[17],"one":[18,94],"weight":[19],"each":[21],"of":[22,37,46,72,85,116,127,163,172,187],"then":[23],"variables":[24],"and":[25,40,77,180],"does":[26],"multiplicative":[27],"updates":[28],"to":[29,123],"its":[30],"weights.":[31],"We":[32],"develop":[33,99],"randomized":[35],"version":[36],"$${WINNOW}":[38],"$$":[39,68],"prove":[41],"bounds":[42,148,157,162],"an":[44,100,113],"adaptation":[45],"the":[47,50,53,78,82,91,97,108,125,128,136,140,160,167,173,177,182,188],"case":[51,61],"when":[52],"disjunction":[54,65,110,130],"may":[55],"change":[56],"over":[57],"time.":[58],"In":[59,152],"this":[60],"possible":[63],"target":[64],"schedule":[66,111],"$${\\mathcal{T}}":[67],"is":[69,81,131],"sequence":[71,115],"disjunctions":[73,92],"(one":[74],"per":[75],"trial)":[76],"shift":[79],"size":[80],"total":[83],"number":[84],"literals":[86],"that":[87,102,120,159],"are":[88],"added/removed":[89],"from":[90],"as":[93,105,107],"progresses":[95],"through":[96],"sequence.We":[98],"predicts":[103],"nearly":[104],"well":[106],"best":[109,129],"arbitrary":[114],"examples.":[117],"allows":[121],"us":[122],"track":[124],"predictions":[126],"hardly":[132],"more":[133],"complex":[134],"than":[135],"original":[137],"version.":[138],"However,":[139],"amortized":[141],"analysis":[142],"needed":[143],"obtaining":[145],"worst-case":[146],"mistake":[147,178],"requires":[149],"new":[150],"techniques.":[151],"some":[153],"cases":[154],"our":[155,164,195],"lower":[156],"show":[158],"upper":[161],"have":[166],"right":[168,183],"constant":[169,184],"in":[170,176,185],"front":[171,186],"leading":[174,190],"term":[175],"bound":[179],"almost":[181],"second":[189],"term.":[191],"Computer":[192],"experiments":[193],"support":[194],"theoretical":[196],"findings.":[197]},"counts_by_year":[{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}