{"total":23,"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":"2203.00444","title":"Parameter-free Mirror Descent","created":"2022-02-26","cited_by_count":45,"area":null},{"id":"2112.03432","title":"First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach","created":"2021-12-07","cited_by_count":38,"area":null},{"id":"2306.04923","title":"Unconstrained Online Learning with Unbounded Losses","created":"2023-06-08","cited_by_count":25,"area":null},{"id":"2202.06151","title":"Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits","created":"2022-02-12","cited_by_count":22,"area":null},{"id":"2206.00024","title":"Online PAC-Bayes Learning","created":"2022-05-31","cited_by_count":22,"area":null},{"id":"2204.09837","title":"Memory Bounds for the Experts Problem","created":"2022-04-21","cited_by_count":20,"area":null},{"id":"2207.07974","title":"Online Prediction in Sub-linear Space","created":"2022-07-16","cited_by_count":16,"area":null},{"id":"2305.19674","title":"Online-to-PAC Conversions: Generalization Bounds via Regret Analysis","created":"2023-05-31","cited_by_count":14,"area":null},{"id":"2306.13119","title":"Adversarial Resilience in Sequential Prediction via Abstention","created":"2023-06-22","cited_by_count":11,"area":null},{"id":"2205.06846","title":"Optimal Comparator Adaptive Online Learning with Switching Cost","created":"2022-05-13","cited_by_count":9,"area":null},{"id":"2206.00236","title":"Continuous Prediction with Experts' Advice","created":"2022-06-01","cited_by_count":7,"area":null},{"id":"2310.14085","title":"Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback","created":"2023-10-21","cited_by_count":6,"area":null},{"id":"2511.02276","title":"Gradient-Variation Online Adaptivity for Accelerated Optimization with H\\\"older Smoothness","created":"2025-11-04","cited_by_count":5,"area":null},{"id":"2502.04543","title":"Sparsity-Based Interpolation of External, Internal and Swap Regret","created":"2025-02-06","cited_by_count":3,"area":null},{"id":"2510.04685","title":"Parameter-free Algorithms for the Stochastically Extended Adversarial Model","created":"2025-10-06","cited_by_count":3,"area":null},{"id":"2510.17099","title":"On the Universal Near Optimality of Hedge in Combinatorial Settings","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2312.05432","title":"Fusing Multiple Algorithms for Heterogeneous Online Learning","created":"2023-12-09","cited_by_count":1,"area":null},{"id":"2509.08911","title":"Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications","created":"2025-09-10","cited_by_count":1,"area":null},{"id":"2604.11151","title":"Gradient-Variation Regret Bounds for Unconstrained Online Learning","created":"2026-04-13","cited_by_count":1,"area":null},{"id":"2202.02406","title":"Parameter-free Online Linear Optimization with Side Information via Universal Coin Betting","created":"2022-02-04","cited_by_count":0,"area":null},{"id":"2407.00916","title":"Learnability in Online Kernel Selection with Memory Constraint via Data-dependent Regret Analysis","created":"2024-07-01","cited_by_count":0,"area":null},{"id":"2608.01616","title":"Online Algorithms via Minimax and Posterior Matching","created":"2026-08-03","cited_by_count":0,"area":null}],"next_cursor":null}