{"total":20,"rows":[{"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":"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":"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":"2506.13163","title":"Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback","created":"2025-06-16","cited_by_count":2,"area":null},{"id":"2508.03072","title":"Achieving Limited Adaptivity for Multinomial Logistic Bandits","created":"2025-08-05","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.00984","title":"Practical and Optimal Algorithm for Linear Contextual Bandits with Rare Parameter Updates","created":"2026-05-31","cited_by_count":2,"area":null},{"id":"2602.00417","title":"Shuffle and Joint Differential Privacy for Generalized Linear Contextual Bandits","created":"2026-01-31","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":"2603.13742","title":"Few Batches or Little Memory, But Not Both: Simultaneous Space and Adaptivity Constraints in Stochastic Bandits","created":"2026-03-14","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":"2608.15848","title":"Generalized Linear Bandits with Memory","created":"2026-08-16","cited_by_count":1,"area":null},{"id":"2509.04194","title":"Stochastic Matching Bandits with Rare Optimization Updates","created":"2025-09-04","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":"2605.25590","title":"Nonstationary Generalized Linear Bandits with Discounted Online Mirror Descent","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2606.31449","title":"Contextual Slate GLM Bandits with Limited Adaptivity","created":"2026-06-30","cited_by_count":0,"area":null},{"id":"2607.07304","title":"Nonlinear Bandit","created":"2026-07-08","cited_by_count":0,"area":null},{"id":"2608.07922","title":"Memory--Batch Tradeoffs in Lipschitz Bandits","created":"2026-08-08","cited_by_count":0,"area":null}],"next_cursor":null}