{"total":31,"rows":[{"id":"2102.01046","title":"Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications","created":"2021-02-01","cited_by_count":52,"area":null},{"id":"2210.14355","title":"Parameter-free Regret in High Probability with Heavy Tails","created":"2022-10-25","cited_by_count":28,"area":null},{"id":"2403.07213","title":"Which LLM to Play? Convergence-Aware Online Model Selection with Time-Increasing Bandits","created":"2024-03-11","cited_by_count":27,"area":null},{"id":"2308.05621","title":"Normalized Gradients for All","created":"2023-08-10","cited_by_count":20,"area":null},{"id":"2102.06593","title":"Pareto Optimal Model Selection in Linear Bandits","created":"2021-02-12","cited_by_count":14,"area":null},{"id":"2301.13349","title":"Unconstrained Dynamic Regret via Sparse Coding","created":"2023-01-31","cited_by_count":11,"area":null},{"id":"2205.11470","title":"Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning","created":"2022-05-23","cited_by_count":10,"area":null},{"id":"2410.21547","title":"Personalized Federated Learning with Mixture of Models for Adaptive Prediction and Model Fine-Tuning","created":"2024-10-28","cited_by_count":8,"area":null},{"id":"2504.13938","title":"Never Start from Scratch: Expediting On-Device LLM Personalization via Explainable Model Selection","created":"2025-04-15","cited_by_count":8,"area":null},{"id":"2307.12897","title":"Anytime Model Selection in Linear Bandits","created":"2023-07-24","cited_by_count":6,"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":"2404.09494","title":"On the Necessity of Collaboration for Online Model Selection with Decentralized Data","created":"2024-04-15","cited_by_count":6,"area":null},{"id":"2405.19705","title":"Universal Online Convex Optimization with $1$ Projection per Round","created":"2024-05-30","cited_by_count":6,"area":null},{"id":"2102.07521","title":"Distributed Online Learning for Joint Regret with Communication Constraints","created":"2021-02-15","cited_by_count":5,"area":null},{"id":"2105.03681","title":"Universal Online Convex Optimization Meets Second-order Bounds","created":"2021-05-08","cited_by_count":4,"area":null},{"id":"2106.04815","title":"ChaCha for Online AutoML","created":"2021-06-09","cited_by_count":3,"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":"2505.17277","title":"Comparator-Adaptive $\\Phi$-Regret: Improved Bounds, Simpler Algorithms, and Applications to Games","created":"2025-05-22","cited_by_count":2,"area":null},{"id":"2605.28057","title":"On the Learnability of Test-Time Adaptation: A Recovery Complexity Perspective","created":"2026-05-27","cited_by_count":2,"area":null},{"id":"2303.05018","title":"Improved Regret Bounds for Online Kernel Selection under Bandit Feedback","created":"2023-03-09","cited_by_count":1,"area":null},{"id":"2401.10478","title":"Budgeted Online Model Selection and Fine-Tuning via Federated Learning","created":"2024-01-19","cited_by_count":1,"area":null},{"id":"2411.06069","title":"Model Selection for Average Reward RL with Application to Utility Maximization in Repeated Games","created":"2024-11-09","cited_by_count":1,"area":null},{"id":"2505.16221","title":"LightRouter: Towards Efficient LLM Collaboration with Minimal Overhead","created":"2025-05-22","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":"2510.22654","title":"Managing Self-Learning Experts under Per-Round Budget Constraints","created":"2025-10-26","cited_by_count":1,"area":null},{"id":"2102.05164","title":"Nonstochastic Bandits with Infinitely Many Experts","created":"2021-02-09","cited_by_count":0,"area":null},{"id":"2311.13877","title":"Locally Optimal Descent for Dynamic Stepsize Scheduling","created":"2023-11-23","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":"2510.22744","title":"OEUVRE: OnlinE Unbiased Variance-Reduced loss Estimation","created":"2025-10-26","cited_by_count":0,"area":null},{"id":"2603.28198","title":"Policy-Controlled Generalized Share: A General Framework with a Transformer Instantiation for Strictly Online Switching-Oracle Tracking","created":"2026-03-30","cited_by_count":0,"area":null},{"id":"2605.08558","title":"Beyond Static Bias: Adaptive Multi-Fidelity Bandits with Improving Proxies","created":"2026-05-08","cited_by_count":0,"area":null}],"next_cursor":null}