{"total":20,"rows":[{"id":"2310.18554","title":"Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion","created":"2023-10-28","cited_by_count":24,"area":null},{"id":"2401.07298","title":"Efficient Frameworks for Generalized Low-Rank Matrix Bandit Problems","created":"2024-01-14","cited_by_count":20,"area":null},{"id":"2211.05964","title":"Thompson Sampling for High-Dimensional Sparse Linear Contextual Bandits","created":"2022-11-11","cited_by_count":16,"area":null},{"id":"2402.11156","title":"Efficient Low-Rank Matrix Estimation, Experimental Design, and Arm-Set-Dependent Low-Rank Bandits","created":"2024-02-17","cited_by_count":10,"area":null},{"id":"2107.03455","title":"Model Selection for Generic Contextual Bandits","created":"2021-07-07","cited_by_count":8,"area":null},{"id":"2307.12897","title":"Anytime Model Selection in Linear Bandits","created":"2023-07-24","cited_by_count":6,"area":null},{"id":"2506.12751","title":"Single Index Bandits: Generalized Linear Contextual Bandits with Unknown Reward Functions","created":"2025-06-15","cited_by_count":6,"area":null},{"id":"2306.11017","title":"High-dimensional Contextual Bandit Problem without Sparsity","created":"2023-06-19","cited_by_count":5,"area":null},{"id":"2202.13448","title":"Federated Online Sparse Decision Making","created":"2022-02-27","cited_by_count":3,"area":null},{"id":"2311.01327","title":"High-dimensional Linear Bandits with Knapsacks","created":"2023-11-02","cited_by_count":3,"area":null},{"id":"2406.01192","title":"Sparsity-Agnostic Linear Bandits with Adaptive Adversaries","created":"2024-06-03","cited_by_count":2,"area":null},{"id":"2209.08403","title":"Advertising Media and Target Audience Optimization via High-dimensional Bandits","created":"2022-09-17","cited_by_count":1,"area":null},{"id":"2311.00481","title":"Fixed-Budget Best-Arm Identification in Sparse Linear Bandits","created":"2023-11-01","cited_by_count":1,"area":null},{"id":"2311.01771","title":"Efficient Generalized Low-Rank Tensor Contextual Bandits","created":"2023-11-03","cited_by_count":1,"area":null},{"id":"2501.10722","title":"A Unified Regularization Approach to High-Dimensional Generalized Tensor Bandits","created":"2025-01-18","cited_by_count":1,"area":null},{"id":"2505.14102","title":"High-dimensional Nonparametric Contextual Bandit Problem","created":"2025-05-20","cited_by_count":1,"area":null},{"id":"2506.19752","title":"On the necessity of adaptive regularisation:Optimal anytime online learning on $\\boldsymbol{\\ell_p}$-balls","created":"2025-06-24","cited_by_count":1,"area":null},{"id":"2402.03737","title":"Differentially Private High Dimensional Bandits","created":"2024-02-06","cited_by_count":0,"area":null},{"id":"2410.20041","title":"Sparse Linear Bandits with Blocking Constraints","created":"2024-10-26","cited_by_count":0,"area":null},{"id":"2510.08435","title":"Navigating Sparsities in High-Dimensional Linear Contextual Bandits","created":"2025-10-09","cited_by_count":0,"area":null}],"next_cursor":null}