Skip to content
conftrace_

Laurent Massoulié

23 papers · 2014–2026 · 6 venues · across top CS/AI venues

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.

Jump to papers ↓
+9 more ↓ 🗺️ Taxonomy Completionist (38) 🏃 Academic Marathon · Half 🌍 Conference Polyglot · Silver 🌉 Interdisciplinary Bridge · Gold 🐣 Hot Topic Early Bird
🧭 Keyword Pioneer 🔬 Deep Specialist (10) 🏆 Keyword Champion (4) 💎 Century Club · Bronze 🔥 Unstoppable · Bronze 🌈 Renaissance Researcher (6) ⚡ Prolific Year · Productive 🗃️ Keyword Collector (114) 📈 Trend Setter

Papers

Phase Transition in Convex Relaxations for Graph Alignment COLT 2026 In-depth Analysis of Low-rank Matrix Factorisation in a Federated Setting AAAI 2025 Aligning Embeddings and Geometric Random Graphs: Informational Results and Computational Approaches for the Procrustes-Wasserstein Problem NeurIPS 2024 Asynchronous SGD on Graphs: a Unified Framework for Asynchronous Decentralized and Federated Optimization AISTATS 2024 Barely Random Algorithms and Collective Metrical Task Systems NeurIPS 2024 Minimax Excess Risk of First-Order Methods for Statistical Learning with Data-Dependent Oracles AISTATS 2024 Muffliato: Peer-to-Peer Privacy Amplification for Decentralized Optimization and Averaging NeurIPS 2022 On Sample Optimality in Personalized Collaborative and Federated Learning NeurIPS 2022 Concentration of Non-Isotropic Random Tensors with Applications to Learning and Empirical Risk Minimization COLT 2021 Continuized Accelerations of Deterministic and Stochastic Gradient Descents, and of Gossip Algorithms NeurIPS 2021 Impossibility of Partial Recovery in the Graph Alignment Problem COLT 2021 Dual-Free Stochastic Decentralized Optimization with Variance Reduction NeurIPS 2020 From tree matching to sparse graph alignment COLT 2020 Statistically Preconditioned Accelerated Gradient Method for Distributed Optimization ICML 2020 Accelerated Decentralized Optimization with Local Updates for Smooth and Strongly Convex Objectives AISTATS 2019 An Accelerated Decentralized Stochastic Proximal Algorithm for Finite Sums NeurIPS 2019 Optimal Convergence Rates for Convex Distributed Optimization in Networks JMLR 2019 Planting trees in graphs, and finding them back COLT 2019 Robustness of Spectral Methods for Community Detection COLT 2019 Optimal Algorithms for Non-Smooth Distributed Optimization in Networks NeurIPS 2018 Optimal Algorithms for Smooth and Strongly Convex Distributed Optimization in Networks ICML 2017 On the capacity of information processing systems COLT 2016 Edge Label Inference in Generalized Stochastic Block Models: from Spectral Theory to Impossibility Results COLT 2014