Synthetic Interventions. - Anish Agarwal; Abdullah Alomar; Romain Cosson; Devavrat Shah; Dennis Shen (CoRR, 2020)

Quantifying Variational Approximation for Log-Partition Function. - Romain Cosson; Devavrat Shah (COLT, 2021)

Approximating the Log-Partition Function. - Romain Cosson; Devavrat Shah (CoRR, 2021)

Universal Online Learning with Unbounded Losses: Memory Is All You Need. - Moïse Blanchard; Romain Cosson; Steve Hanneke (ALT, 2022)

Universal Online Learning with Bounded Loss: Reduction to Binary Classification. - Moïse Blanchard; Romain Cosson (COLT, 2022)

Gradient Descent for Low-Rank Functions. - Romain Cosson; Ali Jadbabaie; Anuran Makur; Amirhossein Reisizadeh; Devavrat Shah (CoRR, 2022)

Gradient Descent with Low-Rank Objective Functions. - Romain Cosson; Ali Jadbabaie; Anuran Makur; Amirhossein Reisizadeh; Devavrat Shah (CDC, 2023)

Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next. - Romain Cosson; Laurent Massoulié; Laurent Viennot (PODC, 2023)

Efficient Collaborative Tree Exploration with Breadth-First Depth-Next. - Romain Cosson; Laurent Massoulié; Laurent Viennot (DISC, 2023)

Breadth-First Depth-Next: Optimal Collaborative Exploration of Trees with Low Diameter. - Romain Cosson; Laurent Massoulié; Laurent Viennot (CoRR, 2023)

Asynchronous Collective Tree Exploration by Tree-Mining. - Romain Cosson (CoRR, 2023)

Collective Tree Exploration via Potential Function Method. - Romain Cosson; Laurent Massoulié (ITCS, 2024)

Barely Random Algorithms and Collective Metrical Task Systems. - Romain Cosson; Laurent Massoulié (NeurIPS, 2024)

Breaking the k/ log k Barrier in Collective Tree Exploration via Tree-Mining. - Romain Cosson (SODA, 2024)

Ariadne and Theseus: Exploration and Rendezvous with Two Mobile Agents in an Unknown Graph. - Romain Cosson (CoRR, 2024)

Barely Random Algorithms for Metrical Task Systems. - Romain Cosson; Laurent Massoulié (CoRR, 2024)

Unweighted Layered Graph Traversal. - Xingjian Bai; Christian Coester; Romain Cosson (CoRR, 2024)

Unweighted Layered Graph Traversal: Passing a Crown via Entropy Maximization. - Xingjian Bai; Christian Coester; Romain Cosson (SODA, 2025)

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound. - Romain Cosson; Laurent Massoulié (CoRR, 2025)