Timezone: »
Poster
Robustness of Community Detection to Random Geometric Perturbations
Sandrine Peche · Vianney Perchet
We consider the stochastic block model where connection between vertices is perturbed by some latent (and unobserved) random geometric graph. The objective is to prove that spectral methods are robust to this type of noise, even if they are agnostic to the presence (or not) of the random graph. We provide explicit regimes where the second eigenvector of the adjacency matrix is highly correlated to the true community vector (and therefore when weak/exact recovery is possible). This is possible thanks to a detailed analysis of the spectrum of the latent random graph, of its own interest.
Author Information
Sandrine Peche (LPSM, Université Paris Diderot)
Vianney Perchet (ENSAE & Criteo AI Lab)
More from the Same Authors
-
2021 Spotlight: Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits »
Reda Ouhamma · Odalric-Ambrym Maillard · Vianney Perchet -
2021 Spotlight: Decentralized Learning in Online Queuing Systems »
Flore Sentenac · Etienne Boursier · Vianney Perchet -
2023 Poster: Advice querying under budget constraint for online algorithms »
Ziyad Benomar · Vianney Perchet -
2023 Poster: Trading-off price for data quality to achieve fair online allocation »
Mathieu Molina · Nicolas Gast · Patrick Loiseau · Vianney Perchet -
2022 Poster: Active Labeling: Streaming Stochastic Gradients »
Vivien Cabannes · Francis Bach · Vianney Perchet · Alessandro Rudi -
2021 Poster: Local Differential Privacy for Regret Minimization in Reinforcement Learning »
Evrard Garcelon · Vianney Perchet · Ciara Pike-Burke · Matteo Pirotta -
2021 Poster: ROI Maximization in Stochastic Online Decision-Making »
Nicolò Cesa-Bianchi · Tom Cesari · Yishay Mansour · Vianney Perchet -
2021 Poster: Making the most of your day: online learning for optimal allocation of time »
Etienne Boursier · Tristan Garrec · Vianney Perchet · Marco Scarsini -
2021 Poster: Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridge »
Reda Ouhamma · Odalric-Ambrym Maillard · Vianney Perchet -
2021 Poster: Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits »
Reda Ouhamma · Odalric-Ambrym Maillard · Vianney Perchet -
2021 Poster: Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm »
Nathan Noiry · Vianney Perchet · Flore Sentenac -
2021 Poster: Decentralized Learning in Online Queuing Systems »
Flore Sentenac · Etienne Boursier · Vianney Perchet -
2020 Poster: Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits »
Pierre Perrault · Etienne Boursier · Michal Valko · Vianney Perchet -
2019 Poster: Categorized Bandits »
Matthieu Jedor · Vianney Perchet · Jonathan Louedec -
2019 Poster: SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits »
Etienne Boursier · Vianney Perchet -
2019 Spotlight: SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits »
Etienne Boursier · Vianney Perchet -
2017 Poster: Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe »
Quentin Berthet · Vianney Perchet -
2017 Spotlight: Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe »
Quentin Berthet · Vianney Perchet -
2016 Poster: Combinatorial semi-bandit with known covariance »
Rémy Degenne · Vianney Perchet