{"total":25,"rows":[{"id":"2103.05324","title":"A Simple Approach for Non-stationary Linear Bandits","created":"2021-03-09","cited_by_count":54,"area":null},{"id":"2201.01985","title":"Jointly Efficient and Optimal Algorithms for Logistic Bandits","created":"2022-01-06","cited_by_count":41,"area":null},{"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":"2103.13929","title":"Multinomial Logit Contextual Bandits: Provable Optimality and Practicality","created":"2021-03-25","cited_by_count":21,"area":null},{"id":"2110.10018","title":"Dynamic pricing and assortment under a contextual MNL demand","created":"2021-10-19","cited_by_count":20,"area":null},{"id":"2405.09831","title":"Nearly Minimax Optimal Regret for Multinomial Logistic Bandit","created":"2024-05-16","cited_by_count":20,"area":null},{"id":"2104.05245","title":"Distributed Learning Systems with First-order Methods","created":"2021-04-12","cited_by_count":17,"area":null},{"id":"2111.03290","title":"Maillard Sampling: Boltzmann Exploration Done Optimally","created":"2021-11-05","cited_by_count":13,"area":null},{"id":"2202.01087","title":"Communication Efficient Federated Learning for Generalized Linear Bandits","created":"2022-02-02","cited_by_count":13,"area":null},{"id":"2310.18701","title":"Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards","created":"2023-10-28","cited_by_count":11,"area":null},{"id":"2105.03962","title":"Stochastic Multi-Armed Bandits with Control Variates","created":"2021-05-09","cited_by_count":7,"area":null},{"id":"2402.07341","title":"Noise-Adaptive Confidence Sets for Linear Bandits and Application to Bayesian Optimization","created":"2024-02-12","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":"2503.00419","title":"Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update","created":"2025-03-01","cited_by_count":5,"area":null},{"id":"2601.01069","title":"Revisiting Weighted Strategy for Non-stationary Parametric Bandits and MDPs","created":"2026-01-03","cited_by_count":5,"area":null},{"id":"2205.15376","title":"Reinforcement Learning with a Terminator","created":"2022-05-30","cited_by_count":4,"area":null},{"id":"2512.23190","title":"A Simple, Optimal and Efficient Algorithm for Online Exp-Concave Optimization","created":"2025-12-29","cited_by_count":3,"area":null},{"id":"2103.04387","title":"CORe: Capitalizing On Rewards in Bandit Exploration","created":"2021-03-07","cited_by_count":1,"area":null},{"id":"2302.09440","title":"Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits","created":"2023-02-18","cited_by_count":1,"area":null},{"id":"2602.10971","title":"A Jointly Efficient and Optimal Algorithm for Heteroskedastic Generalized Linear Bandits with Adversarial Corruptions","created":"2026-02-11","cited_by_count":1,"area":null},{"id":"2106.03546","title":"On Learning to Rank Long Sequences with Contextual Bandits","created":"2021-06-07","cited_by_count":0,"area":null},{"id":"2303.02691","title":"Revisiting Weighted Strategy for Non-stationary Parametric Bandits","created":"2023-03-05","cited_by_count":0,"area":null},{"id":"2511.07504","title":"Tractable Instances of Bilinear Maximization: Implementing LinUCB on Ellipsoids","created":"2025-11-10","cited_by_count":0,"area":null},{"id":"2603.02100","title":"Stochastic Multi-Armed Bandits with Limited Control Variates","created":"2026-03-02","cited_by_count":0,"area":null},{"id":"2606.11968","title":"Efficient Multinomial Logistic Bandit via Frequent Directions","created":"2026-06-10","cited_by_count":0,"area":null}],"next_cursor":null}