{"total":16,"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":"2507.11847","title":"Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update","created":"2025-07-16","cited_by_count":16,"area":null},{"id":"2202.05630","title":"Scale-free Unconstrained Online Learning for Curved Losses","created":"2022-02-11","cited_by_count":13,"area":null},{"id":"2110.03960","title":"Mixability made efficient: Fast online multiclass logistic regression","created":"2021-10-08","cited_by_count":12,"area":null},{"id":"2110.03020","title":"Efficient Methods for Online Multiclass Logistic Regression","created":"2021-10-06","cited_by_count":10,"area":null},{"id":"2308.07588","title":"High-Probability Risk Bounds via Sequential Predictors","created":"2023-08-15","cited_by_count":10,"area":null},{"id":"2305.00070","title":"Online Platt Scaling with Calibeating","created":"2023-04-28","cited_by_count":8,"area":null},{"id":"2105.08866","title":"Localization, Convexity, and Star Aggregation","created":"2021-05-19","cited_by_count":7,"area":null},{"id":"2205.01921","title":"Second Order Path Variationals in Non-Stationary Online Learning","created":"2022-05-04","cited_by_count":7,"area":null},{"id":"2602.08372","title":"Dynamic Regret via Discounted-to-Dynamic Reduction with Applications to Curved Losses and Adam Optimizer","created":"2026-02-09","cited_by_count":4,"area":null},{"id":"2101.05234","title":"On Misspecification in Prediction Problems and Robustness via Improper Learning","created":"2021-01-13","cited_by_count":1,"area":null},{"id":"2101.12113","title":"Low Complexity Approximate Bayesian Logistic Regression for Sparse Online Learning","created":"2021-01-28","cited_by_count":1,"area":null},{"id":"2605.12340","title":"Online Learning-to-Defer with Varying Experts","created":"2026-05-12","cited_by_count":1,"area":null},{"id":"2604.02920","title":"Efficient Logistic Regression with Mixture of Sigmoids","created":"2026-04-03","cited_by_count":0,"area":null}],"next_cursor":null}