ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2101.12588
  4. Cited By
No-Regret Caching via Online Mirror Descent

No-Regret Caching via Online Mirror Descent

29 January 2021
T. Si Salem
Giovanni Neglia
Stratis Ioannidis
ArXivPDFHTML

Papers citing "No-Regret Caching via Online Mirror Descent"

6 / 6 papers shown
Title
On the Regret of Coded Caching with Adversarial Requests
On the Regret of Coded Caching with Adversarial Requests
Anupam Nayak
Kota Srinivas Reddy
Nikhil Karamchandani
18
0
0
19 Sep 2024
On the Regret of Online Edge Service Hosting
On the Regret of Online Edge Service Hosting
Rudrabhotla Sri Prakash
Nikhil Karamchandani
Sharayu Moharir
20
2
0
13 Mar 2023
Optimistic No-regret Algorithms for Discrete Caching
Optimistic No-regret Algorithms for Discrete Caching
N. Mhaisen
Abhishek Sinha
G. Paschos
Georgios Iosifidis
36
11
0
15 Aug 2022
Enabling Long-term Fairness in Dynamic Resource Allocation
Enabling Long-term Fairness in Dynamic Resource Allocation
T. Si Salem
Georgios Iosifidis
Giovanni Neglia
24
18
0
11 Aug 2022
Online Caching with no Regret: Optimistic Learning via Recommendations
Online Caching with no Regret: Optimistic Learning via Recommendations
N. Mhaisen
Georgios Iosifidis
D. Leith
21
10
0
20 Apr 2022
Online Caching with Optimistic Learning
Online Caching with Optimistic Learning
N. Mhaisen
Georgios Iosifidis
D. Leith
31
11
0
22 Feb 2022
1