{"id":"https://openalex.org/W2892440719","doi":"https://doi.org/10.1145/3240323.3240408","title":"Efficient online recommendation via low-rank ensemble sampling","display_name":"Efficient online recommendation via low-rank ensemble sampling","publication_year":2018,"publication_date":"2018-09-27","ids":{"openalex":"https://openalex.org/W2892440719","doi":"https://doi.org/10.1145/3240323.3240408","mag":"2892440719"},"language":"en","primary_location":{"id":"doi:10.1145/3240323.3240408","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3240323.3240408","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th ACM Conference on Recommender Systems","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/A5027358754","display_name":"Xiuyuan Lu","orcid":"https://orcid.org/0000-0001-6376-8584"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xiuyuan Lu","raw_affiliation_strings":["Stanford University"],"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035367145","display_name":"Wen Zheng","orcid":"https://orcid.org/0000-0002-6570-6245"},"institutions":[{"id":"https://openalex.org/I1306409833","display_name":"Adobe Systems (United States)","ror":"https://ror.org/059tvcg64","country_code":"US","type":"company","lineage":["https://openalex.org/I1306409833"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zheng Wen","raw_affiliation_strings":["Adobe Research"],"affiliations":[{"raw_affiliation_string":"Adobe Research","institution_ids":["https://openalex.org/I1306409833"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049020775","display_name":"Branislav Kveton","orcid":"https://orcid.org/0000-0002-3965-1367"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Branislav Kveton","raw_affiliation_strings":["Google Research"],"affiliations":[{"raw_affiliation_string":"Google Research","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5027358754"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":1.2161,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.77024785,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"460","last_page":"464"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9995999932289124,"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.9976999759674072,"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/computer-science","display_name":"Computer science","score":0.7539002895355225},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.6567666530609131},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.644877552986145},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.6142324209213257},{"id":"https://openalex.org/keywords/recommender-system","display_name":"Recommender system","score":0.5610814094543457},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.5414507389068604},{"id":"https://openalex.org/keywords/low-rank-approximation","display_name":"Low-rank approximation","score":0.518592119216919},{"id":"https://openalex.org/keywords/learning-to-rank","display_name":"Learning to rank","score":0.4785540699958801},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46174103021621704},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4484338164329529},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.426790714263916},{"id":"https://openalex.org/keywords/thompson-sampling","display_name":"Thompson sampling","score":0.4181169867515564},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41429635882377625},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.4138500392436981},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.41167759895324707},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3862474262714386},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17096653580665588},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.11146324872970581},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.06767937541007996}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7539002895355225},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.6567666530609131},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.644877552986145},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.6142324209213257},{"id":"https://openalex.org/C557471498","wikidata":"https://www.wikidata.org/wiki/Q554950","display_name":"Recommender system","level":2,"score":0.5610814094543457},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.5414507389068604},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.518592119216919},{"id":"https://openalex.org/C86037889","wikidata":"https://www.wikidata.org/wiki/Q4330127","display_name":"Learning to rank","level":3,"score":0.4785540699958801},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46174103021621704},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4484338164329529},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.426790714263916},{"id":"https://openalex.org/C73602740","wikidata":"https://www.wikidata.org/wiki/Q7795822","display_name":"Thompson sampling","level":3,"score":0.4181169867515564},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41429635882377625},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4138500392436981},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.41167759895324707},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3862474262714386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17096653580665588},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.11146324872970581},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.06767937541007996},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C25023664","wikidata":"https://www.wikidata.org/wiki/Q1575637","display_name":"Hankel matrix","level":2,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3240323.3240408","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3240323.3240408","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th ACM Conference on Recommender Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1412447802","https://openalex.org/W1571154989","https://openalex.org/W1583837637","https://openalex.org/W1597703625","https://openalex.org/W1731081199","https://openalex.org/W2000157792","https://openalex.org/W2085040216","https://openalex.org/W2091780923","https://openalex.org/W2105767123","https://openalex.org/W2106005123","https://openalex.org/W2108738385","https://openalex.org/W2138505091","https://openalex.org/W2144730813","https://openalex.org/W2149721706","https://openalex.org/W2166163936","https://openalex.org/W2166253248","https://openalex.org/W2182342230","https://openalex.org/W2219888463","https://openalex.org/W2268674159","https://openalex.org/W2460071234","https://openalex.org/W2602868127","https://openalex.org/W2611328865","https://openalex.org/W2771185798","https://openalex.org/W2962818688","https://openalex.org/W2962901934","https://openalex.org/W2962980735","https://openalex.org/W2963007936","https://openalex.org/W2990138404","https://openalex.org/W3037875958","https://openalex.org/W3104501706","https://openalex.org/W6743606122"],"related_works":["https://openalex.org/W2964108162","https://openalex.org/W2772729003","https://openalex.org/W2752756450","https://openalex.org/W2962894463","https://openalex.org/W2962895005","https://openalex.org/W4308943899","https://openalex.org/W2894882275","https://openalex.org/W321429746","https://openalex.org/W3206415742","https://openalex.org/W4237339638"],"abstract_inverted_index":{"The":[0],"low-rank":[1,25],"structure":[2],"is":[3],"one":[4],"of":[5,76],"the":[6,41,48,53,57,91],"most":[7],"prominent":[8],"features":[9,32,35],"in":[10,56,93],"modern":[11],"recommendation":[12,64],"problems.":[13],"In":[14],"this":[15],"paper,":[16],"we":[17],"consider":[18],"an":[19],"online":[20,63],"learning":[21],"problem":[22],"with":[23],"a":[24,38,61,70],"expected":[26],"reward":[27],"matrix":[28],"where":[29],"both":[30,94],"row":[31],"and":[33,40,96],"column":[34],"are":[36],"unknown":[37],"priori,":[39],"agent":[42],"aims":[43],"to":[44,46],"learn":[45],"choose":[47],"best":[49],"row-column":[50],"pair":[51],"(i.e.":[52],"maximum":[54],"entry)":[55],"matrix.":[58],"We":[59],"develop":[60],"novel":[62],"algorithm":[65,85],"based":[66],"on":[67],"ensemble":[68],"sampling,":[69],"recently":[71],"developed":[72],"computationally":[73],"efficient":[74],"approximation":[75],"Thompson":[77],"sampling.":[78],"Our":[79],"computational":[80],"results":[81],"show":[82],"that":[83],"our":[84],"consistently":[86],"achieves":[87],"order-of-magnitude":[88],"improvements":[89],"over":[90],"baselines":[92],"synthetic":[95],"real-world":[97],"experiments.":[98]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
