3 citations · 3 across the 3 of their papers we have counts for
3 papers
On the Slow Convergence to Trivial Solutions of Algorithms for Hard Optimization Problems
Ali Hussaini Umar, Jean Barbier, Matthieu Jonckheere +1
Hard combinatorial optimization problems, many of which are NP-hard, present fundamental algorithmic challenges. Average-case analysis on random instances has emerged as a powerful…
Bayes-optimal limits in structured PCA, and how to reach them
Jean Barbier, Francesco Camilli, Marco Mondelli +1
How do statistical dependencies in measurement noise influence high-dimensional inference? To answer this, we study the paradigmatic spiked matrix model of principal components ana…
Sequential Algorithms and Independent Sets Discovering on Large Sparse Random Graphs
Paola Bermolen, Matthieu Jonckheere, Federico Larroca +1
Computing the size of maximum independent sets is a NP-hard problem for fixed graphs. Characterizing and designing efficient algorithms to estimate this independence number for ran…