{"total":20,"rows":[{"id":"2205.06811","title":"Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions","created":"2022-05-13","cited_by_count":51,"area":null},{"id":"2212.05949","title":"Corruption-Robust Algorithms with Uncertainty Weighting for Nonlinear Contextual Bandits and Markov Decision Processes","created":"2022-12-12","cited_by_count":33,"area":null},{"id":"2101.06197","title":"Deciding What to Learn: A Rate-Distortion Approach","created":"2021-01-15","cited_by_count":23,"area":null},{"id":"2110.12615","title":"Linear Contextual Bandits with Adversarial Corruptions","created":"2021-10-25","cited_by_count":21,"area":null},{"id":"2206.02072","title":"Deciding What to Model: Value-Equivalent Sampling for Reinforcement Learning","created":"2022-06-04","cited_by_count":19,"area":null},{"id":"2102.06593","title":"Pareto Optimal Model Selection in Linear Bandits","created":"2021-02-12","cited_by_count":14,"area":null},{"id":"2101.12506","title":"Learning User Preferences in Non-Stationary Environments","created":"2021-01-29","cited_by_count":10,"area":null},{"id":"2103.02729","title":"Linear Bandit Algorithms with Sublinear Time Complexity","created":"2021-03-03","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":"2307.15893","title":"Online Matching: A Real-time Bandit System for Large-scale Recommendations","created":"2023-07-29","cited_by_count":8,"area":null},{"id":"2101.01086","title":"Be Greedy in Multi-Armed Bandits","created":"2021-01-04","cited_by_count":7,"area":null},{"id":"2302.08345","title":"Linear Bandits with Memory: from Rotting to Rising","created":"2023-02-16","cited_by_count":6,"area":null},{"id":"2502.15900","title":"Explaining the Success of Nearest Neighbor Methods in Prediction","created":"2025-02-21","cited_by_count":2,"area":null},{"id":"2411.12154","title":"Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds","created":"2024-11-19","cited_by_count":1,"area":null},{"id":"2202.03167","title":"Bayesian Non-stationary Linear Bandits for Large-Scale Recommender Systems","created":"2022-02-07","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":"2510.08435","title":"Navigating Sparsities in High-Dimensional Linear Contextual Bandits","created":"2025-10-09","cited_by_count":0,"area":null},{"id":"2605.05911","title":"PREFER: Personalized Review Summarization with Online Preference Learning","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2609.28718","title":"Exact Bayes Regret and Asymptotic Optimality in High-Dimensional Gaussian Bandits","created":"2026-09-23","cited_by_count":0,"area":null},{"id":"2609.30321","title":"Adaptive Random Matrices in Gaussian Bandits: Spectral Universality and Selection-Induced Outliers","created":"2026-09-23","cited_by_count":0,"area":null}],"next_cursor":null}