Romain Cosson

According to our database, Romain Cosson authored at least 17 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Unweighted Layered Graph Traversal: Passing a Crown via Entropy Maximization.

Xingjian Bai, Christian Coester, Romain Cosson

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Unweighted Layered Graph Traversal.

Xingjian Bai, Christian Coester, Romain Cosson

CoRR, 2024

Barely Random Algorithms for Metrical Task Systems.

Romain Cosson, Laurent Massoulié

CoRR, 2024

Ariadne and Theseus: Exploration and Rendezvous with Two Mobile Agents in an Unknown Graph.

Romain Cosson

CoRR, 2024

Breaking the <i>k</i>/ log <i>k</i> Barrier in Collective Tree Exploration via Tree-Mining.

Romain Cosson

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Collective Tree Exploration via Potential Function Method.

Romain Cosson, Laurent Massoulié

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

Asynchronous Collective Tree Exploration by Tree-Mining.

Romain Cosson

CoRR, 2023

Breadth-First Depth-Next: Optimal Collaborative Exploration of Trees with Low Diameter.

Romain Cosson, Laurent Massoulié, Laurent Viennot

CoRR, 2023

Efficient Collaborative Tree Exploration with Breadth-First Depth-Next.

Romain Cosson, Laurent Massoulié, Laurent Viennot

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next.

Romain Cosson, Laurent Massoulié, Laurent Viennot

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Gradient Descent with Low-Rank Objective Functions.

Romain Cosson, Ali Jadbabaie, Anuran Makur, Amirhossein Reisizadeh, Devavrat Shah

Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

2022

Gradient Descent for Low-Rank Functions.

Romain Cosson, Ali Jadbabaie, Anuran Makur, Amirhossein Reisizadeh, Devavrat Shah

CoRR, 2022

Universal Online Learning with Bounded Loss: Reduction to Binary Classification.

Moïse Blanchard, Romain Cosson

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Universal Online Learning with Unbounded Losses: Memory Is All You Need.

Moïse Blanchard, Romain Cosson, Steve Hanneke

Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

2021

Approximating the Log-Partition Function.

Romain Cosson, Devavrat Shah

CoRR, 2021

Quantifying Variational Approximation for Log-Partition Function.

Romain Cosson, Devavrat Shah

Proceedings of the Conference on Learning Theory, 2021

2020

Synthetic Interventions.

Anish Agarwal, Abdullah Alomar, Romain Cosson, Devavrat Shah, Dennis Shen

CoRR, 2020