Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave DensitiesDownload PDFOpen Website

Published: 2018, Last Modified: 18 May 2023COLT 2018Readers: Everyone
Abstract: We study the problem of learning multivariate log-concave densities with respect to a global loss function. We obtain the first upper bound on the sample complexity of the maximum likelihood estima...
0 Replies

Loading