---
categories: [literature note, /unread, FOS: Computer and information sciences, FOS: Mathematics, Machine Learning (cs.LG), Machine Learning (stat.ML), Statistics Theory (math.ST)]
title: Note de lecture de *Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models* de
 Simon Queric, Cédric Vincent-Cuaz, Charles Bouveyron, Marco Corneli.
bibliography: ../these_ref.bib
---

::: {.callout-note title="Synthèse"}

**Contribution**::

**Related**:: 

:::

::: {.callout-note title="Markdown"}

**FirstAuthor**:: Queric, Simon  
**Author**:: Vincent-Cuaz, Cédric  
**Author**:: Bouveyron, Charles  
**Author**:: Corneli, Marco  

**Title**:: Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models

**Year**:: 2026

**Citekey**:: quericBridgingMaximumLikelihood2026 

**itemType**:: preprint

**DOI**:: 10.48550/ARXIV.2605.28488    
:::

::: {.callout-note title="Pièces-jointes"} 

 - [PDF](file:///home/louis/snap/zotero-snap/common/Zotero/storage/M2S6A2E2/Queric%20et%20al.%20-%202026%20-%20Bridging%20Maximum%20Likelihood%20and%20Optimal%20Transport%20for%20Efficient%20Inference%20and%20Model%20Selection%20in%20Sto.pdf).
:::

::: {.callout-note title="Abstract"}

We study inference in stochastic block models (SBMs) through the lens of optimal transport (OT). We first establish that maximum likelihood variational inference (MLVI) can be interpreted as a semi-relaxed Gromov-Wasserstein (srGW) projection with entropic regularization. While this formulation yields accurate clustering, the entropic regularization prevents transport plans to be sparse, hindering intrinsic model selection. Consequently, we investigate unregularized srGW estimators, and prove that they consistently recover both the SBM connectivity matrix and latent cluster assignments in the asymptotic regime. However, this asymptotic property does not translate into reliable model selection in finite samples, and calls for additional mechanisms to promote sparsity in the inferred cluster proportions. We empirically show that such a regularized formulation yields estimators that simultaneously recover model parameters and select the number of clusters in a single optimization problem, thereby avoiding costly grid search or heuristic model selection procedures.

::::

# Prise de notes

{{< include local_macros.tex.md >}}

![[local_macros.tex]]

%% begin user_notes %%

- [ ] Lire le papier de [[@quericBridgingMaximumLikelihood2026]] 

%% end user_notes %%

# Notes importées

## Other

10 pages, 8 figures.

# Annotations importées

%% begin annotations %%

%% end annotations %%

%% Import Date: 2026-06-09T14:39:56.654+02:00 %%
