{"id":"https://openalex.org/W4385567871","doi":"https://doi.org/10.1145/3580305.3599329","title":"Efficient Sparse Linear Bandits under High Dimensional Data","display_name":"Efficient Sparse Linear Bandits under High Dimensional Data","publication_year":2023,"publication_date":"2023-08-04","ids":{"openalex":"https://openalex.org/W4385567871","doi":"https://doi.org/10.1145/3580305.3599329"},"language":"en","primary_location":{"id":"doi:10.1145/3580305.3599329","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3580305.3599329","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","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/A5101440776","display_name":"Xue Wang","orcid":"https://orcid.org/0009-0004-2296-9688"},"institutions":[{"id":"https://openalex.org/I4210095624","display_name":"Alibaba Group (United States)","ror":"https://ror.org/00rn0m335","country_code":"US","type":"company","lineage":["https://openalex.org/I4210095624","https://openalex.org/I45928872"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xue Wang","raw_affiliation_strings":["Alibaba Group US, bellevue, WA, USA"],"raw_orcid":"https://orcid.org/0009-0004-2296-9688","affiliations":[{"raw_affiliation_string":"Alibaba Group US, bellevue, WA, USA","institution_ids":["https://openalex.org/I4210095624"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019046771","display_name":"Mike Mingcheng Wei","orcid":"https://orcid.org/0000-0002-7867-2646"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mike Mingcheng Wei","raw_affiliation_strings":["University at Buffalo, Buffalo, NY, USA"],"raw_orcid":"https://orcid.org/0000-0002-7867-2646","affiliations":[{"raw_affiliation_string":"University at Buffalo, Buffalo, NY, USA","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101512133","display_name":"Tao Yao","orcid":"https://orcid.org/0000-0002-2124-5678"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tao Yao","raw_affiliation_strings":["The Chinese University of Hong Kong, Shenzhen, ShenZhen, China"],"raw_orcid":"https://orcid.org/0000-0002-2124-5678","affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shenzhen, ShenZhen, China","institution_ids":["https://openalex.org/I4210116924"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101440776"],"corresponding_institution_ids":["https://openalex.org/I4210095624"],"apc_list":null,"apc_paid":null,"fwci":0.4931,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.68194566,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2431","last_page":"2443"},"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.9995999932289124,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.9281124472618103},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.7391533255577087},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6804037094116211},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"Sample complexity","score":0.5832545757293701},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.565151572227478},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.542682945728302},{"id":"https://openalex.org/keywords/lasso","display_name":"Lasso (programming language)","score":0.5336741805076599},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45087525248527527},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44544002413749695},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4344102144241333},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.4298827648162842},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.42969274520874023},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3587445616722107},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28963416814804077},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.244917094707489},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.14796999096870422}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.9281124472618103},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7391533255577087},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6804037094116211},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.5832545757293701},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.565151572227478},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.542682945728302},{"id":"https://openalex.org/C37616216","wikidata":"https://www.wikidata.org/wiki/Q3218363","display_name":"Lasso (programming language)","level":2,"score":0.5336741805076599},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45087525248527527},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44544002413749695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4344102144241333},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.4298827648162842},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.42969274520874023},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3587445616722107},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28963416814804077},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.244917094707489},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.14796999096870422},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3580305.3599329","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3580305.3599329","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/1","score":0.6499999761581421,"display_name":"No poverty"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W340056678","https://openalex.org/W1485437584","https://openalex.org/W1516726196","https://openalex.org/W1965125844","https://openalex.org/W2010824638","https://openalex.org/W2034260606","https://openalex.org/W2041836310","https://openalex.org/W2074682976","https://openalex.org/W2092092836","https://openalex.org/W2108114251","https://openalex.org/W2109842006","https://openalex.org/W2112420033","https://openalex.org/W2116581043","https://openalex.org/W2129554161","https://openalex.org/W2135046866","https://openalex.org/W2560674852","https://openalex.org/W2580753685","https://openalex.org/W2604212920","https://openalex.org/W2947532450","https://openalex.org/W2963459305","https://openalex.org/W2964248738","https://openalex.org/W2964346891","https://openalex.org/W3005570241","https://openalex.org/W3035238824","https://openalex.org/W3098306969","https://openalex.org/W3099718522","https://openalex.org/W3099809348","https://openalex.org/W3099897794","https://openalex.org/W3106266785","https://openalex.org/W3124121179","https://openalex.org/W4212774754","https://openalex.org/W4287672183","https://openalex.org/W4292363360","https://openalex.org/W6600577311","https://openalex.org/W6693302000"],"related_works":["https://openalex.org/W2971351794","https://openalex.org/W4376155396","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/W2990709181","https://openalex.org/W2963049774"],"abstract_inverted_index":{"We":[0,45],"propose":[1],"a":[2,104],"computationally":[3,151],"efficient":[4,152],"Lasso":[5,24],"Random":[6,26],"Project":[7],"Bandit":[8],"(LRP-Bandit)":[9],"algorithm":[10],"for":[11,48,111,128],"sparse":[12],"linear":[13],"bandit":[14],"problems":[15],"under":[16,68],"high-dimensional":[17],"settings":[18],"with":[19],"limited":[20],"samples.":[21],"LRP-Bandit":[22,69,112,149],"bridges":[23],"and":[25,31,40,59,131,153],"Projection":[27],"as":[28],"feature":[29,51,56],"selection":[30],"dimension":[32,52,57],"reduction":[33],"techniques":[34],"to":[35,117,141],"alleviate":[36],"the":[37,42,49,54,60,64,89,107,135,158],"computational":[38],"complexity":[39],"improve":[41],"regret":[43,67,108,123],"performance.":[44],"demonstrate":[46],"that":[47,97,148],"total":[50],"d,":[53],"significant":[55],"s,":[58],"sample":[61],"size":[62],"T,":[63],"expected":[65,159],"cumulative":[66,160],"is":[70,150],"upper":[71,109,124],"bounded":[72],"by":[73],"\u00d5":[74,87,118],"(T2":[75],"over":[76,80,83],"3":[77,79],"s":[78],"2":[81],"log7":[82],"6":[84],"d),":[85],"where":[86],"suppresses":[88],"logarithmic":[90,142],"dependence":[91],"on":[92,126,157],"T.":[93],"Further,":[94],"we":[95,146],"show":[96,147],"when":[98],"available":[99],"samples":[100],"are":[101],"larger":[102],"than":[103],"problem-dependent":[105],"threshold,":[106],"bound":[110],"can":[113],"be":[114],"further":[115],"improved":[116],"(s\u221aT":[119],"log":[120],"d).":[121],"These":[122],"bounds":[125,139],"T":[127],"both":[129],"data-poor":[130],"data-rich":[132],"regimes":[133],"match":[134],"theoretical":[136],"minimax":[137],"lower":[138],"up":[140],"factors.":[143],"Through":[144],"experiments,":[145],"outperforms":[154],"other":[155],"benchmarks":[156],"regret.":[161]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}