{"id":"https://openalex.org/W2397735741","doi":"https://doi.org/10.1109/icassp.2016.7472588","title":"Efficient algorithms for linear polyhedral bandits","display_name":"Efficient algorithms for linear polyhedral bandits","publication_year":2016,"publication_date":"2016-03-01","ids":{"openalex":"https://openalex.org/W2397735741","doi":"https://doi.org/10.1109/icassp.2016.7472588","mag":"2397735741"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2016.7472588","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2016.7472588","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5057858044","display_name":"Manjesh K. Hanawal","orcid":"https://orcid.org/0000-0002-1807-5487"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Manjesh K. Hanawal","raw_affiliation_strings":["IEOR Group, ITT-Bombay, Mumbai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IEOR Group, ITT-Bombay, Mumbai, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019966334","display_name":"Amir Leshem","orcid":"https://orcid.org/0000-0002-2265-7463"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Amir Leshem","raw_affiliation_strings":["Dept. of EE, Bar-Ilan University, Ramat-Gan, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of EE, Bar-Ilan University, Ramat-Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048704387","display_name":"Venkatesh Saligrama","orcid":"https://orcid.org/0000-0002-0675-2268"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkatesh Saligrama","raw_affiliation_strings":["Dept. of ECE, Boston University, Boston, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of ECE, Boston University, Boston, USA","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":null,"first_page":"4796","last_page":"4800"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9947999715805054,"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.9944000244140625,"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/regret","display_name":"Regret","score":0.7593421936035156},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.697080135345459},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.611400306224823},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5242165327072144},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5239729285240173},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.49600061774253845},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4853433668613434},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4806586503982544},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4452972710132599},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.44529467821121216},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4437849819660187},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4360384941101074},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41521236300468445},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.277909517288208}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7593421936035156},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.697080135345459},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.611400306224823},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5242165327072144},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5239729285240173},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.49600061774253845},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4853433668613434},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4806586503982544},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4452972710132599},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.44529467821121216},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4437849819660187},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4360384941101074},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41521236300468445},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.277909517288208},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.2016.7472588","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2016.7472588","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","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":26,"referenced_works":["https://openalex.org/W50486269","https://openalex.org/W1412447802","https://openalex.org/W1597703625","https://openalex.org/W1762430620","https://openalex.org/W1998498767","https://openalex.org/W2009551863","https://openalex.org/W2061641373","https://openalex.org/W2061753713","https://openalex.org/W2077902449","https://openalex.org/W2093562354","https://openalex.org/W2111584876","https://openalex.org/W2112420033","https://openalex.org/W2119738618","https://openalex.org/W2139552971","https://openalex.org/W2140571193","https://openalex.org/W2142971854","https://openalex.org/W2146025745","https://openalex.org/W2168405694","https://openalex.org/W2169926276","https://openalex.org/W2256507426","https://openalex.org/W3103604572","https://openalex.org/W4366084930","https://openalex.org/W6602031475","https://openalex.org/W6669877065","https://openalex.org/W6676689620","https://openalex.org/W6692235262"],"related_works":["https://openalex.org/W2971351794","https://openalex.org/W4376155396","https://openalex.org/W1947085858","https://openalex.org/W2947263763","https://openalex.org/W4288373430","https://openalex.org/W3036260055","https://openalex.org/W4287753704","https://openalex.org/W3158925485","https://openalex.org/W2996735312","https://openalex.org/W2065436195"],"abstract_inverted_index":{"We":[0,31],"study":[1],"stochastic":[2],"linear":[3,29],"optimization":[4],"problem":[5],"with":[6,161,193],"bandit":[7],"feedback.":[8],"The":[9,48,77,165],"set":[10,61],"of":[11,62,80,88,100,158,167,187,216],"arms":[12,63],"take":[13],"values":[14],"in":[15,45,64,73,122,180,201,224],"an":[16,33],"N-dimensional":[17],"space":[18],"and":[19,53,68],"belongs":[20],"to":[21,84,119,133,172,182,221],"a":[22,59,69,97,112,127,142,148],"bounded":[23],"polyhedron":[24,113],"described":[25],"by":[26,96,151],"finitely":[27,197],"many":[28,198],"inequalities.":[30],"present":[32],"algorithm":[34,49],"that":[35,92,110,153,192,208],"has":[36],"O(Nlog1+\u03b5(T))":[37],"expected":[38],"regret":[39,78,163],"for":[40,111],"any":[41],"\u03b5":[42],">":[43],"0":[44],"T":[46],"rounds.":[47],"alternates":[50],"between":[51],"exploration":[52,66],"exploitation":[54,75,203],"phases":[55,67],"where":[56],"it":[57],"plays":[58],"deterministic":[60],"the":[65,74,85,114,123,137,156,178,183,202,214],"greedily":[70,128],"selected":[71,129],"arm":[72,116,130],"phases.":[76],"bound":[79,103],"SEE":[81],"compares":[82,219],"well":[83],"lower":[86,102],"bounds":[87,176],"\u03a9(N":[89],"log":[90],"T)":[91],"can":[93],"be":[94,134],"derived":[95],"direct":[98],"adaptation":[99],"Lai-Robbin's":[101],"proof":[104],"[1].":[105],"Our":[106,145],"key":[107],"insight":[108],"is":[109,117,131],"optimal":[115,135],"robust":[118],"small":[120],"perturbations":[121],"reward":[124],"function.":[125],"Consequently,":[126],"guaranteed":[132],"when":[136],"estimation":[138],"error":[139],"falls":[140],"below":[141],"suitable":[143],"threshold.":[144],"solution":[146],"resolves":[147],"question":[149],"posed":[150],"[2]":[152],"left":[154],"open":[155],"possibility":[157],"efficient":[159],"algorithms":[160,218,223],"logarithmic":[162],"bounds.":[164],"simplicity":[166],"our":[168,217],"approach":[169],"allows":[170],"us":[171],"derive":[173],"probability":[174,194],"one":[175,195],"on":[177],"regret,":[179],"contrast":[181],"weak":[184],"convergence":[185],"results":[186,211],"other":[188],"papers.":[189],"This":[190],"ensures":[191],"only":[196],"errors":[199],"occur":[200],"phase.":[204],"Numerical":[205],"investigations":[206],"show":[207],"while":[209],"theoretical":[210],"are":[212],"asymptotic":[213],"performance":[215],"favorably":[220],"state-of-the-art":[222],"finite":[225],"time":[226],"as":[227],"well.":[228]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}