{"id":"https://openalex.org/W2963529400","doi":"https://doi.org/10.1109/isit.2018.8437541","title":"Online Learning with Graph-Structured Feedback against Adaptive Adversaries","display_name":"Online Learning with Graph-Structured Feedback against Adaptive Adversaries","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2963529400","doi":"https://doi.org/10.1109/isit.2018.8437541","mag":"2963529400"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437541","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437541","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","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/A5075312638","display_name":"Zhili Feng","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zhili Feng","raw_affiliation_strings":["Departments of Computer Science, University of Wisconsin, Madison Madison, WI"],"affiliations":[{"raw_affiliation_string":"Departments of Computer Science, University of Wisconsin, Madison Madison, WI","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023368186","display_name":"Po\u2010Ling Loh","orcid":"https://orcid.org/0000-0002-6514-7834"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Po-Ling Loh","raw_affiliation_strings":["Departments of Statistics, University of Wisconsin, Madison Madison, WI"],"affiliations":[{"raw_affiliation_string":"Departments of Statistics, University of Wisconsin, Madison Madison, WI","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075312638"],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":null,"apc_paid":null,"fwci":1.0588,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.81112462,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"931","last_page":"935"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9958000183105469,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9950000047683716,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6789305210113525},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6650509834289551},{"id":"https://openalex.org/keywords/observable","display_name":"Observable","score":0.5375210046768188},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.533643364906311},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.5171239376068115},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5159221887588501},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.512927770614624},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4823395907878876},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4589560627937317},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.44262591004371643},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42288094758987427},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.332925409078598},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2931026816368103},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.16509532928466797},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.149892657995224},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09604540467262268},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.07378914952278137}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6789305210113525},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6650509834289551},{"id":"https://openalex.org/C32848918","wikidata":"https://www.wikidata.org/wiki/Q845789","display_name":"Observable","level":2,"score":0.5375210046768188},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.533643364906311},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.5171239376068115},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5159221887588501},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.512927770614624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4823395907878876},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4589560627937317},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.44262591004371643},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42288094758987427},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.332925409078598},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2931026816368103},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.16509532928466797},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.149892657995224},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09604540467262268},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.07378914952278137},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2018.8437541","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437541","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","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":25,"referenced_works":["https://openalex.org/W100643516","https://openalex.org/W177617673","https://openalex.org/W1570963478","https://openalex.org/W1577927781","https://openalex.org/W1794753160","https://openalex.org/W1964631708","https://openalex.org/W1987292194","https://openalex.org/W2051645349","https://openalex.org/W2101177173","https://openalex.org/W2101379030","https://openalex.org/W2109690147","https://openalex.org/W2124387605","https://openalex.org/W2143140272","https://openalex.org/W2157140780","https://openalex.org/W2161704742","https://openalex.org/W2169401877","https://openalex.org/W2561282814","https://openalex.org/W2951945213","https://openalex.org/W2962927562","https://openalex.org/W2963200117","https://openalex.org/W2963389158","https://openalex.org/W2963529400","https://openalex.org/W6607198235","https://openalex.org/W6638159179","https://openalex.org/W6681183089"],"related_works":["https://openalex.org/W2971351794","https://openalex.org/W4376155396","https://openalex.org/W1947085858","https://openalex.org/W2174986909","https://openalex.org/W2527791220","https://openalex.org/W2101991911","https://openalex.org/W2155070487","https://openalex.org/W4311589891","https://openalex.org/W3123835761","https://openalex.org/W118270247"],"abstract_inverted_index":{"We":[0,30,93],"derive":[1],"upper":[2,32],"and":[3,40,48,107],"lower":[4,77,120],"bounds":[5,33],"for":[6,46],"the":[7,19,58,62,88,96],"policy":[8],"regret":[9],"of":[10,34,57,69,79,90,100,122],"T-round":[11],"online":[12],"learning":[13],"problems":[14],"with":[15,104],"graph-structured":[16],"feedback,":[17],"where":[18],"adversary":[20,63,103],"is":[21,64,85],"nonoblivious":[22],"but":[23],"assumed":[24],"to":[25],"have":[26],"a":[27,55,66,75,112,119],"bounded":[28,67],"memory.":[29],"obtain":[31],"O~(T":[35],"<sup":[36,42,81,124],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[37,43,82,125],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2/3</sup>":[38,83,126],")":[39,45,84],"\u00d5(T":[41],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">3/4</sup>":[44],"strongly-observable":[47,115],"weakly-observable":[49],"graphs,":[50],"respectively,":[51],"based":[52],"on":[53],"analyzing":[54],"variant":[56],"Exp3":[59],"algorithm.":[60],"When":[61],"allowed":[65],"memory":[68],"size":[70],"1,":[71],"we":[72],"show":[73,108],"that":[74,109],"matching":[76],"bound":[78,121],"\u03a9\u0303(T":[80,123],"achieved":[86],"in":[87,110],"case":[89],"full-information":[91],"feedback.":[92],"also":[94],"study":[95],"particular":[97],"loss":[98],"structure":[99],"an":[101],"oblivious":[102],"switching":[105],"costs,":[106],"such":[111],"setting,":[113],"non-revealing":[114],"feedback":[116],"graphs":[117],"achieve":[118],"),":[127],"as":[128],"well.":[129]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}