{"id":"https://openalex.org/W2179404110","doi":"https://doi.org/10.1145/2493252.2493257","title":"High-confidence predictions under adversarial uncertainty","display_name":"High-confidence predictions under adversarial uncertainty","publication_year":2013,"publication_date":"2013-08-01","ids":{"openalex":"https://openalex.org/W2179404110","doi":"https://doi.org/10.1145/2493252.2493257","mag":"2179404110"},"language":"en","primary_location":{"id":"doi:10.1145/2493252.2493257","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2493252.2493257","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/6846d875-6b25-4d04-be6a-5742c051ea92","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037697309","display_name":"Andrew Drucker","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Andrew Drucker","raw_affiliation_strings":["MIT, Princeton, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Princeton, NJ","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037697309"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9882,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.83704802,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"5","issue":"3","first_page":"1","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9990000128746033,"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.9990000128746033,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9890000224113464,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6880905032157898},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5334442257881165},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5208102464675903},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5165325999259949},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5163635015487671},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45525914430618286},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4487454295158386},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.4371776282787323},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.41597115993499756},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4000460207462311},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3811633586883545},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21370869874954224},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.21238228678703308},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.21238064765930176}],"concepts":[{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6880905032157898},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5334442257881165},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5208102464675903},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5165325999259949},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5163635015487671},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45525914430618286},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4487454295158386},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4371776282787323},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.41597115993499756},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4000460207462311},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3811633586883545},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21370869874954224},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.21238228678703308},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.21238064765930176},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2493252.2493257","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2493252.2493257","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/6846d875-6b25-4d04-be6a-5742c051ea92","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/6846d875-6b25-4d04-be6a-5742c051ea92","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Drucker, A 2013, 'High-confidence predictions under adversarial uncertainty', TOCT, vol. 5, no. 3, pp. 12. https://doi.org/10.1145/2493252.2493257","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/6846d875-6b25-4d04-be6a-5742c051ea92","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/6846d875-6b25-4d04-be6a-5742c051ea92","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Drucker, A 2013, 'High-confidence predictions under adversarial uncertainty', TOCT, vol. 5, no. 3, pp. 12. https://doi.org/10.1145/2493252.2493257","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3517277967","display_name":null,"funder_award_id":"CCF-0832797, Sub-Contract No. 00001583, and DMS-0835373","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G4536153033","display_name":null,"funder_award_id":"CCF-0832797, Sub-Contract No. 00001583, and DMS-0835373","funder_id":"https://openalex.org/F4320337380","funder_display_name":"Division of Mathematical Sciences"}],"funders":[{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320337380","display_name":"Division of Mathematical Sciences","ror":"https://ror.org/051fftw81"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1611398386","https://openalex.org/W1664039392","https://openalex.org/W1813435591","https://openalex.org/W1964013156","https://openalex.org/W1995279130","https://openalex.org/W2023943903","https://openalex.org/W2094032074","https://openalex.org/W2118349518","https://openalex.org/W2129003318","https://openalex.org/W2294584261","https://openalex.org/W2312450606","https://openalex.org/W4240490791","https://openalex.org/W4255572858","https://openalex.org/W6656269481"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2032233321","https://openalex.org/W3121970507","https://openalex.org/W2110028391","https://openalex.org/W54497855","https://openalex.org/W217960748","https://openalex.org/W3125814499","https://openalex.org/W2090827041","https://openalex.org/W2148533276","https://openalex.org/W2094012830"],"abstract_inverted_index":{"We":[0,21,205,252],"study":[1,43],"the":[2,6,44,54,115,120,182,188,198,228,239,247,260,290,296,313,316,324],"setting":[3],"in":[4,90,236],"which":[5,91],"bits":[7,37,55,123,248,299],"of":[8,38,46,56,78,88,98,117,124,161,195,224,238,241,249,259,289,295,315],"an":[9,19,96],"unknown":[10],"infinite":[11],"binary":[12,282],"sequence":[13,155,229,283,321],"x":[14,28,39,57,125,130,156,162,196,230,250,284,322],"are":[15,234],"revealed":[16],"sequentially":[17],"to":[18,31,67,85,94,103,108,170,209,212,280,306,330],"observer.":[20],"show":[22,210],"that":[23,129,192],"very":[24],"limited":[25],"assumptions":[26,226,233],"about":[27,35],"allow":[29],"one":[30,65],"make":[32,68],"successful":[33],"predictions":[34],"unseen":[36],".":[40,58,231,251],"First,":[41],"we":[42,62,92,127,175,268],"problem":[45],"successfully":[47,213],"predicting":[48],"a":[49,69,76,86,105,147,159,215,221,242,257,270,281,287],"single":[50],"0":[51,160],"from":[52],"among":[53,119],"In":[59],"our":[60,79],"model,":[61],"have":[63],"only":[64],"chance":[66],"prediction,":[70],"but":[71],"may":[72],"do":[73],"so":[74],"at":[75],"time":[77,314],"choosing.":[80],"This":[81],"model":[82],"is":[83,131,146,328],"applicable":[84],"variety":[87],"situations":[89],"want":[93],"perform":[95,109,177],"action":[97],"fixed":[99,320],"duration,":[100],"and":[101,255,312],"need":[102],"predict":[104,214],"\u201csafe\u201d":[106],"time-interval":[107],"it.":[110],"Letting":[111],"N":[112,138,298,310],"t":[113,122,139],"denote":[114],"number":[116],"1s":[118],"first":[121],",":[126,157,285,309,311,323],"say":[128],"\u201c\u03b5-weakly":[132],"sparse\u201d":[133],"if":[134],"lim":[135],"inf":[136],"(":[137],"/t)":[140],"\u2264":[141],"\u03b5.":[142,173,204,337],"Our":[143],"main":[144],"result":[145,208],"randomized":[148,271],"algorithm":[149,273,304],"that,":[150,276],"given":[151,277],"any":[152,319],"\u03b5-weakly":[153],"sparse":[154],"predicts":[158],"with":[163,180,202,333],"success":[164,184],"probability":[165,185,203,334],"as":[166,168,186],"close":[167],"desired":[169],"1":[171,200,335],"-":[172,336],"Thus,":[174],"can":[176],"this":[178,207],"task":[179],"essentially":[181],"same":[183],"under":[187,220],"much":[189],"stronger":[190],"assumption":[191],"each":[193],"bit":[194,216],"takes":[197],"value":[199],"independently":[201],"apply":[206],"how":[211],"(0":[217],"or":[218],"1)":[219],"broad":[222],"class":[223],"possible":[225],"on":[227],"The":[232],"stated":[235],"terms":[237],"behavior":[240],"finite":[243],"automaton":[244],"M":[245],"reading":[246],"also":[253],"propose":[254],"solve":[256],"variant":[258],"well-studied":[261],"\u201cignorant":[262],"forecasting\u201d":[263],"problem.":[264],"For":[265,318],"every":[266],"\u03b5>0,":[267],"give":[269],"forecasting":[272],"S":[274],"\u03b5":[275],"sequential":[278],"access":[279],"makes":[286],"prediction":[288],"form:":[291],"\u201cA":[292],"p":[293,308,327],"fraction":[294,326],"next":[297],"will":[300],"be":[301],"1s.\u201d":[302],"(The":[303],"gets":[305],"choose":[307],"prediction.)":[317],"forecast":[325],"accurate":[329],"within":[331],"\u00b1\u03b5":[332]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2026-06-10T14:10:52.464848","created_date":"2025-10-10T00:00:00"}