{"id":"https://openalex.org/W2520047712","doi":"https://doi.org/10.1162/neco_a_00887","title":"Per-Round Knapsack-Constrained Linear Submodular Bandits","display_name":"Per-Round Knapsack-Constrained Linear Submodular Bandits","publication_year":2016,"publication_date":"2016-09-14","ids":{"openalex":"https://openalex.org/W2520047712","doi":"https://doi.org/10.1162/neco_a_00887","mag":"2520047712","pmid":"https://pubmed.ncbi.nlm.nih.gov/27626968"},"language":"en","primary_location":{"id":"doi:10.1162/neco_a_00887","is_oa":false,"landing_page_url":"https://doi.org/10.1162/neco_a_00887","pdf_url":null,"source":{"id":"https://openalex.org/S207023548","display_name":"Neural Computation","issn_l":"0899-7667","issn":["0899-7667","1530-888X"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"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/A5085309099","display_name":"Baosheng Yu","orcid":"https://orcid.org/0000-0002-0761-7893"},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Baosheng Yu","raw_affiliation_strings":["Centre for Artificial Intelligence, Faculty of Engineering and Information Technology, University of Technology Sydney, Sydney, NSW 2007, Australia"],"affiliations":[{"raw_affiliation_string":"Centre for Artificial Intelligence, Faculty of Engineering and Information Technology, University of Technology Sydney, Sydney, NSW 2007, Australia","institution_ids":["https://openalex.org/I114017466"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100400497","display_name":"Meng Fang","orcid":"https://orcid.org/0000-0003-0793-9187"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Meng Fang","raw_affiliation_strings":["Department of Computing and Information Systems, University of Melbourne, Victoria 3010, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Computing and Information Systems, University of Melbourne, Victoria 3010, Australia","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074103823","display_name":"Dacheng Tao","orcid":"https://orcid.org/0000-0001-7225-5449"},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Dacheng Tao","raw_affiliation_strings":["Centre for Artificial Intelligence, Faculty of Engineering and Information Technology, University of Technology Sydney, Sydney, NSW 2007, Australia"],"affiliations":[{"raw_affiliation_string":"Centre for Artificial Intelligence, Faculty of Engineering and Information Technology, University of Technology Sydney, Sydney, NSW 2007, Australia","institution_ids":["https://openalex.org/I114017466"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074103823","https://openalex.org/A5085309099","https://openalex.org/A5100400497"],"corresponding_institution_ids":["https://openalex.org/I114017466","https://openalex.org/I165779595"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11627841,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"28","issue":"12","first_page":"2757","last_page":"2789"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.9980000257492065,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9904999732971191,"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/submodular-set-function","display_name":"Submodular set function","score":0.9521764516830444},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7810696363449097},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6263917684555054},{"id":"https://openalex.org/keywords/lazy-evaluation","display_name":"Lazy evaluation","score":0.5898192524909973},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5876865983009338},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.5746227502822876},{"id":"https://openalex.org/keywords/budget-constraint","display_name":"Budget constraint","score":0.506735622882843},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47952771186828613},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4719730317592621},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.437579870223999},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4371931254863739},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42352813482284546},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4214334785938263},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2072034478187561},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.09154120087623596},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.06362760066986084}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9521764516830444},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7810696363449097},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6263917684555054},{"id":"https://openalex.org/C128099668","wikidata":"https://www.wikidata.org/wiki/Q573952","display_name":"Lazy evaluation","level":3,"score":0.5898192524909973},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5876865983009338},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.5746227502822876},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.506735622882843},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47952771186828613},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4719730317592621},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.437579870223999},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4371931254863739},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42352813482284546},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4214334785938263},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2072034478187561},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.09154120087623596},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.06362760066986084},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C133425853","wikidata":"https://www.wikidata.org/wiki/Q60571","display_name":"Neoclassical economics","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1162/neco_a_00887","is_oa":false,"landing_page_url":"https://doi.org/10.1162/neco_a_00887","pdf_url":null,"source":{"id":"https://openalex.org/S207023548","display_name":"Neural Computation","issn_l":"0899-7667","issn":["0899-7667","1530-888X"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural Computation","raw_type":"journal-article"},{"id":"pmid:27626968","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/27626968","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural computation","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":73,"referenced_works":["https://openalex.org/W10962629","https://openalex.org/W35251828","https://openalex.org/W50486269","https://openalex.org/W627443184","https://openalex.org/W1435366594","https://openalex.org/W1480398149","https://openalex.org/W1487320471","https://openalex.org/W1492009297","https://openalex.org/W1510812122","https://openalex.org/W1515851193","https://openalex.org/W1680189815","https://openalex.org/W1761637522","https://openalex.org/W1867397705","https://openalex.org/W1950398167","https://openalex.org/W1995913408","https://openalex.org/W2009551863","https://openalex.org/W2020254732","https://openalex.org/W2023599408","https://openalex.org/W2033885045","https://openalex.org/W2051259245","https://openalex.org/W2051968805","https://openalex.org/W2055421030","https://openalex.org/W2055928229","https://openalex.org/W2058879737","https://openalex.org/W2070546659","https://openalex.org/W2077902449","https://openalex.org/W2093562354","https://openalex.org/W2097955668","https://openalex.org/W2107126505","https://openalex.org/W2108114251","https://openalex.org/W2110005947","https://openalex.org/W2112387288","https://openalex.org/W2112420033","https://openalex.org/W2117353901","https://openalex.org/W2123016239","https://openalex.org/W2124832196","https://openalex.org/W2132314908","https://openalex.org/W2135414222","https://openalex.org/W2141403143","https://openalex.org/W2143161882","https://openalex.org/W2144933361","https://openalex.org/W2146832283","https://openalex.org/W2148250692","https://openalex.org/W2155912844","https://openalex.org/W2156672682","https://openalex.org/W2160163723","https://openalex.org/W2167603139","https://openalex.org/W2168405694","https://openalex.org/W2169206416","https://openalex.org/W2185823609","https://openalex.org/W2275211641","https://openalex.org/W2400128071","https://openalex.org/W2460051063","https://openalex.org/W2500139799","https://openalex.org/W2531563875","https://openalex.org/W2559655401","https://openalex.org/W2559997609","https://openalex.org/W2596585349","https://openalex.org/W2597289420","https://openalex.org/W2600820317","https://openalex.org/W2604272474","https://openalex.org/W2617837836","https://openalex.org/W2911964244","https://openalex.org/W2913668833","https://openalex.org/W2914156981","https://openalex.org/W2950303912","https://openalex.org/W2987140221","https://openalex.org/W3118655244","https://openalex.org/W3125893104","https://openalex.org/W4214717370","https://openalex.org/W4233051669","https://openalex.org/W4243522562","https://openalex.org/W4246270964"],"related_works":["https://openalex.org/W2357796514","https://openalex.org/W2393014972","https://openalex.org/W2357595179","https://openalex.org/W2351136238","https://openalex.org/W2402949237","https://openalex.org/W2891162720","https://openalex.org/W2964314169","https://openalex.org/W2169800510","https://openalex.org/W2594118609","https://openalex.org/W2968699064"],"abstract_inverted_index":{"Linear":[0],"submodular":[1,66,78,92,132],"bandits":[2,67],"has":[3],"been":[4],"proven":[5],"to":[6,60,147],"be":[7,145],"effective":[8],"in":[9,17,28,50,131],"solving":[10],"the":[11,42,91,127,163],"diversification":[12,45],"and":[13,37,122,162],"feature-based":[14],"exploration":[15,62],"problem":[16,43],"information":[18],"retrieval":[19],"systems.":[20],"Considering":[21],"there":[22],"is":[23,95],"inevitably":[24],"a":[25,47,51,57,69,109,139,158],"budget":[26,48,58],"constraint":[27,49,59],"many":[29],"web-based":[30],"applications,":[31],"such":[32],"as":[33,68],"news":[34],"article":[35],"recommendations":[36],"online":[38],"advertising,":[39],"we":[40,73,102,135],"study":[41],"of":[44,64,160],"under":[46],"bandit":[52],"setting.":[53],"We":[54,80,113,156],"first":[55],"introduce":[56],"each":[61],"step":[63],"linear":[65,77],"new":[70,100],"problem,":[71,101],"which":[72],"call":[74],"per-round":[75],"knapsack-constrained":[76],"bandits.":[79],"then":[81],"define":[82],"an":[83],"[Formula:":[84],"see":[85],"text]-approximation":[86],"unit-cost":[87],"regret":[88,120],"considering":[89],"that":[90,138],"function":[93,133],"maximization":[94],"NP-hard.":[96],"To":[97],"solve":[98],"this":[99],"propose":[103],"two":[104,116],"greedy":[105],"algorithms":[106,117,150],"based":[107],"on":[108],"modified":[110,140],"UCB":[111],"rule.":[112],"prove":[114,137],"these":[115],"with":[118],"different":[119],"bounds":[121],"computational":[123],"complexities.":[124],"Inspired":[125],"by":[126],"lazy":[128,141],"evaluation":[129,142],"process":[130,143],"maximization,":[134],"also":[136],"can":[144],"used":[146],"accelerate":[148],"our":[149,167],"without":[151],"losing":[152],"their":[153],"theoretical":[154,168],"guarantee.":[155],"conduct":[157],"number":[159],"experiments,":[161],"experimental":[164],"results":[165],"confirm":[166],"analyses.":[169]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}