Optimal exponential bounds for aggregation of density estimators

From MaRDI portal
(Redirected from Publication:502865)



Abstract: We consider the problem of model selection type aggregation in the context of density estimation. We first show that empirical risk minimization is sub-optimal for this problem and it shares this property with the exponential weights aggregate, empirical risk minimization over the convex hull of the dictionary functions, and all selectors. Using a penalty inspired by recent works on the Q-aggregation procedure, we derive a sharp oracle inequality in deviation under a simple boundedness assumption and we show that the rate is optimal in a minimax sense. Unlike the procedures based on exponential weights, this estimator is fully adaptive under the uniform prior. In particular, its construction does not rely on the sup-norm of the unknown density. By providing lower bounds with exponential tails, we show that the deviation term appearing in the sharp oracle inequalities cannot be improved.


The paper studies the problem of estimating an unknown density function based on observations. It shows that two classical estimators, the exponential weights aggregate and the empirical risk minimization are suboptimal in deviation. It then defines a penalized procedure based on which a sharp oracle inequality in deviation is derived, which achieves an optimal rate in deviation. Finally, the paper provides a lower bound that shows that neither the achieved rate nor the deviation term can be further improved.











This page was built for publication: Optimal exponential bounds for aggregation of density estimators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q502865)