Stop the war!
Остановите войну!
for scientists:
default search action
"Near-optimal sample complexity bounds for learning Latent k-polytopes and ..."
Chiranjib Bhattacharyya, Ravindran Kannan (2020)
- Chiranjib Bhattacharyya, Ravindran Kannan:
Near-optimal sample complexity bounds for learning Latent k-polytopes and applications to Ad-Mixtures. ICML 2020: 854-863
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.