{"total":25,"rows":[{"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":"2502.10020","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","created":"2025-02-14","cited_by_count":15,"area":null},{"id":"2504.16555","title":"Confidence Sequences for Generalized Linear Models via Regret Analysis","created":"2025-04-23","cited_by_count":10,"area":null},{"id":"2505.02069","title":"Neural Logistic Bandits","created":"2025-05-04","cited_by_count":6,"area":null},{"id":"2508.01681","title":"Generalized Kernelized Bandits: A Novel Self-Normalized Bernstein-Like Dimension-Free Inequality and Regret Bounds","created":"2025-08-03","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":"2601.09825","title":"Eluder dimension: localise it!","created":"2026-01-14","cited_by_count":3,"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":"2602.05812","title":"Principled Confidence Estimation for Deep Computed Tomography","created":"2026-02-05","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":"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":"2608.15848","title":"Generalized Linear Bandits with Memory","created":"2026-08-16","cited_by_count":1,"area":null},{"id":"2501.19401","title":"DAL: A Practical Prior-Free Black-Box Framework for Piecewise Stationary Bandits","created":"2025-01-31","cited_by_count":0,"area":null},{"id":"2502.13467","title":"On the Sublinear Regret of Continuous K-Max Bandits","created":"2025-02-19","cited_by_count":0,"area":null},{"id":"2510.01020","title":"The Good, the Bad, and the Sampled: a No-Regret Approach to Safe Online Classification","created":"2025-10-01","cited_by_count":0,"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":"2605.25590","title":"Nonstationary Generalized Linear Bandits with Discounted Online Mirror Descent","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2605.25592","title":"Optimal Design for Multinomial Logit Model with Applications to Best Assortment Identification","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2606.00431","title":"Variance-sensitive Thompson sampling for generalised linear bandits, revisited","created":"2026-05-29","cited_by_count":0,"area":null},{"id":"2609.39351","title":"On the Complexity of Preference-Based Bandits","created":"2026-09-30","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},{"id":"2610.06006","title":"Learning While Scheduling Jobs under Context-Dependent Service Rates: An Anytime Rate-Optimal Algorithm","created":"2026-10-05","cited_by_count":0,"area":null}],"next_cursor":null}