{"total":14,"rows":[{"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":"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":"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.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":"2608.15848","title":"Generalized Linear Bandits with Memory","created":"2026-08-16","cited_by_count":1,"area":null},{"id":"2603.07005","title":"Combinatorial Allocation Bandits with Nonlinear Arm Utility","created":"2026-03-07","cited_by_count":0,"area":null},{"id":"2603.15596","title":"Robust and Computationally Efficient Linear Contextual Bandits under Adversarial Corruption and Heavy-Tailed Noise","created":"2026-03-16","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.00431","title":"Variance-sensitive Thompson sampling for generalised linear bandits, revisited","created":"2026-05-29","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},{"id":"2609.35622","title":"Elicitation and Decision Geometry in Single-Index Bandits","created":"2026-09-28","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}