On the public citation graph

Optimistic No-regret Algorithms for Discrete Caching

https://doi.org/10.1145/3570608
0 signed · 59 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/0471722154openalex-snapshot
The Probabilistic Method
inferredcites →https://doi.org/10.1007/978-0-230-37405-8_1openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1007/978-3-662-05269-3_4openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1007/bf00934819openalex-snapshot
Stochastic optimization problems with nondifferentiable cost functionals
inferredcites →https://doi.org/10.1016/j.comnet.2008.09.022openalex-snapshot
Characteristics of YouTube network traffic at a campus network – Measurements, models, and implications
inferredcites →https://doi.org/10.1016/j.cor.2005.09.013openalex-snapshot
Designing cost-effective content distribution networks
inferredcites →https://doi.org/10.1016/j.jcss.2004.10.016openalex-snapshot
Efficient algorithms for online decision problems
inferredcites →https://doi.org/10.1109/access.2017.2698164openalex-snapshot
Mobile Augmented Reality Survey: From Where We Are to Where We Go
inferredcites →https://doi.org/10.1109/icc.2013.6654887openalex-snapshot
Volatility of YouTube content in Orange networks and consequences
inferredcites →https://doi.org/10.1109/icc42927.2021.9500487openalex-snapshot
No-Regret Caching via Online Mirror Descent
inferredcites →https://doi.org/10.1109/infocom.2016.7524380openalex-snapshot
Placing dynamic content in caches with small population
inferredcites →https://doi.org/10.1109/itc.2014.6932936openalex-snapshot
Catalog dynamics: Impact of content publishing and perishing on the performance of a LRU cache
inferredcites →https://doi.org/10.1109/jsac.2018.2844939openalex-snapshot
The Role of Caching in Future Communication Systems and Networks
inferredcites →https://doi.org/10.1109/jsac.2018.2844982openalex-snapshot
Implicit Coordination of Caches in Small Cell Networks Under Unknown Popularity Profiles
inferredcites →https://doi.org/10.1109/jsac.2018.2844985openalex-snapshot
A Reinforcement-Learning Approach to Proactive Caching in Wireless Networks
inferredcites →https://doi.org/10.1109/jsac.2019.2933780openalex-snapshot
Reinforcement Learning for Adaptive Caching With Dynamic Storage Pricing
inferredcites →https://doi.org/10.1109/jstsp.2017.2787979openalex-snapshot
Optimal and Scalable Caching for 5G Using Reinforcement Learning of Space-Time Popularities
inferredcites →https://doi.org/10.1109/tcomm.2014.2351796openalex-snapshot
Approximation Algorithms for Mobile Data Caching in Small Cell Networks
inferredcites →https://doi.org/10.1109/tit.2013.2281606openalex-snapshot
FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers
inferredcites →https://doi.org/10.1109/tit.2014.2306938openalex-snapshot
Fundamental Limits of Caching
inferredcites →https://doi.org/10.1109/tmc.2018.2831690openalex-snapshot
Jointly Optimizing Content Caching and Recommendations in Small Cell Networks
inferredcites →https://doi.org/10.1109/tmc.2021.3109727openalex-snapshot
Network Friendly Recommendations: Optimizing for Long Viewing Sessions
inferredcites →https://doi.org/10.1109/tmc.2022.3142809openalex-snapshot
Revenue Maximization: The Interplay Between Personalized Bundle Recommendation and Wireless Content Caching
inferredcites →https://doi.org/10.1109/tnet.2018.2869583openalex-snapshot
Timely-Throughput Optimal Scheduling With Prediction
inferredcites →https://doi.org/10.1109/tnet.2020.2968424openalex-snapshot
Online Convex Optimization for Caching Networks
inferredcites →https://doi.org/10.1109/tnet.2021.3072423openalex-snapshot
Online VNF Chaining and Predictive Scheduling: Optimality and Trade-Offs
inferredcites →https://doi.org/10.1137/1.9781611975994.112openalex-snapshot
Near-Optimal Bounds for Online Caching with Machine Learned Advice
inferredcites →https://doi.org/10.1145/1390156.1390202openalex-snapshot
No-regret learning in convex games
inferredcites →https://doi.org/10.1145/1453175.1453203openalex-snapshot
Characterizing the miss sequence of the LRU cache
inferredcites →https://doi.org/10.1145/2365952.2365958openalex-snapshot
Building industrial-scale real-world recommender systems
inferredcites →https://doi.org/10.1145/2465529.2465533openalex-snapshot
A tale of two metrics
inferredcites →https://doi.org/10.1145/2541468.2541470openalex-snapshot
Temporal locality in today's content caching
inferredcites →https://doi.org/10.1145/2830555openalex-snapshot
A Survey on Cache Management Mechanisms for Real-Time Embedded Systems
inferredcites →https://doi.org/10.1145/2843948openalex-snapshot
The Netflix Recommender System
inferredcites →https://doi.org/10.1145/2896377.2901483openalex-snapshot
Spatial Multi-LRU Caching for Wireless Networks with Coverage Overlaps
inferredcites →https://doi.org/10.1145/2981561openalex-snapshot
An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
inferredcites →https://doi.org/10.1145/301464.301487openalex-snapshot
On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies
inferredcites →https://doi.org/10.1145/3393691.3394189openalex-snapshot
Fundamental Limits on the Regret of Online Network-Caching
inferredcites →https://doi.org/10.1145/3491047openalex-snapshot
Online Caching Networks with Adversarial Guarantees
inferredcites →https://doi.org/10.1214/aoms/1177729988openalex-snapshot
On the Theory of Systematic Sampling, II
inferredcites →https://doi.org/10.1287/opre.5.2.266openalex-snapshot
Discrete-Variable Extremum Problems
inferredcites →https://doi.org/10.1561/0100000104openalex-snapshot
Cache Optimization Models and Algorithms
inferredcites →https://doi.org/10.23919/ifipnetworking55013.2022.9829806openalex-snapshot
Online Caching with Optimistic Learning
inferredcites →https://doi.org/10.48550/arxiv.1301.0534openalex-snapshot
Follow the Leader If You Can, Hedge If You Must
inferredcites →https://doi.org/10.5555/1046920.1088694openalex-snapshot
Adaptive Online Prediction by Following the Perturbed Leader
inferredcites →https://doi.org/10.5555/3122009.3176834openalex-snapshot
A survey of Algorithms and Analysis for Adaptive Online Learning

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.comnet.2024.110341openalex-snapshot
Optimistic online caching for batched requests
inferred← citeshttps://doi.org/10.1016/j.comnet.2025.111743openalex-snapshot
Low-Complexity online learning for caching
inferred← citeshttps://doi.org/10.1016/j.peva.2026.102586openalex-snapshot
Quantized Online Gradient Descent for constant-time caching with dynamic regret guarantees
inferred← citeshttps://doi.org/10.1109/cdc56724.2024.10886668openalex-snapshot
Optimistic Online Non-stochastic Control via FTRL
inferred← citeshttps://doi.org/10.1109/jiot.2025.3610695openalex-snapshot
Cooperative Edge Inferences With Online Learning
inferred← citeshttps://doi.org/10.1109/jiot.2026.3689587openalex-snapshot
Online Caching With Delayed Hits: Sublinear Regrets Under Fixed and Time-Varying Delays
inferred← citeshttps://doi.org/10.1109/main71116.2026.11622383openalex-snapshot
Optimistic Online Caching with Switching Costs and Dynamic Batched Requests
inferred← citeshttps://doi.org/10.1109/tnet.2024.3478853openalex-snapshot
Meta-Learning for Fast Adaption in Caching Networks
inferred← citeshttps://doi.org/10.1109/tsc.2024.3451163openalex-snapshot
Optimal Caching for Partial-Observation Regime and Beyond
inferred← citeshttps://doi.org/10.1109/vcc60689.2023.10474978openalex-snapshot
No- Regret Caching with Noisy Request Estimates
inferred← citeshttps://doi.org/10.1145/3578338.3593561openalex-snapshot
Optimistic No-regret Algorithms for Discrete Caching
inferred← citeshttps://doi.org/10.1145/3606376.3593561openalex-snapshot
Optimistic No-regret Algorithms for Discrete Caching
inferred← citeshttps://doi.org/10.1145/3639043openalex-snapshot
Fair Resource Allocation in Virtualized O-RAN Platforms
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.