{"total":41,"rows":[{"id":"2107.02237","title":"Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discrimination","created":"2021-07-05","cited_by_count":53,"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":"2405.09831","title":"Nearly Minimax Optimal Regret for Multinomial Logistic Bandit","created":"2024-05-16","cited_by_count":20,"area":null},{"id":"2111.08911","title":"Fast Rates for Nonparametric Online Learning: From Realizability to Learning in Games","created":"2021-11-17","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":"2502.10020","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","created":"2025-02-14","cited_by_count":15,"area":null},{"id":"2106.03596","title":"Beyond Bandit Feedback in Online Multiclass Classification","created":"2021-06-07","cited_by_count":14,"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":"2307.04191","title":"On the sample complexity of parameter estimation in logistic regression with normal design","created":"2023-07-09","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":"2209.04417","title":"Expected Worst Case Regret via Stochastic Sequential Covering","created":"2022-09-09","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":"2211.01357","title":"Quasi-Newton Steps for Efficient Online Exp-Concave Optimization","created":"2022-11-02","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":"2504.16555","title":"Confidence Sequences for Generalized Linear Models via Regret Analysis","created":"2025-04-23","cited_by_count":10,"area":null},{"id":"2202.11461","title":"Exponential Tail Local Rademacher Complexity Risk Bounds Without the Bernstein Condition","created":"2022-02-23","cited_by_count":9,"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":"2303.04845","title":"Smoothed Analysis of Sequential Probability Assignment","created":"2023-03-08","cited_by_count":7,"area":null},{"id":"2402.08180","title":"Online Structured Prediction with Fenchel--Young Losses and Improved Surrogate Regret for Online Multiclass Classification with Logistic Loss","created":"2024-02-13","cited_by_count":7,"area":null},{"id":"2506.10616","title":"Non-stationary Online Learning for Curved Losses: Improved Dynamic Regret via Mixability","created":"2025-06-12","cited_by_count":7,"area":null},{"id":"2205.03728","title":"Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm","created":"2022-05-07","cited_by_count":5,"area":null},{"id":"2209.03447","title":"Blessing of Class Diversity in Pre-training","created":"2022-09-07","cited_by_count":4,"area":null},{"id":"2402.08126","title":"Contextual Multinomial Logit Bandits with General Value Functions","created":"2024-02-12","cited_by_count":4,"area":null},{"id":"2410.23461","title":"Transformation-Invariant Learning and Theoretical Guarantees for OOD Generalization","created":"2024-10-30","cited_by_count":4,"area":null},{"id":"2505.08982","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","created":"2025-05-13","cited_by_count":4,"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":"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":"2302.10726","title":"Exploring Local Norms in Exp-concave Statistical Learning","created":"2023-02-21","cited_by_count":2,"area":null},{"id":"2602.13700","title":"Optimal Regret for Policy Optimization in Contextual Bandits","created":"2026-02-14","cited_by_count":2,"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":"2105.14673","title":"A Minimax Lower Bound for Low-Rank Matrix-Variate Logistic Regression","created":"2021-05-31","cited_by_count":1,"area":null},{"id":"2308.02922","title":"Structured Low-Rank Tensors for Generalized Linear Models","created":"2023-08-05","cited_by_count":1,"area":null},{"id":"2410.03849","title":"Sequential Probability Assignment with Contexts: Minimax Regret, Contextual Shtarkov Sums, and Contextual Normalized Maximum Likelihood","created":"2024-10-04","cited_by_count":1,"area":null},{"id":"2502.18709","title":"Bandit and Delayed Feedback in Online Structured Prediction","created":"2025-02-26","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},{"id":"2608.26515","title":"Sharp Minimax Regret for Infinite-Memory Logistic Prediction","created":"2026-08-27","cited_by_count":0,"area":null},{"id":"2610.12919","title":"Beyond Second-Order Information: Paid Logistic Regression with Noisy Features","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}