Minimax Estimation of the $L_1$ Distance

By Jiantao Jiao, Yanjun Han, Tsachy Weissman. 2017

57 citations recorded by the source corpus.

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\ln n$ 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 $\|P-Q\|_{1}$ requires new techniques and insights beyond the approximation-based method of functional estimation by Jiao et al.

Subfields: Artificial Intelligence, Computer Networks and Communications, Statistics and Probability

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Sivaraman Balakrishnan
  2. Larry A. Wasserman
  3. Sewoong Oh
  4. Xiyang Liu
  5. Pramod Viswanath
  6. Jayadev Acharya
  7. Michael I. Jordan
  8. Peter Kairouz

In Computer Networks and Communications

  1. Larry A. Wasserman
  2. Xiyang Liu
  3. Sivaraman Balakrishnan
  4. Sewoong Oh

In Statistics and Probability

  1. Sivaraman Balakrishnan
  2. Larry A. Wasserman
  3. Sewoong Oh
  4. Xiyang Liu
  5. Martin J. Wainwright
  6. E.J. Candes
  7. Mathias Drton
  8. Tommaso Cai

Citations in the corpus