{"total":14,"rows":[{"id":"2101.12588","title":"No-Regret Caching via Online Mirror Descent","created":"2021-01-29","cited_by_count":12,"area":null},{"id":"2208.06414","title":"Optimistic No-regret Algorithms for Discrete Caching","created":"2022-08-15","cited_by_count":10,"area":null},{"id":"2303.06396","title":"No-regret Algorithms for Fair Resource Allocation","created":"2023-03-11","cited_by_count":9,"area":null},{"id":"2204.09345","title":"Online Caching with no Regret: Optimistic Learning via Recommendations","created":"2022-04-20","cited_by_count":4,"area":null},{"id":"2205.04860","title":"Universal Caching","created":"2022-05-10","cited_by_count":2,"area":null},{"id":"2501.11745","title":"Personalized Federated Learning for Cellular VR: Online Learning and Dynamic Caching","created":"2025-01-20","cited_by_count":2,"area":null},{"id":"2303.06851","title":"On the Regret of Online Edge Service Hosting","created":"2023-03-13","cited_by_count":1,"area":null},{"id":"2405.01263","title":"An Online Gradient-Based Caching Policy with Logarithmic Complexity and Regret Guarantees","created":"2024-05-02","cited_by_count":1,"area":null},{"id":"2503.02758","title":"Efficient and Optimal No-Regret Caching under Partial Observation","created":"2025-03-04","cited_by_count":1,"area":null},{"id":"2209.14222","title":"Online Subset Selection using $\\alpha$-Core with no Augmented Regret","created":"2022-09-28","cited_by_count":0,"area":null},{"id":"2303.03327","title":"Tight Bounds for $\\gamma$-Regret via the Decision-Estimation Coefficient","created":"2023-03-06","cited_by_count":0,"area":null},{"id":"2310.14164","title":"$\\alpha$-Fair Contextual Bandits","created":"2023-10-22","cited_by_count":0,"area":null},{"id":"2409.12387","title":"On the Regret of Coded Caching with Adversarial Requests","created":"2024-09-19","cited_by_count":0,"area":null},{"id":"2504.03499","title":"Optimistic Learning for Communication Networks","created":"2025-04-04","cited_by_count":0,"area":null}],"next_cursor":null}