Minimax Estimation of the L1 Distance
Minimax Estimation of the L1 Distance
复制标题
DOI:
10.1109/tit.2018.2846245
复制
发表时间:
2018-10-01
影响因子:
2.5
通讯作者:
Weissman, Tsachy
中科院分区:
文献类型:
--
作者:
Jiao, Jiantao;Han, Yanjun;Weissman, Tsachy
We consider the problem of estimating the L-1 distance between two discrete probability measures P and Q from empirical data in a nonasymptotic and large alphabet setting. When Q is known and one obtains n samples from P, we show that for every Q, the minimax rate-optimal estimator with n samples achieves performance comparable to that of the maximum likelihood estimator with n Inn samples. When both P and Q are unknown, we construct minimax rate-optimal estimators, whose worst case performance is essentially that of the known Q case with Q being uniform, implying that Q being uniform is essentially the most difficult case. The effective sample size enlargement phenomenon, identified by Jiao et aL, holds both in the known Q case for every Q and the Q unknown case. However, the construction of optimal estimators for parallel to P - Q parallel to(1) requires new techniques and insights beyond the approximation-based method of functional estimation by Jiao et al.