ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp and qq be the crossover probabilities of the teacher's and student's binary symmetric channels, respectively, with

0<p,q<1/2.0<p,q<1/2.

Let D(a∥b)D(a\|b) denote the binary relative entropy, and let the optimal learning rate be the supremum over all causal joint teaching and learning strategies.

Causal penalty conjecture. The optimal learning rate of the student is strictly less than

min⁡(D(1/2∥p),D(1/2∥q)).\min\bigl(D(1/2\|p),D(1/2\|q)\bigr).

The conjecture asserts that causal teaching and learning impose a strict penalty in the binary setting, despite the data-processing upper bound. The source notes that this penalty need not occur in the Gaussian setting and that the corresponding non-causal upper bound may be achieved; determining optimal causal joint strategies 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.