{"id":"https://openalex.org/W7135187617","doi":"https://doi.org/10.48550/arxiv.2603.11764","title":"A Further Efficient Algorithm with Best-of-Both-Worlds Guarantees for $m$-Set Semi-Bandit Problem","display_name":"A Further Efficient Algorithm with Best-of-Both-Worlds Guarantees for $m$-Set Semi-Bandit Problem","publication_year":2026,"publication_date":"2026-03-12","ids":{"openalex":"https://openalex.org/W7135187617","doi":"https://doi.org/10.48550/arxiv.2603.11764"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.11764","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11764","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.11764","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128939007","display_name":"Botao Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Botao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129070385","display_name":"Jongyeong Lee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lee, Jongyeong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129077717","display_name":"Chansoo Kim","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kim, Chansoo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5127829622","display_name":"Junya Honda","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Honda, Junya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9488999843597412,"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":0.9488999843597412,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.01730000041425228,"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.007000000216066837,"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.7998999953269958},{"id":"https://openalex.org/keywords/resampling","display_name":"Resampling","score":0.43459999561309814},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.3199000060558319},{"id":"https://openalex.org/keywords/adversarial-system","display_name":"Adversarial system","score":0.3012999892234802},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2957000136375427}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7998999953269958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5214999914169312},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4821000099182129},{"id":"https://openalex.org/C150921843","wikidata":"https://www.wikidata.org/wiki/Q1170431","display_name":"Resampling","level":2,"score":0.43459999561309814},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35929998755455017},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3562000095844269},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.3199000060558319},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.3012999892234802},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.2799000144004822},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.26759999990463257}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.11764","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11764","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.11764","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.11764","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"the":[3,36,63,94,125,137,151,157,165],"optimality":[4,37,48,127],"and":[5,87,110],"complexity":[6,153],"of":[7,24,38,55,65,79,98,128,156],"Follow-the-Perturbed-Leader":[8],"(FTPL)":[9],"policy":[10],"in":[11,100,148],"$m$-set":[12,72,131,142],"semi-bandit":[13,132],"problems.":[14,133],"FTPL":[15,39,66,84,107,129],"has":[16,40,49],"been":[17,42,50],"studied":[18],"extensively":[19],"as":[20],"a":[21,76,114,118],"promising":[22],"candidate":[23],"an":[25],"efficient":[26,145],"algorithm":[27],"with":[28,67,85,90,108,113],"favorable":[29],"regret":[30,97,120,166],"for":[31,52,121,130,144],"adversarial":[32,101],"combinatorial":[33,80],"semi-bandits.":[34],"Nevertheless,":[35],"still":[41],"unknown":[43],"unlike":[44],"Follow-the-Regularized-Leader":[45],"(FTRL)":[46],"whose":[47],"proved":[51],"various":[53],"tasks":[54],"online":[56],"learning.":[57],"In":[58],"this":[59],"paper,":[60],"we":[61,135],"extend":[62,136],"analysis":[64],"geometric":[68,139,159],"resampling":[69,140,160],"(GR)":[70],"to":[71,141,161],"semi-bandits,":[73,81],"which":[74],"is":[75],"special":[77],"case":[78],"showing":[82],"that":[83,106],"Fr\u00e9chet":[86,109],"Pareto":[88,111],"distributions":[89,112],"certain":[91,115],"parameters":[92],"achieves":[93,117],"best":[95],"possible":[96],"$O(\\sqrt{mdT})$":[99],"setting.":[102],"We":[103],"also":[104],"show":[105],"parameter":[116],"logarithmic":[119],"stochastic":[122],"setting,":[123],"meaning":[124],"Best-of-Both-Worlds":[126],"Furthermore,":[134],"conditional":[138],"semi-bandits":[143],"loss":[146],"estimation":[147],"FTPL,":[149],"reducing":[150],"computational":[152],"from":[154],"$O(d^2)$":[155],"original":[158],"$O(md(\\log(d/m)+1))$":[162],"without":[163],"sacrificing":[164],"performance.":[167]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-14T00:00:00"}