ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PMP_{\mathcal{M}} range over stationary distributions with entropy HH, and let NN be the number of queries. LAWS acquisition lower bound. No online inference caching algorithm can achieve acquisition cost o(2H(PM)⋅log⁡N)o(2^{H(P_{\mathcal{M}})}\cdot\log N) expert creations in the worst case over these distributions.

The proposed information-theoretic argument uses a distribution with 2H2^H 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.