LAWS acquisition lower bound for stationary online caching
Statement
Let range over stationary distributions with entropy , and let be the number of queries. LAWS acquisition lower bound. No online inference caching algorithm can achieve acquisition cost expert creations in the worst case over these distributions.
The proposed information-theoretic argument uses a distribution with equally probable heavy nodes and the coupon-collector lower bound for discovering them online. A formal treatment must handle adaptive query distributions; the source further claims this establishes acquisition optimality for LAWS.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.