Near-optimal sample complexity bounds for learning Latent k-polytopes and applications to Ad-Mixtures

Chiranjib Bhattacharyya, Ravindran Kannan. Near-optimal sample complexity bounds for learning Latent k-polytopes and applications to Ad-Mixtures. In Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, Virtual Event. Volume 119 of Proceedings of Machine Learning Research, pages 854-863, PMLR, 2020. [doi]

Abstract

Abstract is missing.