The Optimal Approximation Factor in Density Estimation

Consider the following problem: given two arbitrary densities q₁, q₂ and a sample-access to an unknown target density p, find which of the q_i’s is closer to p in total variation. A remarkable result due to Yatracos shows that this problem is tractable in the following sense: there exists an algorithm that uses O(ε^-2) samples from p and outputs q_i such that with high probability, TV (q_i, p) ≤ 3 · opt + ε, where opt = min{TV (q₁, p), TV (q₂, p)}. Moreover, this result extends to any finite class of densities Q: there exists an algorithm that outputs the best density in Q up to a multiplicative approximation factor of 3. We complement and extend this result by showing that: (i) the factor 3 can not be improved if one restricts the algorithm to output a density from Q, and (ii) if one allows the algorithm to output arbitrary densities (e.g. a mixture of densities from Q), then the approximation factor can be reduced to 2, which is optimal. In particular this demonstrates an advantage of improper learning over proper in this setup. We develop two approaches to achieve the optimal approximation factor of 2: an adaptive one and a static one. Both approaches are based on a geometric point of view of the problem and rely on estimating surrogate metrics to the total variation. Our sample complexity bounds exploit techniques from Adaptive Data Analysis.