Research map / Learning theory and algorithms / Prediction and decision losses
On Consistent Vertex Nomination Schemes
Vince Lyzinski, Keith Levin, Carey E. Priebe
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching (JMLR 2016 · similarity 0.91)
- Graphon based Clustering and Testing of Networks: Algorithms and Theory (ICLR 2022 · similarity 0.86)
- Optimality of Message-Passing Architectures for Sparse Graphs (NeurIPS 2023 · similarity 0.85)
- Semi-supervised Vertex Hunting, with Applications in Network and Text Analysis (NeurIPS 2025 · similarity 0.84)
- Exploring Consistency in Graph Representations: from Graph Kernels to Graph Neural Networks (NeurIPS 2024 · similarity 0.83)
- Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS (ICML 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
