{"id":"https://openalex.org/W2994309015","doi":"https://doi.org/10.1109/allerton.2019.8919740","title":"Stochastic Gradient Descent on a Tree: an Adaptive and Robust Approach to Stochastic Convex Optimization","display_name":"Stochastic Gradient Descent on a Tree: an Adaptive and Robust Approach to Stochastic Convex Optimization","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2994309015","doi":"https://doi.org/10.1109/allerton.2019.8919740","mag":"2994309015"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2019.8919740","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2019.8919740","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/A5009337709","display_name":"Sattar Vakili","orcid":"https://orcid.org/0000-0001-7085-1191"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sattar Vakili","raw_affiliation_strings":["Prowler.io,Cambridge,UK","Prowler.io, Cambridge, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Prowler.io,Cambridge,UK","institution_ids":[]},{"raw_affiliation_string":"Prowler.io, Cambridge, UK","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016254331","display_name":"Sudeep Salgia","orcid":"https://orcid.org/0000-0003-1361-4565"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sudeep Salgia","raw_affiliation_strings":["Cornell University,School of Electrical & Computer Engineering,Ithaca,NY","School of Electrical & Computer Engineering, Cornell University, Ithaca, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University,School of Electrical & Computer Engineering,Ithaca,NY","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"School of Electrical & Computer Engineering, Cornell University, Ithaca, NY","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013788255","display_name":"Qing Zhao","orcid":"https://orcid.org/0000-0002-9590-4285"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Qing Zhao","raw_affiliation_strings":["Cornell University,School of Electrical & Computer Engineering,Ithaca,NY","School of Electrical & Computer Engineering, Cornell University, Ithaca, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University,School of Electrical & Computer Engineering,Ithaca,NY","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"School of Electrical & Computer Engineering, Cornell University, Ithaca, NY","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8233,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77878788,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"4","issue":null,"first_page":"432","last_page":"438"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9998000264167786,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9976000189781189,"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/mathematics","display_name":"Mathematics","score":0.6511607766151428},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.5208930969238281},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.49710872769355774},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.4895492494106293},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46561765670776367},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.4382408857345581},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2986491620540619},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2670171558856964},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1240229606628418},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09475171566009521}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6511607766151428},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.5208930969238281},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.49710872769355774},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.4895492494106293},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46561765670776367},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.4382408857345581},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2986491620540619},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2670171558856964},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1240229606628418},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09475171566009521},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2019.8919740","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2019.8919740","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5199999809265137,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1516903196","https://openalex.org/W1984257786","https://openalex.org/W1994616650","https://openalex.org/W2009797711","https://openalex.org/W2010189695","https://openalex.org/W2043382637","https://openalex.org/W2077723394","https://openalex.org/W2096840748","https://openalex.org/W2097487180","https://openalex.org/W2103446957","https://openalex.org/W2112269233","https://openalex.org/W2115519224","https://openalex.org/W2120090487","https://openalex.org/W2137677949","https://openalex.org/W2513180554","https://openalex.org/W2565106257","https://openalex.org/W2798819731","https://openalex.org/W2963433607","https://openalex.org/W2975107048","https://openalex.org/W2994309015","https://openalex.org/W4205841652","https://openalex.org/W4299544174","https://openalex.org/W4301435544","https://openalex.org/W6630841318","https://openalex.org/W6674560329","https://openalex.org/W6676963778","https://openalex.org/W6678102440"],"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/W4224283687"],"abstract_inverted_index":{"Online":[0],"minimization":[1],"of":[2,24,27,38,52,61,75,96,99,106,128,180,200,208],"an":[3,88],"unknown":[4,150],"convex":[5],"function":[6,29,63,101,151,202],"over":[7],"the":[8,25,28,36,39,50,57,62,66,72,76,97,100,107,121,126,129,161,190,198,201,206],"interval":[9],"[0,":[10],"1]":[11],"is":[12,102,110,139],"considered":[13],"under":[14],"first-order":[15],"stochastic":[16,192],"bandit":[17],"feedback,":[18],"which":[19,196],"returns":[20],"a":[21,42,83,113,168,172],"random":[22,40,85,108],"realization":[23],"gradient":[26,193],"at":[30,65],"each":[31,178],"query":[32,47,67],"point.":[33],"Without":[34],"knowing":[35],"distribution":[37],"gradients,":[41],"learning":[43,137],"algorithm":[44,138],"sequentially":[45],"chooses":[46],"points":[48,68],"with":[49,144],"objective":[51],"minimizing":[53],"regret":[54,164,187],"defined":[55],"as":[56],"expected":[58],"cumulative":[59],"loss":[60],"values":[64],"in":[69,177],"excess":[70],"to":[71,141,149,167],"minimum":[73],"value":[74],"function.":[77],"An":[78],"approach":[79,195],"based":[80,116],"on":[81,87,117,120],"devising":[82],"biased":[84],"walk":[86,109],"infinite-depth":[89],"binary":[90],"tree":[91],"constructed":[92,124],"through":[93],"successive":[94],"partitioning":[95],"domain":[98],"developed.":[103],"Each":[104],"move":[105],"guided":[111],"by":[112],"sequential":[114],"test":[115],"confidence":[118],"bounds":[119],"empirical":[122],"mean":[123],"using":[125],"law":[127],"iterated":[130],"logarithm.":[131],"With":[132],"no":[133],"tuning":[134,205],"parameters,":[135],"this":[136],"robust":[140],"heavy-tailed":[142],"noise":[143],"infinite":[145],"variance":[146],"and":[147,157,182],"adaptive":[148],"characteristics":[152,203],"(specifically,":[153],"convex,":[154,156],"strongly":[155],"nonsmooth).":[158],"It":[159],"achieves":[160],"corresponding":[162],"optimal":[163],"orders":[165,188],"(up":[166],"\u221a(log":[169],"T)":[170],"or":[171,185],"log":[173,174],"T":[175],"factor)":[176],"class":[179],"functions":[181],"offers":[183],"better":[184],"matching":[186],"than":[189],"classical":[191],"descent":[194],"requires":[197],"knowledge":[199],"for":[204],"sequence":[207],"step-sizes.":[209]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}