Methods › General › Negative Sampling › Self-Adversarial Negative Sampling

Self-Adversarial Negative Sampling

30 papers tagged archive 2025-07-28

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

Self-Adversarial Negative Sampling is a negative sampling technique used for methods like word embeddings and knowledge graph embeddings. The traditional negative sampling loss from word2vec for optimizing distance-based models be written as:

L = −logσ(γ− dᵣ(h, t)) − ∑ⁿᵢ₌₁1/klogσ(dᵣ(h^’ᵢ, t^’ᵢ) - γ)

where γ is a fixed margin, σ is the sigmoid function, and (h^’ᵢ, r, t^’ᵢ) is the i-th negative triplet.

The negative sampling loss samples the negative triplets in a uniform way. Such a uniform negative sampling suffers the problem of inefficiency since many samples are obviously false as training goes on, which does not provide any meaningful information. Therefore, the authors propose an approach called self-adversarial negative sampling, which samples negative triples according to the current embedding model. Specifically, we sample negative triples from the following distribution:

p(h^’ⱼ, r, t^’ⱼ | set(hᵢ, rᵢ, tᵢ ) ) = (expαfᵣ(h^’ⱼ, t^’ⱼ))/(∑ᵢ₌₁expαfᵣ(h^’ᵢ, t^’ᵢ))

where α is the temperature of sampling. Moreover, since the sampling procedure may be costly, the authors treat the above probability as the weight of the negative sample. Therefore, the final negative sampling loss with self-adversarial training takes the following form:

L = −logσ(γ− dᵣ(h, t)) − ∑ⁿᵢ₌₁p(h^’ᵢ, r, t^’ᵢ)logσ(dᵣ(h^’ᵢ, t^’ᵢ) - γ)

Source: RotatE: Knowledge Graph Embedding by Relational Rotation...

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: Adaptive Self-Adversarial (ASA) negative sampling; negative sampling; Adaptive Negative Sampling; curriculum negative sampling; self-refining video sampling; self-refining video sampling; Adversarial Self-Distillation; Self-Consistency Sampling (SCS).

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: 30 · with a code link: 16 · where Syntology ran a sample: 5 (4 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (5 of 30 tagged: 4 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 30 of 30, 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 51 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
Graph Embedding20
Knowledge Graph Embedding19
Knowledge Graphs14
Link Prediction13
Knowledge Graph Completion12
Relation11
Entity Embeddings4
Knowledge Graph Embeddings4
Translation4
Representation Learning3
Triplet3
Benchmarking2
Computational Efficiency2
Decoder2
GPU2
Graph Representation Learning2
Prediction2
Reinforcement Learning (RL)2
Relational Reasoning2
Sentence2

Usage over time archive 2025-07-28

Papers per year tagged with Self-Adversarial Negative Sampling: 2019 to 2025, peak 9 9 0 2019: 4 papers 2019 2020: 2 papers 2020 2021: 7 papers 2021 2022: 9 papers 2022 2023: 2 papers 2023 2024: 4 papers 2024 2025: 2 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (30 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

Negative Sampling

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