ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p1,p2,…p_1,p_2,\dots be a sequence of arbitrary discrete distributions presented adaptively over time. An online random sampling algorithm generates exact samples from these distributions using a stream of i.i.d. random bits as its entropy source, and carries an auxiliary state between rounds. Space–entropy lower-bound conjecture. Any such algorithm that operates within ε>0\varepsilon>0 of the information-theoretically optimal entropy rate requires

Ω(log⁡(1/ε))\Omega(\log(1/\varepsilon))

bits of space for its auxiliary state. This conjecture asserts a general space–entropy tradeoff complementing constant-space samplers for rational distributions with bounded denominators; establishing the lower bound for arbitrary discrete distributions remains open.

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.