{"id":"https://openalex.org/W2068637807","doi":"https://doi.org/10.1145/1250790.1250807","title":"Approximation algorithms for budgeted learning problems","display_name":"Approximation algorithms for budgeted learning problems","publication_year":2007,"publication_date":"2007-06-11","ids":{"openalex":"https://openalex.org/W2068637807","doi":"https://doi.org/10.1145/1250790.1250807","mag":"2068637807"},"language":"en","primary_location":{"id":"doi:10.1145/1250790.1250807","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250790.1250807","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-ninth annual ACM symposium on Theory of computing","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/A5114008024","display_name":"Sudipto Guha","orcid":null},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sudipto Guha","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, PA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, PA","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047351951","display_name":"Kamesh Munagala","orcid":"https://orcid.org/0000-0003-2636-9650"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kamesh Munagala","raw_affiliation_strings":["Duke University, Durham, NC"],"affiliations":[{"raw_affiliation_string":"Duke University, Durham, NC","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5114008024"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":null,"apc_paid":null,"fwci":8.7009,"has_fulltext":false,"cited_by_count":86,"citation_normalized_percentile":{"value":0.97930407,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"104","last_page":"113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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.9991999864578247,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6715927720069885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6536860466003418},{"id":"https://openalex.org/keywords/budget-constraint","display_name":"Budget constraint","score":0.6122750043869019},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5887992978096008},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5650838017463684},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5630598068237305},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.509353756904602},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5016937255859375},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.44841092824935913},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31095996499061584},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2682804465293884},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2463298738002777}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6715927720069885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6536860466003418},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.6122750043869019},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5887992978096008},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5650838017463684},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5630598068237305},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.509353756904602},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5016937255859375},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.44841092824935913},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31095996499061584},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2682804465293884},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2463298738002777},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1250790.1250807","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250790.1250807","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-ninth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.99.3408","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.3408","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/~sudipto/mypapers/bandits.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1484951415","https://openalex.org/W1486950299","https://openalex.org/W1596179888","https://openalex.org/W1612586171","https://openalex.org/W1825072153","https://openalex.org/W1973022038","https://openalex.org/W1974114807","https://openalex.org/W1983916623","https://openalex.org/W1985942708","https://openalex.org/W1992595998","https://openalex.org/W2001331793","https://openalex.org/W2001729421","https://openalex.org/W2025702744","https://openalex.org/W2037710455","https://openalex.org/W2041025394","https://openalex.org/W2041075508","https://openalex.org/W2044081853","https://openalex.org/W2044771513","https://openalex.org/W2045086034","https://openalex.org/W2056921512","https://openalex.org/W2068637807","https://openalex.org/W2093892790","https://openalex.org/W2098432798","https://openalex.org/W2102132526","https://openalex.org/W2117399775","https://openalex.org/W2131552728","https://openalex.org/W2140407154","https://openalex.org/W2155053834","https://openalex.org/W2159471113","https://openalex.org/W2161521419","https://openalex.org/W2170112109","https://openalex.org/W2381919137","https://openalex.org/W2949071206","https://openalex.org/W4212774754","https://openalex.org/W4235273215","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W83893804","https://openalex.org/W2178649091","https://openalex.org/W2353238953","https://openalex.org/W2496037054","https://openalex.org/W2024895661","https://openalex.org/W2390883384","https://openalex.org/W2054108430","https://openalex.org/W3123594720","https://openalex.org/W2543175834","https://openalex.org/W2360283705"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,17,20,31,47,54,59,63,71,85,99,109,117,121,134,140,144,166],"first":[3],"approximation":[4],"algorithms":[5,171],"for":[6,92,124],"a":[7,39,68,105,160,173],"large":[8],"class":[9],"of":[10,16,30,74,111,120,143,165],"budgeted":[11,21,141],"learning":[12],"problems.":[13],"One":[14],"classicexample":[15],"above":[18],"is":[19,67,90,96,129,146],"multi-armed":[22],"bandit":[23],"problem.":[24],"In":[25],"this":[26,80,127,149],"problem":[27,128,145,150],"each":[28],"arm":[29,60,83,122],"bandithas":[32],"an":[33],"unknown":[34],"reward":[35,89,119,138,161,167],"distribution":[36,49],"on":[37,70,108,180],"which":[38],"prior":[40],"isspecified":[41],"as":[42],"input.":[43],"The":[44,94],"knowledge":[45],"about":[46],"underlying":[48],"can":[50],"be":[51],"refined":[52],"in":[53,113,133],"exploration":[55,81,101],"phase":[56,102],"by":[57],"playing":[58],"and":[61,151],"observing":[62],"rewards.":[64],"However,":[65],"there":[66],"budget":[69,106],"total":[72],"number":[73,110],"plays":[75],"allowed":[76],"during":[77],"exploration.":[78],"After":[79],"phase,the":[82],"with":[84],"highest":[86],"(posterior)":[87],"expected":[88,118],"hosen":[91],"exploitation.":[93,125],"goal":[95],"to":[97,104,115],"design":[98],"adaptive":[100],"subject":[103],"constraint":[107],"plays,":[112],"order":[114],"maximize":[116],"chosen":[123],"While":[126],"reasonably":[130],"well":[131],"understood":[132],"infinite":[135],"horizon":[136],"discounted":[137],"setting,":[139],"version":[142],"NP-Hard.":[147],"For":[148],"several":[152],"generalizations,":[153],"we":[154],"provide":[155],"approximate":[156],"policies":[157],"that":[158],"achieve":[159],"within":[162],"constant":[163],"factor":[164],"optimal":[168],"policy.":[169],"Our":[170],"use":[172],"novel":[174],"linear":[175],"program":[176],"rounding":[177],"technique":[178],"based":[179],"stochastic":[181],"packing.":[182]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}