{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:06:40Z","timestamp":1772906800269,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":66,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,6]]},"DOI":"10.1145\/3580305.3599329","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:13:58Z","timestamp":1691172838000},"page":"2431-2443","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Sparse Linear Bandits under High Dimensional Data"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-2296-9688","authenticated-orcid":false,"given":"Xue","family":"Wang","sequence":"first","affiliation":[{"name":"Alibaba Group US, bellevue, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7867-2646","authenticated-orcid":false,"given":"Mike Mingcheng","family":"Wei","sequence":"additional","affiliation":[{"name":"University at Buffalo, Buffalo, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2124-5678","authenticated-orcid":false,"given":"Tao","family":"Yao","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shenzhen, ShenZhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Yasin Abbasi-Yadkori D\u00e1vid P\u00e1l and Csaba Szepesv\u00e1ri. 2011. Improved algorithms for linear stochastic bandits. In Advances in Neural Information Processing Systems. 2312--2320.  Yasin Abbasi-Yadkori D\u00e1vid P\u00e1l and Csaba Szepesv\u00e1ri. 2011. Improved algorithms for linear stochastic bandits. In Advances in Neural Information Processing Systems. 2312--2320."},{"key":"e_1_3_2_2_2_1","unstructured":"Yasin Abbasi-Yadkori David Pal and Csaba Szepesvari. 2012. Online-to-confidence-set conversions and application to sparse stochastic bandits. In Artificial Intelligence and Statistics. PMLR 1--9.  Yasin Abbasi-Yadkori David Pal and Csaba Szepesvari. 2012. Online-to-confidence-set conversions and application to sparse stochastic bandits. In Artificial Intelligence and Statistics. PMLR 1--9."},{"key":"e_1_3_2_2_3_1","unstructured":"Deepak Agarwal Bee-Chung Chen Pradheep Elango Nitin Motgi Seung-Taek Park Raghu Ramakrishnan Scott Roy and Joe Zachariah. 2009. Online models for content optimization. In Advances in Neural Information Processing Systems. 17--24.  Deepak Agarwal Bee-Chung Chen Pradheep Elango Nitin Motgi Seung-Taek Park Raghu Ramakrishnan Scott Roy and Joe Zachariah. 2009. Online models for content optimization. In Advances in Neural Information Processing Systems. 17--24."},{"key":"e_1_3_2_2_4_1","volume-title":"International Conference on Machine Learning. 127--135","author":"Agrawal Shipra","year":"2013","unstructured":"Shipra Agrawal and Navin Goyal . 2013 . Thompson sampling for contextual bandits with linear payoffs . In International Conference on Machine Learning. 127--135 . Shipra Agrawal and Navin Goyal. 2013. Thompson sampling for contextual bandits with linear payoffs. In International Conference on Machine Learning. 127--135."},{"key":"e_1_3_2_2_5_1","volume-title":"International Conference on Machine Learning. PMLR, 878--928","author":"Ariu Kaito","year":"2022","unstructured":"Kaito Ariu , Kenshi Abe , and Alexandre Prouti\u00e8re . 2022 . Thresholded lasso bandit . In International Conference on Machine Learning. PMLR, 878--928 . Kaito Ariu, Kenshi Abe, and Alexandre Prouti\u00e8re. 2022. Thresholded lasso bandit. In International Conference on Machine Learning. PMLR, 878--928."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-6265-7"},{"key":"e_1_3_2_2_7_1","first-page":"397","article-title":"Using confidence bounds for exploitation-exploration trade-offs","volume":"3","author":"Auer Peter","year":"2002","unstructured":"Peter Auer . 2002 . Using confidence bounds for exploitation-exploration trade-offs . Journal of Machine Learning Research , Vol. 3 , Nov (2002), 397 -- 422 . Peter Auer. 2002. Using confidence bounds for exploitation-exploration trade-offs. Journal of Machine Learning Research, Vol. 3, Nov (2002), 397--422.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1902"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOS620"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Stephen Boyd Neal Parikh Eric Chu Borja Peleato Jonathan Eckstein etal 2011. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends\u00ae in Machine learning Vol. 3 1 (2011) 1--122.  Stephen Boyd Neal Parikh Eric Chu Borja Peleato Jonathan Eckstein et al. 2011. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends\u00ae in Machine learning Vol. 3 1 (2011) 1--122.","DOI":"10.1561\/2200000016"},{"key":"e_1_3_2_2_11_1","volume-title":"Statistics for high-dimensional data: methods, theory and applications","author":"B\u00fchlmann Peter","unstructured":"Peter B\u00fchlmann and Sara Van De Geer . 2011. Statistics for high-dimensional data: methods, theory and applications . Springer Science & Business Media . Peter B\u00fchlmann and Sara Van De Geer. 2011. Statistics for high-dimensional data: methods, theory and applications. Springer Science & Business Media."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Emmanuel Candes Terence Tao etal 2007. The Dantzig selector: Statistical estimation when p is much larger than n. The annals of Statistics Vol. 35 6 (2007) 2313--2351.  Emmanuel Candes Terence Tao et al. 2007. The Dantzig selector: Statistical estimation when p is much larger than n. The annals of Statistics Vol. 35 6 (2007) 2313--2351.","DOI":"10.1214\/009053606000001523"},{"key":"e_1_3_2_2_13_1","unstructured":"Alexandra Carpentier and R\u00e9mi Munos. 2012. Bandit theory meets compressed sensing for high dimensional stochastic linear bandit. In Artificial Intelligence and Statistics. PMLR 190--198.  Alexandra Carpentier and R\u00e9mi Munos. 2012. Bandit theory meets compressed sensing for high dimensional stochastic linear bandit. In Artificial Intelligence and Statistics. PMLR 190--198."},{"key":"e_1_3_2_2_14_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR","author":"Chatterji Niladri","year":"2020","unstructured":"Niladri Chatterji , Vidya Muthukumar , and Peter Bartlett . 2020 . Osom: A simultaneously optimal algorithm for multi-armed and linear contextual bandits . In International Conference on Artificial Intelligence and Statistics. PMLR , 1844--1854. Niladri Chatterji, Vidya Muthukumar, and Peter Bartlett. 2020. Osom: A simultaneously optimal algorithm for multi-armed and linear contextual bandits. In International Conference on Artificial Intelligence and Statistics. PMLR, 1844--1854."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Cheng Chen Luo Luo Weinan Zhang Yong Yu and Yijiang Lian. 2020. Efficient and Robust High-Dimensional Linear Contextual Bandits. IJCAI.  Cheng Chen Luo Luo Weinan Zhang Yong Yu and Yijiang Lian. 2020. Efficient and Robust High-Dimensional Linear Contextual Bandits. IJCAI.","DOI":"10.24963\/ijcai.2020\/588"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Yi Chen Yining Wang Ethan X Fang Zhaoran Wang and Runze Li. 2022. Nearly dimension-independent sparse linear bandit over small action spaces via best subset selection. J. Amer. Statist. Assoc. (2022) 1--13.  Yi Chen Yining Wang Ethan X Fang Zhaoran Wang and Runze Li. 2022. Nearly dimension-independent sparse linear bandit over small action spaces via best subset selection. J. Amer. Statist. Assoc. (2022) 1--13.","DOI":"10.1080\/01621459.2022.2108816"},{"key":"e_1_3_2_2_17_1","volume-title":"Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics. JMLR Workshop and Conference Proceedings, 208--214","author":"Chu Wei","year":"2011","unstructured":"Wei Chu , Lihong Li , Lev Reyzin , and Robert Schapire . 2011 . Contextual bandits with linear payoff functions . In Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics. JMLR Workshop and Conference Proceedings, 208--214 . Wei Chu, Lihong Li, Lev Reyzin, and Robert Schapire. 2011. Contextual bandits with linear payoff functions. In Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics. JMLR Workshop and Conference Proceedings, 208--214."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3019134"},{"key":"e_1_3_2_2_19_1","volume-title":"International Conference on Machine Learning. PMLR, 2276--2285","author":"Cutkosky Ashok","year":"2021","unstructured":"Ashok Cutkosky , Christoph Dann , Abhimanyu Das , Claudio Gentile , Aldo Pacchiano , and Manish Purohit . 2021 . Dynamic balancing for model selection in bandits and rl . In International Conference on Machine Learning. PMLR, 2276--2285 . Ashok Cutkosky, Christoph Dann, Abhimanyu Das, Claudio Gentile, Aldo Pacchiano, and Manish Purohit. 2021. Dynamic balancing for model selection in bandits and rl. In International Conference on Machine Learning. PMLR, 2276--2285."},{"key":"e_1_3_2_2_20_1","unstructured":"Varsha Dani Thomas P Hayes and Sham M Kakade. 2008. Stochastic linear optimization under bandit feedback. (2008).  Varsha Dani Thomas P Hayes and Sham M Kakade. 2008. Stochastic linear optimization under bandit feedback. (2008)."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753382273"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1568"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1198"},{"key":"e_1_3_2_2_24_1","volume-title":"Proceedings of the 20th international conference on machine learning (ICML-03)","author":"Fern Xiaoli Z","year":"2003","unstructured":"Xiaoli Z Fern and Carla E Brodley . 2003 . Random projection for high dimensional data clustering: A cluster ensemble approach . In Proceedings of the 20th international conference on machine learning (ICML-03) . 186--193. Xiaoli Z Fern and Carla E Brodley. 2003. Random projection for high dimensional data clustering: A cluster ensemble approach. In Proceedings of the 20th international conference on machine learning (ICML-03). 186--193."},{"key":"e_1_3_2_2_25_1","first-page":"14741","article-title":"Model Selection for Contextual Bandits","volume":"32","author":"Foster Dylan J","year":"2019","unstructured":"Dylan J Foster , Akshay Krishnamurthy , and Haipeng Luo . 2019 . Model Selection for Contextual Bandits . Advances in Neural Information Processing Systems , Vol. 32 (2019), 14741 -- 14752 . Dylan J Foster, Akshay Krishnamurthy, and Haipeng Luo. 2019. Model Selection for Contextual Bandits. Advances in Neural Information Processing Systems, Vol. 32 (2019), 14741--14752.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1009718"},{"key":"e_1_3_2_2_27_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR, 1396--1404","author":"Ghosh Avishek","year":"2021","unstructured":"Avishek Ghosh , Abishek Sankararaman , and Ramchandran Kannan . 2021 . Problem-complexity adaptive model selection for stochastic linear bandits . In International Conference on Artificial Intelligence and Statistics. PMLR, 1396--1404 . Avishek Ghosh, Abishek Sankararaman, and Ramchandran Kannan. 2021. Problem-complexity adaptive model selection for stochastic linear bandits. In International Conference on Artificial Intelligence and Statistics. PMLR, 1396--1404."},{"key":"e_1_3_2_2_28_1","volume-title":"Information Directed Sampling for Sparse Linear Bandits. Advances in Neural Information Processing Systems","author":"Hao Botao","year":"2021","unstructured":"Botao Hao , Tor Lattimore , and Wei Deng . 2021. Information Directed Sampling for Sparse Linear Bandits. Advances in Neural Information Processing Systems ( 2021 ). Botao Hao, Tor Lattimore, and Wei Deng. 2021. Information Directed Sampling for Sparse Linear Bandits. Advances in Neural Information Processing Systems (2021)."},{"key":"e_1_3_2_2_29_1","first-page":"10753","article-title":"High-Dimensional Sparse Linear Bandits","volume":"33","author":"Hao Botao","year":"2020","unstructured":"Botao Hao , Tor Lattimore , and Mengdi Wang . 2020 . High-Dimensional Sparse Linear Bandits . Advances in Neural Information Processing Systems , Vol. 33 (2020), 10753 -- 10763 . Botao Hao, Tor Lattimore, and Mengdi Wang. 2020. High-Dimensional Sparse Linear Bandits. Advances in Neural Information Processing Systems, Vol. 33 (2020), 10753--10763.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_30_1","volume-title":"Accelerating stochastic gradient descent using predictive variance reduction. Advances in neural information processing systems","author":"Johnson Rie","year":"2013","unstructured":"Rie Johnson and Tong Zhang . 2013. Accelerating stochastic gradient descent using predictive variance reduction. Advances in neural information processing systems , Vol. 26 ( 2013 ), 315--323. Rie Johnson and Tong Zhang. 2013. Accelerating stochastic gradient descent using predictive variance reduction. Advances in neural information processing systems, Vol. 26 (2013), 315--323."},{"key":"e_1_3_2_2_31_1","unstructured":"Gi-Soo Kim and Myunghee Cho Paik. 2019. Doubly-Robust Lasso Bandit. In Advances in Neural Information Processing Systems. 5869--5879.  Gi-Soo Kim and Myunghee Cho Paik. 2019. Doubly-Robust Lasso Bandit. In Advances in Neural Information Processing Systems. 5869--5879."},{"key":"e_1_3_2_2_32_1","volume-title":"Optimal Model Selection in Contextual Bandits with Many Classes via Offline Oracles. arXiv preprint arXiv:2106.06483","author":"Krishnamurthy Sanath Kumar","year":"2021","unstructured":"Sanath Kumar Krishnamurthy and Susan Athey . 2021. Optimal Model Selection in Contextual Bandits with Many Classes via Offline Oracles. arXiv preprint arXiv:2106.06483 ( 2021 ). Sanath Kumar Krishnamurthy and Susan Athey. 2021. Optimal Model Selection in Contextual Bandits with Many Classes via Offline Oracles. arXiv preprint arXiv:2106.06483 (2021)."},{"key":"e_1_3_2_2_33_1","volume-title":"The 22nd International Conference on Artificial Intelligence and Statistics. PMLR, 177--185","author":"Kuzborskij Ilja","year":"2019","unstructured":"Ilja Kuzborskij , Leonardo Cella , and Nicol\u00f2 Cesa-Bianchi . 2019 . Efficient linear bandits through matrix sketching . In The 22nd International Conference on Artificial Intelligence and Statistics. PMLR, 177--185 . Ilja Kuzborskij, Leonardo Cella, and Nicol\u00f2 Cesa-Bianchi. 2019. Efficient linear bandits through matrix sketching. In The 22nd International Conference on Artificial Intelligence and Statistics. PMLR, 177--185."},{"key":"e_1_3_2_2_34_1","unstructured":"Tor Lattimore Koby Crammer and Csaba Szepesv\u00e1ri. 2015. Linear Multi-Resource Allocation with Semi-Bandit Feedback.. In NIPS. 964--972.  Tor Lattimore Koby Crammer and Csaba Szepesv\u00e1ri. 2015. Linear Multi-Resource Allocation with Semi-Bandit Feedback.. In NIPS. 964--972."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/3305890.3305895"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150436"},{"key":"e_1_3_2_2_38_1","volume-title":"International Conference on Machine Learning. PMLR, 12619--12655","author":"Li Wenjie","year":"2022","unstructured":"Wenjie Li , Adarsh Barik , and Jean Honorio . 2022 . A simple unified framework for high dimensional bandit problems . In International Conference on Machine Learning. PMLR, 12619--12655 . Wenjie Li, Adarsh Barik, and Jean Honorio. 2022. A simple unified framework for high dimensional bandit problems. In International Conference on Machine Learning. PMLR, 12619--12655."},{"key":"e_1_3_2_2_39_1","volume-title":"Dimension reduction in contextual online learning via nonparametric variable selection. arXiv preprint arXiv:2009.08265","author":"Li Wenhao","year":"2020","unstructured":"Wenhao Li , Ningyuan Chen , and L Jeff Hong . 2020. Dimension reduction in contextual online learning via nonparametric variable selection. arXiv preprint arXiv:2009.08265 ( 2020 ). Wenhao Li, Ningyuan Chen, and L Jeff Hong. 2020. Dimension reduction in contextual online learning via nonparametric variable selection. arXiv preprint arXiv:2009.08265 (2020)."},{"key":"e_1_3_2_2_40_1","volume-title":"Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions. Mathematical programming","author":"Liu Hongcheng","year":"2017","unstructured":"Hongcheng Liu , Tao Yao , Runze Li , and Yinyu Ye. 2017. Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions. Mathematical programming , Vol. 166 , 1--2 ( 2017 ), 207--240. Hongcheng Liu, Tao Yao, Runze Li, and Yinyu Ye. 2017. Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions. Mathematical programming, Vol. 166, 1--2 (2017), 207--240."},{"key":"e_1_3_2_2_41_1","unstructured":"Po-Ling Loh and Martin J Wainwright. 2013. Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima. In Advances in Neural Information Processing Systems. 476--484.  Po-Ling Loh and Martin J Wainwright. 2013. Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima. In Advances in Neural Information Processing Systems. 476--484."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1530"},{"key":"e_1_3_2_2_43_1","unstructured":"Haipeng Luo Alekh Agarwal Nicolo Cesa-Bianchi and John Langford. 2016. Efficient second order online learning by sketching. In Advances in Neural Information Processing Systems. 902--910.  Haipeng Luo Alekh Agarwal Nicolo Cesa-Bianchi and John Langford. 2016. Efficient second order online learning by sketching. In Advances in Neural Information Processing Systems. 902--910."},{"key":"e_1_3_2_2_44_1","volume-title":"Advances in Neural Information Processing Systems","volume":"34","author":"Marinov Teodor Vanislavov","year":"2021","unstructured":"Teodor Vanislavov Marinov and Julian Zimmert . 2021 . The Pareto Frontier of model selection for general Contextual Bandits . Advances in Neural Information Processing Systems , Vol. 34 (2021). Teodor Vanislavov Marinov and Julian Zimmert. 2021. The Pareto Frontier of model selection for general Contextual Bandits. Advances in Neural Information Processing Systems, Vol. 34 (2021)."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/1400123.1400129"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"Nicolai Meinshausen Peter B\u00fchlmann etal 2006. High-dimensional graphs and variable selection with the lasso. The annals of statistics Vol. 34 3 (2006) 1436--1462.  Nicolai Meinshausen Peter B\u00fchlmann et al. 2006. High-dimensional graphs and variable selection with the lasso. The annals of statistics Vol. 34 3 (2006) 1436--1462.","DOI":"10.1214\/009053606000000281"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"crossref","unstructured":"Nicolai Meinshausen Bin Yu etal 2009. Lasso-type recovery of sparse representations for high-dimensional data. The annals of statistics Vol. 37 1 (2009) 246--270.  Nicolai Meinshausen Bin Yu et al. 2009. Lasso-type recovery of sparse representations for high-dimensional data. The annals of statistics Vol. 37 1 (2009) 246--270.","DOI":"10.1214\/07-AOS582"},{"key":"e_1_3_2_2_48_1","volume-title":"Parameter and Feature Selection in Stochastic Linear Bandits. In The 24nd International Conference on Artificial Intelligence and Statistics.","author":"Moradipari Ahmadreza","year":"2021","unstructured":"Ahmadreza Moradipari , Yasin Abbasi-Yadkori , Mahnoosh Alizadeh , and Mohammad Ghavamzadeh . 2021 . Parameter and Feature Selection in Stochastic Linear Bandits. In The 24nd International Conference on Artificial Intelligence and Statistics. Ahmadreza Moradipari, Yasin Abbasi-Yadkori, Mahnoosh Alizadeh, and Mohammad Ghavamzadeh. 2021. Parameter and Feature Selection in Stochastic Linear Bandits. In The 24nd International Conference on Artificial Intelligence and Statistics."},{"key":"e_1_3_2_2_49_1","volume-title":"The 24nd International Conference on Artificial Intelligence and Statistics.","author":"Muthukumar Vidya","year":"2021","unstructured":"Vidya Muthukumar and Akshay Krishnamurthy . 2021 . Universal and data-adaptive algorithms for model selection in linear contextual bandits . In The 24nd International Conference on Artificial Intelligence and Statistics. Vidya Muthukumar and Akshay Krishnamurthy. 2021. Universal and data-adaptive algorithms for model selection in linear contextual bandits. In The 24nd International Conference on Artificial Intelligence and Statistics."},{"key":"e_1_3_2_2_50_1","volume-title":"International Conference on Machine Learning. PMLR, 8271--8280","author":"Iyengar Garud","year":"2021","unstructured":"Min-hwan Oh, Garud Iyengar , and Assaf Zeevi . 2021 . Sparsity-agnostic lasso bandit . In International Conference on Machine Learning. PMLR, 8271--8280 . Min-hwan Oh, Garud Iyengar, and Assaf Zeevi. 2021. Sparsity-agnostic lasso bandit. In International Conference on Machine Learning. PMLR, 8271--8280."},{"key":"e_1_3_2_2_51_1","volume-title":"Regret bound balancing and elimination for model selection in bandits and rl. arXiv preprint arXiv:2012.13045","author":"Pacchiano Aldo","year":"2020","unstructured":"Aldo Pacchiano , Christoph Dann , Claudio Gentile , and Peter Bartlett . 2020. Regret bound balancing and elimination for model selection in bandits and rl. arXiv preprint arXiv:2012.13045 ( 2020 ). Aldo Pacchiano, Christoph Dann, Claudio Gentile, and Peter Bartlett. 2020. Regret bound balancing and elimination for model selection in bandits and rl. arXiv preprint arXiv:2012.13045 (2020)."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2450722"},{"key":"e_1_3_2_2_53_1","volume-title":"Dynamic batch learning in high-dimensional sparse linear contextual bandits. arXiv preprint arXiv:2008.11918","author":"Ren Zhimei","year":"2020","unstructured":"Zhimei Ren and Zhengyuan Zhou . 2020. Dynamic batch learning in high-dimensional sparse linear contextual bandits. arXiv preprint arXiv:2008.11918 ( 2020 ). Zhimei Ren and Zhengyuan Zhou. 2020. Dynamic batch learning in high-dimensional sparse linear contextual bandits. arXiv preprint arXiv:2008.11918 (2020)."},{"key":"e_1_3_2_2_54_1","volume-title":"International Conference on Machine Learning. PMLR, 9026--9035","author":"Sivakumar Vidyashankar","year":"2020","unstructured":"Vidyashankar Sivakumar , Steven Wu , and Arindam Banerjee . 2020 . Structured linear contextual bandits: A sharp and geometric smoothed analysis . In International Conference on Machine Learning. PMLR, 9026--9035 . Vidyashankar Sivakumar, Steven Wu, and Arindam Banerjee. 2020. Structured linear contextual bandits: A sharp and geometric smoothed analysis. In International Conference on Machine Learning. PMLR, 9026--9035."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2514700"},{"key":"e_1_3_2_2_56_1","volume-title":"Accessed: Oct 22nd","year":"2012","unstructured":"Tencent. 2012 . Predict the click-through rate of ads given the query and user information. https:\/\/www.kaggle.com\/c\/kddcup2012-track2 . Accessed: Oct 22nd , 2018. Tencent. 2012. Predict the click-through rate of ads given the query and user information. https:\/\/www.kaggle.com\/c\/kddcup2012-track2. Accessed: Oct 22nd, 2018."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"e_1_3_2_2_58_1","volume-title":"Foundations and Trends\u00ae in Machine Learning","volume":"8","author":"Joel","year":"2015","unstructured":"Joel A Tropp et al. 2015. An introduction to matrix concentration inequalities . Foundations and Trends\u00ae in Machine Learning , Vol. 8 , 1--2 ( 2015 ), 1--230. Joel A Tropp et al. 2015. An introduction to matrix concentration inequalities. Foundations and Trends\u00ae in Machine Learning, Vol. 8, 1--2 (2015), 1--230."},{"key":"e_1_3_2_2_59_1","unstructured":"SA van de Geer. 2000. Empirical process theory and applications.  SA van de Geer. 2000. Empirical process theory and applications."},{"key":"e_1_3_2_2_60_1","volume-title":"Introduction to the non-asymptotic analysis of random matrices. arXiv preprint arXiv:1011.3027","author":"Vershynin Roman","year":"2010","unstructured":"Roman Vershynin . 2010. Introduction to the non-asymptotic analysis of random matrices. arXiv preprint arXiv:1011.3027 ( 2010 ). Roman Vershynin. 2010. Introduction to the non-asymptotic analysis of random matrices. arXiv preprint arXiv:1011.3027 (2010)."},{"key":"e_1_3_2_2_61_1","volume-title":"Minimax Concave Penalized Multi-Armed Bandit Model with High-Dimensional Convariates. In International Conference on Machine Learning. 5187--5195","author":"Wang Xue","year":"2018","unstructured":"Xue Wang , Mike Mingcheng Wei , and Tao Yao . 2018 a. Minimax Concave Penalized Multi-Armed Bandit Model with High-Dimensional Convariates. In International Conference on Machine Learning. 5187--5195 . Xue Wang, Mike Mingcheng Wei, and Tao Yao. 2018a. Minimax Concave Penalized Multi-Armed Bandit Model with High-Dimensional Convariates. In International Conference on Machine Learning. 5187--5195."},{"key":"e_1_3_2_2_62_1","volume-title":"Mike Mingcheng Wei, and Tao Yao","author":"Wang Xue","year":"2018","unstructured":"Xue Wang , Mike Mingcheng Wei, and Tao Yao . 2018 b. Online Learning and Decision-Making under Generalized Linear Model with High-Dimensional Data . Available at SSRN 3294832 (2018). Xue Wang, Mike Mingcheng Wei, and Tao Yao. 2018b. Online Learning and Decision-Making under Generalized Linear Model with High-Dimensional Data. Available at SSRN 3294832 (2018)."},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10888"},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS729"},{"key":"e_1_3_2_2_65_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR, 6735--6769","author":"Zhu Yinglun","year":"2022","unstructured":"Yinglun Zhu , Julian Katz-Samuels , and Robert Nowak . 2022 . Near instance optimal model selection for pure exploration linear bandits . In International Conference on Artificial Intelligence and Statistics. PMLR, 6735--6769 . Yinglun Zhu, Julian Katz-Samuels, and Robert Nowak. 2022. Near instance optimal model selection for pure exploration linear bandits. In International Conference on Artificial Intelligence and Statistics. PMLR, 6735--6769."},{"key":"e_1_3_2_2_66_1","volume-title":"International Conference on Artificial Intelligence and Statistics. PMLR, 6793--6813","author":"Zhu Yinglun","year":"2022","unstructured":"Yinglun Zhu and Robert Nowak . 2022 . Pareto optimal model selection in linear bandits . In International Conference on Artificial Intelligence and Statistics. PMLR, 6793--6813 . Yinglun Zhu and Robert Nowak. 2022. Pareto optimal model selection in linear bandits. In International Conference on Artificial Intelligence and Statistics. PMLR, 6793--6813."}],"event":{"name":"KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Long Beach CA USA","acronym":"KDD '23","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599329","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599329","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:47Z","timestamp":1750178267000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599329"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":66,"alternative-id":["10.1145\/3580305.3599329","10.1145\/3580305"],"URL":"https:\/\/doi.org\/10.1145\/3580305.3599329","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}