Sledovat
Igor Colin
Igor Colin
Télécom Paris
E-mailová adresa ověřena na: telecom-paris.fr - Domovská stránka
Název
Citace
Citace
Rok
Gossip dual averaging for decentralized optimization of pairwise functions
I Colin, A Bellet, J Salmon, S Clémençon
International Conference on Machine Learning (ICML 2016), 2016
1202016
Scaling-up Empirical Risk Minimization: Optimization of Incomplete -statistics
S Clémençon, I Colin, A Bellet
Journal of Machine Learning Research 17 (76), 1-36, 2016
642016
Extending gossip algorithms to distributed estimation of U-statistics
I Colin, A Bellet, J Salmon, S Clémençon
Advances in Neural Information Processing Systems 28, 2015
152015
An approximate shapley-folkman theorem
T Kerdreux, I Colin, A d'Aspremont
arXiv preprint arXiv:1712.08559, 2017
122017
Parallel Contextual Bandits in Wireless Handover Optimization
I Colin, A Thomas, M Draief
2018 IEEE International Conference on Data Mining Workshops (ICDMW), 258-265, 2018
112018
Theoretical limits of pipeline parallel optimization and application to distributed deep learning
I Colin, L Dos Santos, K Scaman
Advances in Neural Information Processing Systems 32, 2019
92019
Best Arm Identification in Graphical Bilinear Bandits
G Rizk, A Thomas, I Colin, R Laraki, Y Chevaleyre
International Conference on Machine Learning, 9010-9019, 2021
72021
A simple and efficient smoothing method for faster optimization and local exploration
K Scaman, L Dos Santos, M Barlier, I Colin
Advances in Neural Information Processing Systems 33, 6503-6513, 2020
72020
Multi-agent best arm identification with private communications
A Rio, M Barlier, I Colin, M Soare
International Conference on Machine Learning, 29082-29102, 2023
62023
Deciphering Lasso-based Classification Through a Large Dimensional Analysis of the Iterative Soft-Thresholding Algorithm
M Tiomoko, E Schnoor, MEA Seddik, I Colin, A Virmaux
International Conference on Machine Learning, 21449-21477, 2022
42022
An Approximate Shapley-Folkman Theorem
A d'Aspremont, I Colin
arXiv preprint arXiv:1712.08559, 2017
42017
Stable bounds on the duality gap of separable nonconvex optimization problems
T Kerdreux, I Colin, A d’Aspremont
Mathematics of Operations Research 48 (2), 1044-1065, 2023
32023
Refined bounds for randomized experimental design
G Rizk, I Colin, A Thomas, M Draief
arXiv preprint arXiv:2012.15726, 2020
32020
Price of Safety in Linear Best Arm Identification
X Shang, I Colin, M Barlier, H Cherkaoui
arXiv preprint arXiv:2309.08709, 2023
22023
Adaptation des méthodes d’apprentissage aux U-statistiques
I Colin
telecom-paristech, 2016
22016
Decentralized Topic Modelling with Latent Dirichlet Allocation
I Colin, C Dupuy
arXiv preprint arXiv:1610.01417, 2016
22016
Un algorithme de Gossip pour l’optimisation décentralisée de fonctions sur les paires
I Colin, A Bellet, J Salmon, S Clémençon
Cap 2016-Conférence sur L'apprentissage automatique, 2016
12016
Differentially Private Model-Based Offline Reinforcement Learning
A Rio, M Barlier, I Colin, A Thomas
arXiv preprint arXiv:2402.05525, 2024
2024
Clustered Multi-Agent Linear Bandits
H Cherkaoui, M Barlier, I Colin
arXiv preprint arXiv:2309.08710, 2023
2023
Method and system for a controller
L Dos Santos, M Barlier, K Balazs, I Colin
US Patent App. 18/065,800, 2023
2023
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20