Relative entropy bounds for sampling with and without replacement
From MaRDI portal
Cites work
- An elementary proof of de Finetti's theorem
- An information-theoretic proof of a finite de Finetti theorem
- Bounds on the information divergence for hypergeometric distributions
- Compound Poisson approximation via information functionals
- Distance between sampling with and without replacement
- Entropy and the central limit theorem
- Entropy and the discrete central limit theorem
- Entropy and the Law of Small Numbers
- Finite exchangeable sequences
- Finite forms of de Finetti's theorem on exchangeability
- scientific article; zbMATH DE number 3605770 (Why is no real title available?)
- Information in Probability: Another Information-Theoretic Proof of a Finite de Finetti Theorem
- Information-theoretic convergence of extreme values to the Gumbel distribution
- Introduction to nonparametric estimation
- Maximum entropy on compact groups
- On some inequalities for the gamma and psi functions
- On the Comparison of Sampling with and without Replacement
- Sampling
- Semidefinite programming hierarchies for constrained bilinear optimization
- Solution of Shannon’s problem on the monotonicity of entropy
- The method of types [information theory]
This page was built for publication: Relative entropy bounds for sampling with and without replacement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892529)
