On the public citation graph

No-regret Caching via Online Mirror Descent

https://doi.org/10.1145/3605209
0 signed · 66 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.1006/inco.1994.1009openalex-snapshot
The Weighted Majority Algorithm
inferredcites →https://doi.org/10.1016/0166-218x(92)90177-copenalex-snapshot
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
inferredcites →https://doi.org/10.1016/j.comnet.2014.03.006openalex-snapshot
Performance evaluation of hierarchical TTL-based cache networks
inferredcites →https://doi.org/10.1016/j.comnet.2017.11.009openalex-snapshot
Joint cache resource allocation and request routing for in-network caching services
inferredcites →https://doi.org/10.1016/j.cosrev.2009.04.002openalex-snapshot
The -server problem
inferredcites →https://doi.org/10.1016/j.peva.2016.01.001openalex-snapshot
Performance models for hierarchy of caches: Application to modern DNS caches
inferredcites →https://doi.org/10.1016/j.peva.2017.09.002openalex-snapshot
TTL approximations of the cache replacement algorithms LRU(m) and h-LRU
inferredcites →https://doi.org/10.1016/s0022-0000(77)80014-7openalex-snapshot
Asymptotic miss ratios over independent references
inferredcites →https://doi.org/10.1016/s0167-6377(02)00231-6openalex-snapshot
Mirror descent and nonlinear projected subgradient methods for convex optimization
inferredcites →https://doi.org/10.1016/s0898-1221(96)90463-0openalex-snapshot
Advances in neural information processing systems 7
inferredcites →https://doi.org/10.1109/icc.2015.7248843openalex-snapshot
Optimal geographic caching in cellular networks
inferredcites →https://doi.org/10.1109/icc42927.2021.9500487openalex-snapshot
No-Regret Caching via Online Mirror Descent
inferredcites →https://doi.org/10.1109/infcom.2010.5461964openalex-snapshot
Distributed Caching Algorithms for Content Distribution Networks
inferredcites →https://doi.org/10.1109/infocom.2019.8737446openalex-snapshot
Learning to Cache With No Regrets
inferredcites →https://doi.org/10.1109/iscc.2002.1021680openalex-snapshot
Exploitation of different types of locality for Web caches
inferredcites →https://doi.org/10.1109/isit45174.2021.9517925openalex-snapshot
Online Caching with Optimal Switching Regret
inferredcites →https://doi.org/10.1109/jsac.2002.801752openalex-snapshot
Hierarchical Web caching systems: modeling, design and experimental results
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/tit.2013.2281606openalex-snapshot
FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers
inferredcites →https://doi.org/10.1109/tnet.2017.2783623openalex-snapshot
Cache Policies for Linear Utility Maximization
inferredcites →https://doi.org/10.1109/tnet.2019.2913677openalex-snapshot
A Utility Optimization Approach to Network Cache Design
inferredcites →https://doi.org/10.1109/twc.2016.2514418openalex-snapshot
Exploiting Caching and Multicast for 5G Wireless Networks
inferredcites →https://doi.org/10.1137/1.9781611972863.16openalex-snapshot
Optimal Incremental Sorting
inferredcites →https://doi.org/10.1137/s0363012995281742openalex-snapshot
Proximal Minimization Methods with Generalized Bregman Functions
inferredcites →https://doi.org/10.1145/146585.146588openalex-snapshot
An optimal on-line algorithm for metrical task system
inferredcites →https://doi.org/10.1145/1811039.1811075openalex-snapshot
Distributed caching over heterogeneous mobile networks
inferredcites →https://doi.org/10.1145/2339123.2339126openalex-snapshot
A Primal-Dual Randomized Algorithm for Weighted Paging
inferredcites →https://doi.org/10.1145/2494232.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/2637364.2592038openalex-snapshot
Exact analysis of TTL cache networks
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/2896380openalex-snapshot
A Unified Approach to the Performance Analysis of Caching Systems
inferredcites →https://doi.org/10.1145/2964791.2901467openalex-snapshot
Adaptive Caching Networks with Optimality Guarantees
inferredcites →https://doi.org/10.1145/307400.307405openalex-snapshot
The robustness of the p -norm algorithms
inferredcites →https://doi.org/10.1145/3149001openalex-snapshot
Access-Time-Aware Cache Algorithms
inferredcites →https://doi.org/10.1145/3188745.3188798openalex-snapshot
k-server via multiscale entropic regularization
inferredcites →https://doi.org/10.1145/3239164openalex-snapshot
On the Convergence of the TTL Approximation for an LRU Cache under Independent Stationary Request Processes
inferredcites →https://doi.org/10.1145/3392143openalex-snapshot
Fundamental Limits on the Regret of Online Network-Caching
inferredcites →https://doi.org/10.1145/3453953.3453985openalex-snapshot
A New Upper Bound on Cache Hit Probability for Non-anticipative Caching Policies
inferredcites →https://doi.org/10.1145/3491047openalex-snapshot
Online Caching Networks with Adversarial Guarantees
inferredcites →https://doi.org/10.1145/62212.62243openalex-snapshot
Competitive algorithms for on-line problems
inferredcites →https://doi.org/10.1214/aoap/1029962750openalex-snapshot
Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
inferredcites →https://doi.org/10.1214/aoms/1177729586openalex-snapshot
A Stochastic Approximation Method
inferredcites →https://doi.org/10.1214/aoms/1177731312openalex-snapshot
On the Theory of Systematic Sampling, I
inferredcites →https://doi.org/10.1561/0100000104openalex-snapshot
Cache Optimization Models and Algorithms
inferredcites →https://doi.org/10.1561/2200000018openalex-snapshot
Online Learning and Online Convex Optimization
inferredcites →https://doi.org/10.1561/2200000050openalex-snapshot
Convex Optimization: Algorithms and Complexity
inferredcites →https://doi.org/10.1561/2200000073openalex-snapshot
Computational Optimal Transport with Applications to Data Sciences
inferredcites →https://doi.org/10.1561/2400000013openalex-snapshot
Introduction to Online Convex Optimization
inferredcites →https://doi.org/10.3390/e15114607openalex-snapshot
On the Diversity Constraints for Portfolio Optimization
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.1007/978-3-031-93193-2_7openalex-snapshot
HCTRL: Hierarchical Clustering Tree Reinforcement Learning Algorithm for Efficient Content Caching
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.2025.102488openalex-snapshot
Optimizing latency for caching with delayed hits in non-stationary environment
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/icassp48485.2024.10446753openalex-snapshot
Online Caching With Switching Cost and Operational Long-Term Constraints: An Online Learning Approach
inferred← citeshttps://doi.org/10.1109/iscc61673.2024.10733714openalex-snapshot
SwiftOGA: An Efficient and Swift Online Gradient Ascent Algorithm for Caching Replacement
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/lnet.2024.3516321openalex-snapshot
SAcache: A Strongly Adaptive Online Caching Scheme for Non-Stationary Environments
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.2023.3305922openalex-snapshot
Toward Inference Delivery Networks: Distributing Machine Learning With Optimality Guarantees
inferred← citeshttps://doi.org/10.1109/tpami.2026.3703554openalex-snapshot
Stochastic Approximation Approaches to Group Distributionally Robust Optimization and Beyond
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.17760/d20581912openalex-snapshot
Submodularity in cache networks
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.