{"total":29,"rows":[{"id":"2201.01985","title":"Jointly Efficient and Optimal Algorithms for Logistic Bandits","created":"2022-01-06","cited_by_count":41,"area":null},{"id":"2407.13977","title":"A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits","created":"2024-07-19","cited_by_count":29,"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":"2106.01420","title":"Parallelizing Thompson Sampling","created":"2021-06-02","cited_by_count":20,"area":null},{"id":"2207.02357","title":"Instance-optimal PAC Algorithms for Contextual Bandits","created":"2022-07-05","cited_by_count":16,"area":null},{"id":"2507.11847","title":"Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update","created":"2025-07-16","cited_by_count":16,"area":null},{"id":"2209.06983","title":"Double Doubly Robust Thompson Sampling for Generalized Linear Contextual Bandits","created":"2022-09-15","cited_by_count":14,"area":null},{"id":"2109.08792","title":"Learning to be Fair: A Consequentialist Approach to Equitable Decision-Making","created":"2021-09-18","cited_by_count":11,"area":null},{"id":"2410.01112","title":"Almost Free: Self-concordance in Natural Exponential Families and an Application to Bandits","created":"2024-10-01","cited_by_count":8,"area":null},{"id":"2202.02407","title":"An Experimental Design Approach for Regret Minimization in Logistic Bandits","created":"2022-02-04","cited_by_count":7,"area":null},{"id":"2207.03609","title":"One for All: Simultaneous Metric and Preference Learning over Multiple Users","created":"2022-07-07","cited_by_count":6,"area":null},{"id":"2405.03059","title":"Active Preference Learning for Ordering Items In- and Out-of-sample","created":"2024-05-05","cited_by_count":6,"area":null},{"id":"2505.02069","title":"Neural Logistic Bandits","created":"2025-05-04","cited_by_count":6,"area":null},{"id":"2205.15376","title":"Reinforcement Learning with a Terminator","created":"2022-05-30","cited_by_count":4,"area":null},{"id":"2601.19300","title":"Queue Length Regret Bounds for Contextual Queueing Bandits","created":"2026-01-27","cited_by_count":4,"area":null},{"id":"2109.14412","title":"Apple Tasting Revisited: Bayesian Approaches to Partially Monitored Online Binary Classification","created":"2021-09-29","cited_by_count":3,"area":null},{"id":"2310.06069","title":"Optimal Exploration is no harder than Thompson Sampling","created":"2023-10-09","cited_by_count":3,"area":null},{"id":"2409.05798","title":"Enhancing Preference-based Linear Bandits via Human Response Time","created":"2024-09-09","cited_by_count":3,"area":null},{"id":"2507.05306","title":"Enjoying Non-linearity in Multinomial Logistic Bandits: A Minimax-Optimal Algorithm","created":"2025-07-07","cited_by_count":3,"area":null},{"id":"2410.20640","title":"Near Optimal Pure Exploration in Logistic Bandits","created":"2024-10-28","cited_by_count":2,"area":null},{"id":"2510.10730","title":"Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits","created":"2025-10-12","cited_by_count":2,"area":null},{"id":"2606.09668","title":"Algorithm for Contextual Queueing Bandits with Rate-Optimal Queue Length Regret","created":"2026-06-08","cited_by_count":2,"area":null},{"id":"2206.04456","title":"Choosing Answers in $\\varepsilon$-Best-Answer Identification for Linear Bandits","created":"2022-06-09","cited_by_count":1,"area":null},{"id":"2508.13981","title":"Multi-User Contextual Cascading Bandits for Personalized Recommendation","created":"2025-08-19","cited_by_count":1,"area":null},{"id":"2604.22161","title":"Logistic Bandits with $\\tilde{O}(\\sqrt{dT})$ Regret without Context Diversity Assumptions","created":"2026-04-24","cited_by_count":1,"area":null},{"id":"2605.05745","title":"Best Arm Identification in Generalized Linear Bandits via Hybrid Feedback","created":"2026-05-07","cited_by_count":1,"area":null},{"id":"2510.17390","title":"Exploration via Feature Perturbation in Contextual Bandits","created":"2025-10-20","cited_by_count":0,"area":null},{"id":"2603.07005","title":"Combinatorial Allocation Bandits with Nonlinear Arm Utility","created":"2026-03-07","cited_by_count":0,"area":null},{"id":"2610.01377","title":"Minimax Optimal Regret for Causal Logistic Bandits with Counterfactual Fairness","created":"2026-10-01","cited_by_count":0,"area":null}],"next_cursor":null}