{"id":"https://openalex.org/W3027847404","doi":"https://doi.org/10.1137/19m1247115","title":"Greedy Algorithm Almost Dominates in Smoothed Contextual Bandits","display_name":"Greedy Algorithm Almost Dominates in Smoothed Contextual Bandits","publication_year":2023,"publication_date":"2023-04-12","ids":{"openalex":"https://openalex.org/W3027847404","doi":"https://doi.org/10.1137/19m1247115","mag":"3027847404"},"language":"en","primary_location":{"id":"doi:10.1137/19m1247115","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1247115","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/1721.1/165369","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052541789","display_name":"Manish Raghavan","orcid":"https://orcid.org/0000-0002-4155-8145"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Manish Raghavan","raw_affiliation_strings":["Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA 02142 USA"],"raw_orcid":"https://orcid.org/0000-0002-4155-8145","affiliations":[{"raw_affiliation_string":"Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA 02142 USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058550942","display_name":"Aleksandrs Slivkins","orcid":"https://orcid.org/0000-0001-6899-6383"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Aleksandrs Slivkins","raw_affiliation_strings":["Microsoft Research, New York, NY 10011 USA"],"raw_orcid":"https://orcid.org/0000-0001-6899-6383","affiliations":[{"raw_affiliation_string":"Microsoft Research, New York, NY 10011 USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043117896","display_name":"Jennifer Wortman Vaughan","orcid":"https://orcid.org/0000-0002-7807-2018"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Jennifer Wortman Vaughan","raw_affiliation_strings":["Microsoft Research, New York, NY 10011 USA"],"raw_orcid":"https://orcid.org/0000-0002-7807-2018","affiliations":[{"raw_affiliation_string":"Microsoft Research, New York, NY 10011 USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001070941","display_name":"Zhiwei Steven Wu","orcid":"https://orcid.org/0000-0002-8125-8227"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhiwei Steven Wu","raw_affiliation_strings":["School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213 USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5052541789"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":1.4793,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.82350775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"52","issue":"2","first_page":"487","last_page":"524"},"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/T10603","display_name":"Smart Grid Energy Management","score":0.988099992275238,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9783999919891357,"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/greedy-algorithm","display_name":"Greedy algorithm","score":0.7970020771026611},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.7744223475456238},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6448075771331787},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5710271596908569},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5427508354187012},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.5147552490234375},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49333420395851135},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.48558658361434937},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4644468128681183},{"id":"https://openalex.org/keywords/thompson-sampling","display_name":"Thompson sampling","score":0.4522658884525299},{"id":"https://openalex.org/keywords/smoothness","display_name":"Smoothness","score":0.45127785205841064},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27840813994407654},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.20975470542907715},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20483261346817017}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7970020771026611},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7744223475456238},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6448075771331787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5710271596908569},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5427508354187012},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.5147552490234375},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49333420395851135},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.48558658361434937},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4644468128681183},{"id":"https://openalex.org/C73602740","wikidata":"https://www.wikidata.org/wiki/Q7795822","display_name":"Thompson sampling","level":3,"score":0.4522658884525299},{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.45127785205841064},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27840813994407654},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.20975470542907715},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20483261346817017},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/19m1247115","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1247115","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/165369","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/165369","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Society for Industrial & Applied Mathematics (SIAM)","raw_type":"http://purl.org/eprint/type/JournalArticle"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/165369","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/165369","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Society for Industrial & Applied Mathematics (SIAM)","raw_type":"http://purl.org/eprint/type/JournalArticle"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1487320471","https://openalex.org/W1560153690","https://openalex.org/W1687714866","https://openalex.org/W1958090791","https://openalex.org/W2034053794","https://openalex.org/W2088658556","https://openalex.org/W2098258765","https://openalex.org/W2107411554","https://openalex.org/W2112420033","https://openalex.org/W2119738618","https://openalex.org/W2149247676","https://openalex.org/W2167077875","https://openalex.org/W2168405694","https://openalex.org/W2606098075","https://openalex.org/W2614208603","https://openalex.org/W2786227661","https://openalex.org/W2805596211","https://openalex.org/W2913317949","https://openalex.org/W2950929549","https://openalex.org/W2964035670","https://openalex.org/W2964080237","https://openalex.org/W3044872185","https://openalex.org/W3098045837","https://openalex.org/W3123989359","https://openalex.org/W3124617746","https://openalex.org/W4206275166","https://openalex.org/W4206530644","https://openalex.org/W4312465470","https://openalex.org/W4376256773"],"related_works":["https://openalex.org/W1850547517","https://openalex.org/W2277088917","https://openalex.org/W4280543056","https://openalex.org/W2964125852","https://openalex.org/W2154172459","https://openalex.org/W2541760731","https://openalex.org/W2018096104","https://openalex.org/W3176022311","https://openalex.org/W1827895227","https://openalex.org/W2373750984"],"abstract_inverted_index":{"Online":[0],"learning":[1],"algorithms,":[2],"widely":[3],"used":[4],"to":[5,26,32,51,103],"power":[6],"search":[7],"and":[8,16],"content":[9],"optimization":[10],"onthe":[11],"web,":[12],"must":[13],"balance":[14],"exploration":[15,44,76],"exploitation,":[17],"potentially":[18],"sacrificing":[19],"the":[20,36,52,72,86,90,94,106,111,121,126,138,157,161,170,175],"experience":[21],"of":[22,48,83,89,116,145,160],"currentusers":[23],"in":[24,35,71,93,169],"order":[25],"gain":[27],"information":[28],"that":[29,61,105,134,152],"will":[30],"lead":[31],"better":[33],"decisions":[34],"future.":[37],"While":[38],"necessary":[39],"inthe":[40],"worst":[41,171],"case,":[42,172],"explicit":[43,75],"has":[45],"a":[46,81,143,154],"number":[47],"disadvantages":[49],"compared":[50],"greedy":[53,91,107,139,162],"algorithmthat":[54],"always":[55],"``exploits\"\"":[56],"by":[57,137],"choosing":[58],"an":[59],"action":[60],"currently":[62],"looks":[63],"optimal.":[64],"We":[65,78],"determine":[66],"under":[67,153],"whatconditions":[68],"inherent":[69],"diversity":[70],"data":[73,135],"makes":[74],"unnecessary.":[77],"build":[79],"on":[80,85,100,120],"recentline":[82],"work":[84],"smoothed":[87],"analysis":[88],"algorithm":[92,108,119,140,163],"linear":[95],"contextual":[96],"bandits":[97],"model.We":[98],"improve":[99],"prior":[101],"results":[102],"show":[104],"almost":[109],"matches":[110],"best":[112],"possibleBayesian":[113],"regret":[114,159],"rate":[115],"any":[117,146],"other":[118,147],"same":[122],"problem":[123],"instance":[124],"whenever":[125],"diversityconditions":[127],"hold.":[128],"The":[129],"key":[130],"technical":[131],"finding":[132],"is":[133,164,174],"collected":[136],"sufficesto":[141],"simulate":[142],"run":[144],"algorithm.":[148],"Further,":[149],"we":[150],"prove":[151],"particular":[155],"smoothnessassumption,":[156],"Bayesian":[158],"at":[165],"most":[166],"\\~O(T":[167],"1/3)":[168],"whereT":[173],"time":[176],"horizon.":[177]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}