Minimax Rates of Entropy Estimation on Large Alphabets via Best Polynomial Approximation
From MaRDI portal
Publication:2976817
DOI10.1109/TIT.2016.2548468zbMath1359.94375arXiv1407.0381OpenAlexW2963608890MaRDI QIDQ2976817
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.0381
Related Items (16)
Minimax estimation of norms of a probability density. I: Lower bounds ⋮ Estimation of Simultaneous Signals Using Absolute Inner Product with Applications to Integrative Genomics ⋮ Optimal Identity Testing with High Probability ⋮ On estimation of nonsmooth functionals of sparse normal means ⋮ Optimal rates of estimation for multi-reference alignment ⋮ Optimal Estimation of Wasserstein Distance on a Tree With an Application to Microbiome Studies ⋮ Unnamed Item ⋮ Fisher-Pitman Permutation Tests Based on Nonparametric Poisson Mixtures with Application to Single Cell Genomics ⋮ Optimal nonparametric testing of missing completely at random and its connections to compatibility ⋮ Chebyshev polynomials, moment matching, and optimal estimation of the unseen ⋮ Sample complexity of the distinct elements problem ⋮ Optimal rates of entropy estimation over Lipschitz balls ⋮ Optimal disclosure risk assessment ⋮ On estimation of \(L_r\)-norms in Gaussian white noise models ⋮ Two-stage algorithm for estimation of nonlinear functions of state vector in linear Gaussian continuous dynamical systems ⋮ Mean-square estimation of nonlinear functionals via Kalman filtering
This page was built for publication: Minimax Rates of Entropy Estimation on Large Alphabets via Best Polynomial Approximation
