{"total":15,"rows":[{"id":"2203.15664","title":"Nearly Minimax Algorithms for Linear Bandits with Shared Representation","created":"2022-03-29","cited_by_count":16,"area":null},{"id":"2301.11518","title":"Online Learning in Stackelberg Games with an Omniscient Follower","created":"2023-01-27","cited_by_count":15,"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.06466","title":"Going Beyond Linear RL: Sample Efficient Neural Function Approximation","created":"2021-07-14","cited_by_count":9,"area":null},{"id":"2209.03997","title":"Online Low Rank Matrix Completion","created":"2022-09-08","cited_by_count":9,"area":null},{"id":"2302.06025","title":"Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits","created":"2023-02-12","cited_by_count":7,"area":null},{"id":"2302.04441","title":"Multi-task Representation Learning for Pure Exploration in Linear Bandits","created":"2023-02-09","cited_by_count":6,"area":null},{"id":"2305.00322","title":"Toward $L_\\infty$-recovery of Nonlinear Functions: A Polynomial Sample Complexity Bound for Gaussian Random Fields","created":"2023-04-29","cited_by_count":4,"area":null},{"id":"2306.12383","title":"Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms","created":"2023-06-21","cited_by_count":2,"area":null},{"id":"2405.07331","title":"Stochastic Bandits with ReLU Neural Networks","created":"2024-05-12","cited_by_count":2,"area":null},{"id":"2503.00273","title":"Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits","created":"2025-03-01","cited_by_count":2,"area":null},{"id":"2503.04010","title":"Greedy Algorithm for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure","created":"2025-03-06","cited_by_count":2,"area":null},{"id":"2510.00803","title":"Online Minimization of Polarization and Disagreement via Low-Rank Matrix Bandits","created":"2025-10-01","cited_by_count":1,"area":null},{"id":"2602.17876","title":"Interactive Learning of Single-Index Models via Stochastic Gradient Descent","created":"2026-02-19","cited_by_count":1,"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}],"next_cursor":null}