{"id":"https://openalex.org/W2921858196","doi":"https://doi.org/10.23919/isita.2018.8664212","title":"Introduction to Bandit Convex Optimization Algorithms","display_name":"Introduction to Bandit Convex Optimization Algorithms","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2921858196","doi":"https://doi.org/10.23919/isita.2018.8664212","mag":"2921858196"},"language":"en","primary_location":{"id":"doi:10.23919/isita.2018.8664212","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664212","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","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/A5003820265","display_name":"Wataru Kumagai","orcid":"https://orcid.org/0000-0002-3081-5951"},"institutions":[{"id":"https://openalex.org/I4210126580","display_name":"RIKEN Center for Advanced Intelligence Project","ror":"https://ror.org/03ckxwf91","country_code":"JP","type":"facility","lineage":["https://openalex.org/I4210110652","https://openalex.org/I4210126580"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Wataru Kumagai","raw_affiliation_strings":["Center for Advanced Intelligence Project, RIKEN, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Center for Advanced Intelligence Project, RIKEN, Tokyo, Japan","institution_ids":["https://openalex.org/I4210126580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5003820265"],"corresponding_institution_ids":["https://openalex.org/I4210126580"],"apc_list":null,"apc_paid":null,"fwci":0.2117,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6326968,"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":"36","last_page":"39"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9966999888420105,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9958000183105469,"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/hessian-matrix","display_name":"Hessian matrix","score":0.8217874765396118},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6956587433815002},{"id":"https://openalex.org/keywords/derivative-free-optimization","display_name":"Derivative-free optimization","score":0.5809112191200256},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5724499225616455},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5620335340499878},{"id":"https://openalex.org/keywords/derivative","display_name":"Derivative (finance)","score":0.533238410949707},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5239198803901672},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5143359899520874},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4662875831127167},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4406009018421173},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.42550569772720337},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3947449326515198},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3645458221435547},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.31593096256256104},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.19423148036003113},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.11923253536224365}],"concepts":[{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.8217874765396118},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6956587433815002},{"id":"https://openalex.org/C29282572","wikidata":"https://www.wikidata.org/wiki/Q16977029","display_name":"Derivative-free optimization","level":4,"score":0.5809112191200256},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5724499225616455},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5620335340499878},{"id":"https://openalex.org/C111771559","wikidata":"https://www.wikidata.org/wiki/Q66295","display_name":"Derivative (finance)","level":2,"score":0.533238410949707},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5239198803901672},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5143359899520874},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4662875831127167},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4406009018421173},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.42550569772720337},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3947449326515198},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3645458221435547},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.31593096256256104},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.19423148036003113},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.11923253536224365},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/isita.2018.8664212","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664212","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","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":24,"referenced_works":["https://openalex.org/W1788809966","https://openalex.org/W1837018238","https://openalex.org/W2004001705","https://openalex.org/W2009979684","https://openalex.org/W2100050269","https://openalex.org/W2130227799","https://openalex.org/W2151056989","https://openalex.org/W2161149069","https://openalex.org/W2951175152","https://openalex.org/W2963030777","https://openalex.org/W2963062786","https://openalex.org/W2963085207","https://openalex.org/W2963649887","https://openalex.org/W2963753225","https://openalex.org/W4294379402","https://openalex.org/W6636430741","https://openalex.org/W6638443938","https://openalex.org/W6638497962","https://openalex.org/W6651597697","https://openalex.org/W6674948973","https://openalex.org/W6679205030","https://openalex.org/W6682008797","https://openalex.org/W6683997977","https://openalex.org/W6743750081"],"related_works":["https://openalex.org/W2756132392","https://openalex.org/W3035814349","https://openalex.org/W2510140549","https://openalex.org/W2186293978","https://openalex.org/W308707143","https://openalex.org/W2187449906","https://openalex.org/W4285101096","https://openalex.org/W4382725876","https://openalex.org/W2084892497","https://openalex.org/W2115614142"],"abstract_inverted_index":{"In":[0,87],"the":[1,6,9,13,16,23,34,38,43,46,52,55,62,67,83],"theory":[2],"of":[3,8,37,45,54],"convex":[4],"optimization,":[5],"derivative":[7,47,53,68],"objective":[10,56],"function":[11,39,57],"including":[12],"gradient":[14],"and":[15,50,96],"Hessian":[17],"is":[18,40,48,58],"typically":[19],"used":[20],"to":[21],"search":[22],"optimum":[24],"point.":[25],"However,":[26],"in":[27,72,82],"real-world":[28],"applications,":[29],"it":[30],"may":[31],"be":[32],"that":[33],"concrete":[35],"form":[36],"unknown":[41],"or":[42],"computation":[44],"difficult,":[49],"thus,":[51],"unavailable.":[59],"To":[60],"solve":[61],"problem,":[63],"optimization":[64,80,94],"methods":[65,76,81],"without":[66],"have":[69],"been":[70],"developed":[71],"recent":[73],"years.":[74],"Such":[75],"are":[77],"called":[78],"bandit":[79,93],"machine":[84],"learning":[85],"community.":[86],"this":[88],"paper,":[89],"we":[90],"introduce":[91],"basic":[92],"algorithms":[95],"explain":[97],"their":[98],"performance.":[99]},"counts_by_year":[{"year":2023,"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"}