Michael Gastpar

Minimax bounds for watermarked and masked recursive discrete distribution estimation

This work provides a lower bound that shows that it is impossible to improve performance by adding watermarks unless the false negative rate of detection also vanishes, and shows that in most regimes, the worst-case losses of a sequence of simple deterministic estimators match the corresponding lower bounds up to constants.