{"id":"https://openalex.org/W3005005431","doi":"https://doi.org/10.5555/2789272.2912115","title":"Non-asymptotic analysis of a new bandit algorithm for semi-bounded rewards","display_name":"Non-asymptotic analysis of a new bandit algorithm for semi-bounded rewards","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W3005005431","doi":"https://doi.org/10.5555/2789272.2912115","mag":"3005005431"},"language":"en","primary_location":{"id":"mag:3005005431","is_oa":false,"landing_page_url":"https://dl.acm.org/doi/10.5555/2789272.2912115","pdf_url":null,"source":{"id":"https://openalex.org/S118988714","display_name":"Journal of Machine Learning Research","issn_l":"1532-4435","issn":["1532-4435","1533-7928"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Machine Learning Research","raw_type":null},"type":"article","indexed_in":[],"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/A5084241488","display_name":"HondaJunya","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"HondaJunya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5077798203","display_name":"TakemuraAkimichi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"TakemuraAkimichi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.39328491,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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.9858999848365784,"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/T13553","display_name":"Age of Information Optimization","score":0.9804999828338623,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7442553639411926},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.502190351486206},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5006322860717773},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4346143305301666},{"id":"https://openalex.org/keywords/asymptotic-analysis","display_name":"Asymptotic analysis","score":0.4325944483280182},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40460968017578125},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.339508056640625},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07005518674850464}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7442553639411926},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.502190351486206},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5006322860717773},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4346143305301666},{"id":"https://openalex.org/C205147927","wikidata":"https://www.wikidata.org/wiki/Q752718","display_name":"Asymptotic analysis","level":2,"score":0.4325944483280182},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40460968017578125},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.339508056640625},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07005518674850464}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:3005005431","is_oa":false,"landing_page_url":"https://dl.acm.org/doi/10.5555/2789272.2912115","pdf_url":null,"source":{"id":"https://openalex.org/S118988714","display_name":"Journal of Machine Learning Research","issn_l":"1532-4435","issn":["1532-4435","1533-7928"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Journal of Machine Learning Research","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2632118645","https://openalex.org/W104909430","https://openalex.org/W3045904936","https://openalex.org/W1972672336","https://openalex.org/W3145493580","https://openalex.org/W346664314","https://openalex.org/W2125930088","https://openalex.org/W1977823770","https://openalex.org/W2949967214","https://openalex.org/W3161655556","https://openalex.org/W3159114597","https://openalex.org/W1988645820","https://openalex.org/W2539587114","https://openalex.org/W2159471113","https://openalex.org/W2010443695","https://openalex.org/W1914551808","https://openalex.org/W2079206036","https://openalex.org/W2770389291","https://openalex.org/W2128109710","https://openalex.org/W1669125819"],"abstract_inverted_index":{"In":[0],"this":[1,14],"paper":[2],"we":[3],"consider":[4],"a":[5],"stochastic":[6],"multiarmed":[7],"bandit":[8],"problem.":[9],"It":[10],"is":[11],"known":[12],"in":[13],"problem":[15],"that":[16],"Deterministic":[17],"Minimum":[18],"Empirical":[19],"Divergence":[20],"(DMED)":[21],"policy":[22],"achieves":[23],"the":[24],"asymptotic":[25],"theoretical":[26],"bound...":[27]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":51}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}