Login / Signup
Near-optimal sample complexity bounds for learning Latent k-polytopes and applications to Ad-Mixtures.
Chiranjib Bhattacharyya
Ravindran Kannan
Published in:
ICML (2020)
Keyphrases
</>
learning process
learning algorithm
reinforcement learning
supervised learning
machine learning
multi class
model selection
learning tasks
sample complexity bounds