ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2009.08228
  4. Cited By
LeadCache: Regret-Optimal Caching in Networks
v1v2v3v4 (latest)

LeadCache: Regret-Optimal Caching in Networks

17 September 2020
Debjit Paria
Abhishek Sinha
ArXiv (abs)PDFHTML

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

14 / 14 papers shown
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
316
0
0
04 Apr 2025
Efficient and Optimal No-Regret Caching under Partial Observation
Efficient and Optimal No-Regret Caching under Partial Observation
Younes Ben Mazziane
Francescomaria Faticanti
Sara Alouf
Giovanni Neglia
279
0
0
04 Mar 2025
On the Regret of Coded Caching with Adversarial Requests
On the Regret of Coded Caching with Adversarial RequestsInformation Theory Workshop (ITW), 2024
Anupam Nayak
Kota Srinivas Reddy
Nikhil Karamchandani
200
1
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
385
2
0
02 May 2024
$α$-Fair Contextual Bandits
ααα-Fair Contextual Bandits
Siddhant Chaudhary
Abhishek Sinha
FaML
254
1
0
22 Oct 2023
On the Regret of Online Edge Service Hosting
On the Regret of Online Edge Service HostingInternational Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt), 2022
Rudrabhotla Sri Prakash
Nikhil Karamchandani
Sharayu Moharir
182
3
0
13 Mar 2023
No-regret Algorithms for Fair Resource Allocation
No-regret Algorithms for Fair Resource AllocationNeural Information Processing Systems (NeurIPS), 2023
Abhishek Sinha
Ativ Joshi
Rajarshi Bhattacharjee
Cameron Musco
Mohammad Hajiesmaili
FaML
248
12
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
257
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
378
0
0
28 Sep 2022
Optimistic No-regret Algorithms for Discrete Caching
Optimistic No-regret Algorithms for Discrete CachingProceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS), 2022
N. Mhaisen
Abhishek Sinha
G. Paschos
Georgios Iosifidis
329
17
0
15 Aug 2022
Enabling Long-term Fairness in Dynamic Resource Allocation
Enabling Long-term Fairness in Dynamic Resource AllocationProceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS), 2022
T. Si Salem
Georgios Iosifidis
Giovanni Neglia
279
32
0
11 Aug 2022
Universal Caching
Universal CachingInformation Theory Workshop (ITW), 2022
Ativ Joshi
Abhishek Sinha
OffRL
251
2
0
10 May 2022
Online Caching with no Regret: Optimistic Learning via Recommendations
Online Caching with no Regret: Optimistic Learning via RecommendationsIEEE Transactions on Mobile Computing (IEEE TMC), 2022
N. Mhaisen
Georgios Iosifidis
D. Leith
306
11
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
332
44
0
29 Jan 2021
1
Page 1 of 1