Strict separation of Minimax and Maximin lower bounds for vector Gaussian rate-distortion with trace distortion
Statement
The vector Gaussian rate-distortion problem with variable side information under trace distortion, denoted , is considered together with its Minimax and Maximin lower bounds. Strict-separation conjecture. There exists an instance of the such that the Minimax lower bound is strictly greater than the Maximin lower bound, and hence greater than the Enhanced-Enhancement lower bound and the . The claim would show that the Minimax lower bound is genuinely stronger than the other listed lower bounds for at least one instance of the trace-distortion problem; the source does not state whether such an instance has been established.
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.