{"id":"https://openalex.org/W2768052549","doi":"https://doi.org/10.1145/3188745.3188798","title":"k-server via multiscale entropic regularization","display_name":"k-server via multiscale entropic regularization","publication_year":2018,"publication_date":"2018-06-20","ids":{"openalex":"https://openalex.org/W2768052549","doi":"https://doi.org/10.1145/3188745.3188798","mag":"2768052549"},"language":"en","primary_location":{"id":"doi:10.1145/3188745.3188798","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3188745.3188798","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188798","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188798","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021842384","display_name":"S\u00e9bastien Bubeck","orcid":"https://orcid.org/0000-0001-9122-4410"},"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S\u00e9bastien Bubeck","raw_affiliation_strings":["Microsoft Research, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059735243","display_name":"Michael B. Cohen","orcid":"https://orcid.org/0000-0002-7388-6936"},"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":false,"raw_author_name":"Michael B. Cohen","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Yin Tat Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yin Tat Lee","raw_affiliation_strings":["University of Washington, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington, USA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":null,"display_name":"James R. Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James R. Lee","raw_affiliation_strings":["University of Washington, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington, USA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032574693","display_name":"Aleksander M\u0105dry","orcid":null},"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":false,"raw_author_name":"Aleksander M\u0105dry","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3","last_page":"16"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9984999895095825,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9930999875068665,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7040784358978271},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.665032684803009},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.6565976142883301},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6293304562568665},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.5912614464759827},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5524536371231079},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5042256116867065},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5005083084106445},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4824524521827698},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.47365602850914},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4322141110897064},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3678116500377655},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36478132009506226},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2763240337371826},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.16054809093475342},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.15523099899291992},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.1245240569114685},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11099639534950256}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7040784358978271},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.665032684803009},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.6565976142883301},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6293304562568665},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.5912614464759827},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5524536371231079},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5042256116867065},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5005083084106445},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4824524521827698},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.47365602850914},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4322141110897064},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3678116500377655},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36478132009506226},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2763240337371826},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.16054809093475342},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.15523099899291992},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.1245240569114685},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11099639534950256},{"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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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":5,"locations":[{"id":"doi:10.1145/3188745.3188798","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3188745.3188798","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188798","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1711.01085","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1711.01085","pdf_url":"https://arxiv.org/pdf/1711.01085","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2768052549","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1711.01085.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:dspace.mit.edu:1721.1/137726","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/137726","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-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv","raw_type":"http://purl.org/eprint/type/ConferencePaper"},{"id":"doi:10.48550/arxiv.1711.01085","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1711.01085","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.1145/3188745.3188798","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3188745.3188798","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3188745.3188798","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1906418360","display_name":"TRIPODS: Algorithms for Data Science: Complexity, Scalability, and Robustness.","funder_award_id":"1740551","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2798763028","display_name":"CAREER: The Interplay between Combinatorial Optimization and Algorithmic Convex Geometry","funder_award_id":"1749609","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2816039220","display_name":"AF: Small: Entropy Maximization in Approximation, Learning, and Complexity","funder_award_id":"1616297","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3329116365","display_name":"CAREER: Fast Graph Algorithms and Continuous Optimization","funder_award_id":"1553428","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3869665861","display_name":null,"funder_award_id":"CCF-1553428","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7116278599","display_name":null,"funder_award_id":"CCF-1749609","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G874486094","display_name":null,"funder_award_id":"CCF-1740551","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"},{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2768052549.pdf","grobid_xml":"https://content.openalex.org/works/W2768052549.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1514218977","https://openalex.org/W1923724101","https://openalex.org/W1974264551","https://openalex.org/W1981660486","https://openalex.org/W2007840228","https://openalex.org/W2033156334","https://openalex.org/W2041571997","https://openalex.org/W2054033098","https://openalex.org/W2062780596","https://openalex.org/W2069255833","https://openalex.org/W2082099352","https://openalex.org/W2083392624","https://openalex.org/W2086989193","https://openalex.org/W2089998595","https://openalex.org/W2100311357","https://openalex.org/W2113184918","https://openalex.org/W2120872275","https://openalex.org/W2408313839","https://openalex.org/W2513180554","https://openalex.org/W2571257893","https://openalex.org/W2963326510","https://openalex.org/W3030774092","https://openalex.org/W4205841652","https://openalex.org/W4206742934"],"related_works":["https://openalex.org/W1974264551","https://openalex.org/W2949774048","https://openalex.org/W2012931756","https://openalex.org/W2283454896","https://openalex.org/W2963798749","https://openalex.org/W2274470399","https://openalex.org/W2162487598","https://openalex.org/W2770043510","https://openalex.org/W2526129283","https://openalex.org/W1912730616","https://openalex.org/W3048914833","https://openalex.org/W2127235804","https://openalex.org/W2151543040","https://openalex.org/W2034131445","https://openalex.org/W3044548828","https://openalex.org/W1502528314","https://openalex.org/W2950456228","https://openalex.org/W2049800808","https://openalex.org/W2971774981","https://openalex.org/W2951909831"],"abstract_inverted_index":{"We":[0,75],"present":[1],"an":[2,66,84],"O((logk)2)-competitive":[3],"randomized":[4,20],"algorithm":[5,21,37,69,87],"for":[6,22],"the":[7,17,24,30,33,41,48,93,96],"k-server":[8],"problem":[9],"on":[10,70,88],"hierarchically":[11],"separated":[12],"trees":[13],"(HSTs).":[14],"This":[15],"is":[16,27,38,51,102],"first":[18],"o(k)-competitive":[19],"which":[23],"competitive":[25],"ratio":[26,94],"independent":[28],"of":[29,32,43,95],"size":[31],"underlying":[34],"HST.":[35],"Our":[36],"designed":[39],"in":[40],"framework":[42],"online":[44],"mirror":[45,49],"descent":[46],"where":[47,92],"map":[50],"a":[52,77],"multiscale":[53],"entropy.":[54],"When":[55],"combined":[56],"with":[57],"Bartal\u2019s":[58],"static":[59],"HST":[60,80],"embedding":[61,81],"reduction,":[62],"this":[63],"leads":[64],"to":[65,98],"O((logk)2":[67],"logn)-competitive":[68],"any":[71,89],"n-point":[72],"metric":[73,90],"space.":[74],"give":[76],"new":[78],"dynamic":[79],"that":[82],"yields":[83],"O((logk)3":[85],"log\u0394)-competitive":[86],"space":[91],"largest":[97],"smallest":[99],"non-zero":[100],"distance":[101],"at":[103],"most":[104],"\u0394.":[105]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}