Pages that link to "Item:Q2976817"

The following pages link to Minimax Rates of Entropy Estimation on Large Alphabets via Best Polynomial Approximation (Q2976817):

Displaying 14 items.

• On estimation of \(L_r\)-norms in Gaussian white noise models (Q783806) (← links)
• Two-stage algorithm for estimation of nonlinear functions of state vector in linear Gaussian continuous dynamical systems (Q786092) (← links)
• Chebyshev polynomials, moment matching, and optimal estimation of the unseen (Q1731061) (← links)
• Sample complexity of the distinct elements problem (Q1737973) (← links)
• Optimal rates of entropy estimation over Lipschitz balls (Q1996767) (← links)
• Optimal disclosure risk assessment (Q2039783) (← links)
• Minimax estimation of norms of a probability density. I: Lower bounds (Q2137009) (← links)
• On estimation of nonsmooth functionals of sparse normal means (Q2174988) (← links)
• Optimal rates of estimation for multi-reference alignment (Q2176073) (← links)
• Mean-square estimation of nonlinear functionals via Kalman filtering (Q2333923) (← links)
• (Q4998937) (← links)
• Optimal Identity Testing with High Probability (Q5002714) (← links)
• Estimation of Simultaneous Signals Using Absolute Inner Product with Applications to Integrative Genomics (Q5066787) (← links)
• Optimal nonparametric testing of missing completely at random and its connections to compatibility (Q6183777) (← links)