{"total":15,"rows":[{"id":"2210.15345","title":"PopArt: Efficient Sparse Regression and Experimental Design for Optimal Sparse Linear Bandits","created":"2022-10-25","cited_by_count":17,"area":null},{"id":"2205.10895","title":"Contextual Information-Directed Sampling","created":"2022-05-22","cited_by_count":16,"area":null},{"id":"2302.10805","title":"Repeated Bilateral Trade Against a Smoothed Adversary","created":"2023-02-21","cited_by_count":15,"area":null},{"id":"2306.06250","title":"Strategic Apple Tasting","created":"2023-06-09","cited_by_count":10,"area":null},{"id":"2507.15290","title":"Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown","created":"2025-07-21","cited_by_count":4,"area":null},{"id":"2211.13952","title":"Contextual Decision-Making with Knapsacks Beyond the Worst Case","created":"2022-11-25","cited_by_count":3,"area":null},{"id":"2303.16998","title":"Does Sparsity Help in Learning Misspecified Linear Bandits?","created":"2023-03-29","cited_by_count":3,"area":null},{"id":"2501.00891","title":"Demystifying Online Clustering of Bandits: Enhanced Exploration Under Stochastic and Smoothed Adversarial Contexts","created":"2025-01-01","cited_by_count":3,"area":null},{"id":"2501.14155","title":"Learning to Price with Resource Constraints: From Full Information to Machine-Learned Prices","created":"2025-01-24","cited_by_count":3,"area":null},{"id":"2301.13791","title":"Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback","created":"2023-01-31","cited_by_count":2,"area":null},{"id":"2406.01192","title":"Sparsity-Agnostic Linear Bandits with Adaptive Adversaries","created":"2024-06-03","cited_by_count":2,"area":null},{"id":"2103.00075","title":"Noisy Truncated SGD: Optimization and Generalization","created":"2021-02-26","cited_by_count":1,"area":null},{"id":"2312.12400","title":"New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem","created":"2023-12-19","cited_by_count":1,"area":null},{"id":"2503.10836","title":"Exploiting Concavity Information in Gaussian Process Contextual Bandit Optimization","created":"2025-03-13","cited_by_count":1,"area":null},{"id":"2510.26000","title":"Infrequent Exploration in Linear Bandits","created":"2025-10-29","cited_by_count":0,"area":null}],"next_cursor":null}