Lower Bounds for Learning Distributions under Communication Constraints via Fisher Information
Barnes, Han & Özgür (later communication-constrained work)
- Use
carries the quantized-Fisher geometry into minimax lower bounds for interactive communication protocols.
- Not a partition solver
the results constrain attainable information but do not construct a deterministic hard quantizer.
Cited by
No claim cites this source yet.
Relevant to
Claims this source bears on without being cited in their proofs.