{"total":23,"rows":[{"id":"2102.09626","title":"A Simple Unified Framework for High Dimensional Bandit Problems","created":"2021-02-18","cited_by_count":21,"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":"2106.01660","title":"Bandit Phase Retrieval","created":"2021-06-03","cited_by_count":12,"area":null},{"id":"2301.07040","title":"Optimal Algorithms for Latent Bandits with Cluster Structure","created":"2023-01-17","cited_by_count":12,"area":null},{"id":"2310.06793","title":"Spectral Entry-wise Matrix Estimation for Low-Rank Reinforcement Learning","created":"2023-10-10","cited_by_count":10,"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":"2209.03997","title":"Online Low Rank Matrix Completion","created":"2022-09-08","cited_by_count":9,"area":null},{"id":"2402.15739","title":"Low-Rank Bandits via Tight Two-to-Infinity Singular Subspace Recovery","created":"2024-02-24","cited_by_count":6,"area":null},{"id":"2411.01898","title":"Best-Arm Identification in Unimodal Bandits","created":"2024-11-04","cited_by_count":6,"area":null},{"id":"2108.00230","title":"Pure Exploration and Regret Minimization in Matching Bandits","created":"2021-07-31","cited_by_count":4,"area":null},{"id":"2112.01452","title":"Indexed Minimum Empirical Divergence for Unimodal Bandits","created":"2021-12-02","cited_by_count":4,"area":null},{"id":"2210.00340","title":"Speed Up the Cold-Start Learning in Two-Sided Bandits with Many Arms","created":"2022-10-01","cited_by_count":4,"area":null},{"id":"2306.13053","title":"Context-lumpable stochastic bandits","created":"2023-06-22","cited_by_count":4,"area":null},{"id":"2507.17528","title":"Generalized Low-Rank Matrix Contextual Bandits with Graph Information","created":"2025-07-23","cited_by_count":4,"area":null},{"id":"2209.06128","title":"A Scalable Recommendation Engine for New Users and Items","created":"2022-09-06","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":"2510.25811","title":"Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms","created":"2025-10-29","cited_by_count":1,"area":null},{"id":"2106.08187","title":"Thompson Sampling for Unimodal Bandits","created":"2021-06-15","cited_by_count":0,"area":null},{"id":"2302.05765","title":"Adversarial Online Collaborative Filtering","created":"2023-02-11","cited_by_count":0,"area":null},{"id":"2408.05843","title":"Online Matrix Completion: A Collaborative Approach with Hott Items","created":"2024-08-11","cited_by_count":0,"area":null},{"id":"2506.22186","title":"Thompson Sampling-Based Learning and Control for Unknown Dynamic Systems","created":"2025-06-27","cited_by_count":0,"area":null},{"id":"2512.00605","title":"Efficient Matroid Bandit Linear Optimization Leveraging Unimodality","created":"2025-11-29","cited_by_count":0,"area":null},{"id":"2602.15972","title":"Fast Online Learning with Gaussian Prior-Driven Hierarchical Unimodal Thompson Sampling","created":"2026-02-17","cited_by_count":0,"area":null}],"next_cursor":null}