Publications

(2022). An $$backslash$alpha $-No-Regret Algorithm For Graphical Bilinear Bandits.
(2021). Best Arm Identification in Graphical Bilinear Bandits. International Conference on Machine Learning.
(2020). Refined bounds for randomized experimental design. arXiv preprint arXiv:2012.15726.
(2020). A simple and efficient smoothing method for faster optimization and local exploration. Advances in Neural Information Processing Systems.
(2019). Theoretical limits of pipeline parallel optimization and application to distributed deep learning. Advances in Neural Information Processing Systems.
(2018). Parallel Contextual Bandits in Wireless Handover Optimization. 2018 IEEE International Conference on Data Mining Workshops (ICDMW).
(2017). An Approximate Shapley-Folkman Theorem. arXiv preprint arXiv:1712.08559.
(2017). An approximate shapley-folkman theorem. arXiv preprint arXiv:1712.08559.
(2016). Un algorithme de Gossip pour l’optimisation décentralisée de fonctions sur les paires. Cap 2016-Conférence sur L’apprentissage automatique.