The complexity of approximating the entropy

We consider the problem of approximating the entropy of a discrete distribution under several different models of oracle access to the distribution. In the evaluation oracle model, the algorithm is given access to the explicit array of probabilities specifying the distribution. In this model, linear time in the size of the domain is both necessary and sufficient for approximating the entropy. In the generation oracle model, the algorithm has access only to independent samples from the distribution. In this case, we show that a γ-multiplicative approximation to the entropy can be obtained in O(n ^1+n)/γ2) log n) time for distributions with entropy Ω(γ/1≠), where n is the size of the domain of the distribution and n is an arbitrarily small positive constant. We show that this model does not permit a multiplicative approximation to the entropy in general. For the class of distributions to which our upper bound applies, we obtain a lower bound of Ω(n ¹/2γ ²)). We next consider a combined oracle model in which the algorithm has access to both the generation and the evaluation oracles of the distribution. In this model, significantly greater efficiency can be achieved: we present an algorithm for γ-multiplicative approximation to the entropy that runs in O((γ ² log ² n)/(h ²(γ - 1) ²)) time for distributions with entropy Ω(h); for such distributions, we also show a lower bound of Ω((log n)/(h(γ ² - 1) + γ ²)). Finally, we consider two special families of distributions: those in which the probabilities of the elements decrease monotonically with respect to a known ordering of the domain, and those that are uniform over a subset of the domain. In each case, we give more efficient algorithms for approximating the entropy.