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

Chiranjib Bhattacharyya, Ravindran Kannan

Browse the full ICML paper archive.