|
 | Up a level |
Saha, A and Gopalan, A (2020) From pac to instance-optimal sample complexity in the plackett-luce model. In: 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, pp. 8336-8345.
Saha, A and Gaillard, P and Valko, M (2020) Improved sleeping bandits with stochastic actions sets and adversarial rewards. In: 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, pp. 8327-8335.
Kanade, A and Maniatis, P and Balakrishnan, G and Shi, K (2020) Learning and Evaluating Contextual Embedding of Source Code. In: 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, pp. 5066-5077.
Bhattacharyya, C and Kannan, R (2020) Near-optimal sample complexity bounds for learning latent k-polytopes and applications to ad-mixtures. In: 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, virtual, online, pp. 831-840.
