2 problems
- 0 votes0 replies0 views
The impossibility of matching infinite-alphabet minimax redundancy with dynamic finite projections
Infinite-degree-of-freedom projection conjecture. The complexity of , measured by the rate at which the minimax redundancy per sample
- 0 votes0 replies0 views
Generalized redundancy inequality for Rényi divergence
Generalized redundancy inequality. If , then there exists a unique redundancy achieving distribution , and, for every distribution ,