Methods › Graphs › Graph Embeddings › VERSE

VERtex Similarity Embeddings

VERSE

40 papers tagged archive 2025-07-28

Introduced by Anton Tsitsulin et al. in VERSE: Versatile Graph Embeddings from Similarity Measures

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

VERtex Similarity Embeddings (VERSE) is a simple, versatile, and memory-efficient method that derives graph embeddings explicitly calibrated to preserve the distributions of a selected vertex-to-vertex similarity measure. VERSE learns such embeddings by training a single-layer neural network.

Source: Tsitsulin et al.

Image source: Tsitsulin et al.

PaperSource

In Syntology name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.

From the lookup's note on this name: Nothing resolved to this name, but 6 entries in Syntology's graph carry it; the most cited is the paper “VERSE: Versatile Graph Embeddings from Similarity Measures” (arXiv:1803.04742, 287 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach. For arXiv:1803.04742: its page on this site · ask the lookup about it.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 40 · with a code link: 21 · where Syntology ran a sample: 3 (3 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (3 of 40 tagged: 3 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 40 of 40, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 68 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Segmentation6
Link Prediction4
Semantic Segmentation4
Anatomy3
Computed Tomography (CT)3
Node Classification3
Translation3
Benchmarking2
Data Augmentation2
Decision Making2
Decoder2
General Classification2
Image Segmentation2
Instance Segmentation2
Language Modeling2
Language Modelling2
Music Generation2
Representation Learning2
Retrieval2
Sentence2

Usage over time archive 2025-07-28

Papers per year tagged with VERSE: 2018 to 2025, peak 8 8 0 2018: 2 papers 2018 2019: 7 papers 2019 2020: 6 papers 2020 2021: 4 papers 2021 2022: 6 papers 2022 2023: 8 papers 2023 2024: 5 papers 2024 2025: 2 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (40 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Graph Embeddings

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections