{"id":"https://openalex.org/W2568832377","doi":"https://doi.org/10.1109/isit.2012.6284689","title":"Efficient tracking of large classes of experts","display_name":"Efficient tracking of large classes of experts","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2568832377","doi":"https://doi.org/10.1109/isit.2012.6284689","mag":"2568832377"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2012.6284689","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6284689","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041609088","display_name":"Andr\u00e1s Gy\u00f6rgy","orcid":"https://orcid.org/0000-0003-0586-4337"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Andras Gyorgy","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090728745","display_name":"Tam\u00e1s Linder","orcid":"https://orcid.org/0000-0001-9993-816X"},"institutions":[{"id":"https://openalex.org/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Tamas Linder","raw_affiliation_strings":["Department of Mathematics and Statistics, Queen's University, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, Queen's University, Canada","institution_ids":["https://openalex.org/I204722609"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034680608","display_name":"G\u00e1bor Lugosi","orcid":"https://orcid.org/0000-0003-1614-5901"},"institutions":[{"id":"https://openalex.org/I11932220","display_name":"Instituci\u00f3 Catalana de Recerca i Estudis Avan\u00e7ats","ror":"https://ror.org/0371hy230","country_code":"ES","type":"nonprofit","lineage":["https://openalex.org/I11932220"]},{"id":"https://openalex.org/I170486558","display_name":"Universitat Pompeu Fabra","ror":"https://ror.org/04n0g0b29","country_code":"ES","type":"education","lineage":["https://openalex.org/I170486558"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Gabor Lugosi","raw_affiliation_strings":["ICREA and Department of Economics, Pompeu Fabra University, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ICREA and Department of Economics, Pompeu Fabra University, Spain","institution_ids":["https://openalex.org/I11932220","https://openalex.org/I170486558"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8972,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.78060306,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"885","last_page":"889"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9987999796867371,"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/T12288","display_name":"Optimization and Search Problems","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/regret","display_name":"Regret","score":0.8837045431137085},{"id":"https://openalex.org/keywords/hindsight-bias","display_name":"Hindsight bias","score":0.7786111831665039},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.6037417650222778},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5339084267616272},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4837934672832489},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.46997588872909546},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.46621519327163696},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4633643329143524},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4459029734134674},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4213709235191345},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4127199053764343},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3447917401790619},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3432755470275879},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3227892220020294},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3050425052642822},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2736629247665405},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.13380593061447144}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8837045431137085},{"id":"https://openalex.org/C10347200","wikidata":"https://www.wikidata.org/wiki/Q1960297","display_name":"Hindsight bias","level":2,"score":0.7786111831665039},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.6037417650222778},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5339084267616272},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4837934672832489},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.46997588872909546},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.46621519327163696},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4633643329143524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4459029734134674},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4213709235191345},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4127199053764343},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3447917401790619},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3432755470275879},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3227892220020294},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3050425052642822},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2736629247665405},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.13380593061447144},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C180747234","wikidata":"https://www.wikidata.org/wiki/Q23373","display_name":"Cognitive psychology","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2012.6284689","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6284689","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1570963478","https://openalex.org/W1931853727","https://openalex.org/W1970041563","https://openalex.org/W2096352571","https://openalex.org/W2102179694","https://openalex.org/W2105236698","https://openalex.org/W2110148350","https://openalex.org/W2120705090","https://openalex.org/W2133472798","https://openalex.org/W2137154577","https://openalex.org/W2144740475","https://openalex.org/W2149882723","https://openalex.org/W2149988068","https://openalex.org/W2158455534","https://openalex.org/W2163017424","https://openalex.org/W2163294786","https://openalex.org/W2568832377","https://openalex.org/W2622469480","https://openalex.org/W3023091043","https://openalex.org/W4237769433","https://openalex.org/W6640331321","https://openalex.org/W6677849270"],"related_works":["https://openalex.org/W3197854638","https://openalex.org/W3140454661","https://openalex.org/W4245029315","https://openalex.org/W2139970489","https://openalex.org/W1492315459","https://openalex.org/W1512434910","https://openalex.org/W2540910169","https://openalex.org/W3148904318","https://openalex.org/W2022803902","https://openalex.org/W2105474389"],"abstract_inverted_index":{"In":[0,81],"the":[1,31,46,50,55,71,74,92,125,136,162,189],"framework":[2],"of":[3,17,33,76,100,120,135,148],"prediction":[4,10,68,87],"with":[5,84,108,183,195],"expert":[6,37,94],"advice":[7,32],"we":[8,96,175],"consider":[9],"algorithms":[11,69,103],"that":[12,20,104,119],"compete":[13],"against":[14],"a":[15,23,34,98,133,145],"class":[16],"switching":[18,57,184],"strategies":[19],"can":[21,105],"segment":[22],"given":[24],"sequence":[25],"into":[26],"several":[27],"blocks":[28],"and":[29,110,128,155],"follow":[30],"different":[35],"\u201cbase\u201d":[36],"in":[38,60],"each":[39],"block.":[40],"The":[41],"performance":[42],"is":[43,64,79,124,132],"measured":[44],"by":[45],"regret":[47,146,172,193],"defined":[48],"as":[49],"excess":[51],"loss":[52],"relative":[53],"to":[54,65],"best":[56],"strategy":[58],"selected":[59],"hindsight.":[61],"Our":[62],"goal":[63],"construct":[66],"low-complexity":[67],"for":[70,91,151,165,169,179,200],"case":[72],"where":[73,122],"set":[75],"base":[77,93],"experts":[78],"large.":[80],"particular,":[82],"starting":[83],"an":[85],"arbitrary":[86],"algorithm":[88,143],"A":[89,139],"designed":[90],"class,":[95],"derive":[97],"family":[99],"efficient":[101],"tracking":[102],"be":[106],"implemented":[107],"time":[109,126,196],"space":[111],"complexity":[112,197],"only":[113,156],"O(\u03b7\u03b3In":[114],"n)":[115,158,192,199],"times":[116,159],"larger":[117,160],"than":[118,161],"A,":[121],"n":[123],"horizon":[127],"\u03b3":[129,152,166,202],"\u2265":[130],"0":[131,168],"parameter":[134],"algorithm.":[137],"With":[138],"properly":[140],"chosen,":[141],"our":[142,186],"achieves":[144,188],"bound":[147,173],"optimal":[149,163,190],"order":[150,164],">;":[153],"0,":[154],"O(ln":[157,191],"=":[167],"all":[170],"typical":[171],"types":[174],"examined.":[176],"For":[177],"example,":[178],"predicting":[180],"binary":[181],"sequences":[182],"parameters,":[185],"method":[187],"rate":[194],"O(n1+\u03b3In":[198],"any":[201],"\u03f5":[203],"(0,1).":[204]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}