7 papers
The value of random zero-sum games
Romain Cosson, Laurent Massoulié
We study the value of a two-player zero-sum game on a random matrix , defined by . In the setting where $n…
Performance of Gaussian Boson Sampling on Planted Bipartite Clique Detection
Yu-Zhen Janice Chen, Laurent Massoulié, Don Towsley
We investigate whether Gaussian Boson Sampling (GBS) can provide a computational advantage for solving the planted biclique problem, which is a graph problem widely believed to be…
Computational thresholds in high-dimensional statistics: the case of graph alignment
Laurent Massoulié
In this article we consider the graph alignment problem from the perspective of high-dimensional statistics: we aim to estimate an unknown permutation from the observation of…
Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound
Romain Cosson, Laurent Massoulié
We study the problem of collective tree exploration in which a team of mobile agents must collectively visit all nodes of an unknown tree in as few moves as possible. The agent…
Adaptive collaboration for online personalized distributed learning with heterogeneous clients
Constantin Philippenko, Batiste Le Bars, Kevin Scaman +1
We study the problem of online personalized decentralized learning with statistically heterogeneous clients collaborating to accelerate local training. An important challenge i…
Graph Alignment via Birkhoff Relaxation
Sushil Mahavir Varma, Irène Waldspurger, Laurent Massoulié
We consider the graph alignment problem, wherein the objective is to find a vertex correspondence between two graphs that maximizes the edge overlap. The graph alignment problem is…