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. 2009.08228
  4. Cited By
LeadCache: Regret-Optimal Caching in Networks

LeadCache: Regret-Optimal Caching in Networks

17 September 2020
Debjit Paria
Abhishek Sinha
ArXivPDFHTML

Papers citing "LeadCache: Regret-Optimal Caching in Networks"

14 / 14 papers shown
Title
Hybrid Real- and Complex-valued Neural Network Architecture
Hybrid Real- and Complex-valued Neural Network Architecture
Alex Young
L. V. Fiorio
Bo Yang
B. Karanov
Wim J. van Houtum
Ronald M. Aarts
31
0
0
04 Apr 2025
Efficient and Optimal No-Regret Caching under Partial Observation
Younes Ben Mazziane
Francescomaria Faticanti
Sara Alouf
Giovanni Neglia
41
0
0
04 Mar 2025
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
16
0
0
19 Sep 2024
An Online Gradient-Based Caching Policy with Logarithmic Complexity and
  Regret Guarantees
An Online Gradient-Based Caching Policy with Logarithmic Complexity and Regret Guarantees
D. Carra
Giovanni Neglia
21
1
0
02 May 2024
$α$-Fair Contextual Bandits
ααα-Fair Contextual Bandits
Siddhant Chaudhary
Abhishek Sinha
FaML
34
0
0
22 Oct 2023
On the Regret of Online Edge Service Hosting
On the Regret of Online Edge Service Hosting
Rudrabhotla Sri Prakash
Nikhil Karamchandani
Sharayu Moharir
15
2
0
13 Mar 2023
No-regret Algorithms for Fair Resource Allocation
No-regret Algorithms for Fair Resource Allocation
Abhishek Sinha
Ativ Joshi
Rajarshi Bhattacharjee
Cameron Musco
Mohammad Hajiesmaili
FaML
43
5
0
11 Mar 2023
Tight Bounds for $γ$-Regret via the Decision-Estimation Coefficient
Tight Bounds for γγγ-Regret via the Decision-Estimation Coefficient
Margalit Glasgow
Alexander Rakhlin
OffRL
19
0
0
06 Mar 2023
Online Subset Selection using $α$-Core with no Augmented Regret
Online Subset Selection using ααα-Core with no Augmented Regret
Sourav Sahoo
Siddhant Chaudhary
S. Mukhopadhyay
Abhishek Sinha
OffRL
45
0
0
28 Sep 2022
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
19
18
0
11 Aug 2022
Universal Caching
Universal Caching
Ativ Joshi
Abhishek Sinha
OffRL
32
2
0
10 May 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
18
10
0
20 Apr 2022
No-Regret Caching via Online Mirror Descent
No-Regret Caching via Online Mirror Descent
T. Si Salem
Giovanni Neglia
Stratis Ioannidis
14
34
0
29 Jan 2021
1