activity
20052026
most citedUniversality in polytope phase transitions and message passing algorithms

221 citations · 869 across the 56 of their papers we have counts for

collaborators

65 papers

cs.LG2026

Putnam 2025 Problems in Rocq using Opus 4.6 and Rocq-MCP

Guillaume Baudart, Marc Lelarge, Tristan Stérin +1

We report on an experiment in which Claude Opus~4.6, equipped with a suite of Model Context Protocol (MCP) tools for the Rocq proof assistant, autonomously proved 10 of 12 problems…

cs.LG2023★ 2 cited

FLEX: an Adaptive Exploration Algorithm for Nonlinear Systems

Matthieu Blanke, Marc Lelarge

Model-based reinforcement learning is a powerful tool, but collecting data to fit an accurate model of the system can be costly. Exploring an unknown environment in a sample-effici…

cs.LG2023★ 2 cited

Convergence beyond the over-parameterized regime using Rayleigh quotients

David A. R. Robin, Kevin Scaman, Marc Lelarge

In this paper, we present a new strategy to prove the convergence of deep learning architectures to a zero training (or even testing) loss by gradient flow. Our analysis is centere…

stat.ML2022★ 1 cited

Online greedy identification of linear dynamical systems

Matthieu Blanke, Marc Lelarge

This work addresses the problem of exploration in an unknown environment. For linear dynamical systems, we use an experimental design framework and introduce an online greedy polic…

cs.LG2022

SiMCa: Sinkhorn Matrix Factorization with Capacity Constraints

Eric Daoud, Luca Ganassali, Antoine Baker +1

For a very broad range of problems, recommendation algorithms have been increasingly used over the past decade. In most of these algorithms, the predictions are built upon user-ite…

cs.DS2021★ 8 cited

Correlation detection in trees for planted graph alignment

Luca Ganassali, Laurent Massoulié, Marc Lelarge

Motivated by alignment of correlated sparse random graphs, we introduce a hypothesis testing problem of deciding whether or not two random trees are correlated. We obtain sufficien…