The strict causal penalty conjecture for optimal teaching and learning
Statement
Let and be the crossover probabilities of the teacher's and student's binary symmetric channels, respectively, with
Let 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
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.