Papers › An Adversarial Transfer Network for Knowledge Representation Learning

An Adversarial Transfer Network for Knowledge Representation Learning

30 Apr 2021arXiv:2104.14757archive 2025-07-28

Huijuan Wang, Shuangyin Li, Rong pan

Knowledge representation learning has received a lot of attention in the past few years. The success of existing methods heavily relies on the quality of knowledge graphs. The entities with few triplets tend to be learned with less expressive power. Fortunately, there are many knowledge graphs constructed from various sources, the representations of which could contain much information. We propose an adversarial embedding transfer network ATransN, which transfers knowledge from one or more teacher knowledge graphs to a target one through an aligned entity set without explicit data leakage. Specifically, we add soft constraints on aligned entity pairs and neighbours to the existing knowledge representation learning methods. To handle the problem of possible distribution differences between teacher and target knowledge graphs, we introduce an adversarial adaption module. The discriminator of this module evaluates the degree of consistency between the embeddings of an aligned entity pair. The consistency score is then used as the weights of soft constraints. It is not necessary to acquire the relations and triplets in teacher knowledge graphs because we only utilize the entity representations. Knowledge graph completion results show that ATransN achieves better performance against baselines without transfer on three datasets, CN3l, WK3l, and DWY100k. The ablation study demonstrates that ATransN can bring steady and consistent improvement in different settings. The extension of combining other knowledge graph embedding algorithms and the extension with three teacher graphs display the promising generalization of the adversarial transfer network.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 11 code samples harvested from 1 repository linked to this paper: 9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 11 samples from 1 repository, 9 ran (9 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

LemonNoel/ATransN officialmentioned in papermentioned on GitHubpytorchApache-2.0Syntology: 11 samples, 9 ran (0 instrument-failed) · 2 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested: 9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

9ran
2unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from LemonNoel/ATransN. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

LemonNoel/ATransN official repository 11 samples, 9 ran (0 instrument-failed) · 2 unverified
anneal_fn src/util.py ran Apache-2.0 (permissive) · 90a1ba008204d7a0 · report fixture: signature fn:str/0/str, t:int/0/int, T:int/0/int, init_value:float/0/float, final_value:float/0/float · returned float · level recorded 2026-09-25
get_best_steps src/convertor.py ran Apache-2.0 (permissive) · 181f93687a587de5 · report fixture: signature log_file:str/0/str · returned dict · level recorded 2026-09-25
get_constant_schedule_with_warmup in 25 papers src/util.py ran Apache-2.0 (permissive) · a2003a42a1bf5632 · report fixture: signature optimizer:SGD/0/?, num_warmup_steps:int/0/int, last_epoch:int/0/int · returned LambdaLR · level recorded 2026-09-25
get_cosine_with_hard_restarts_schedule_with_warmup in 5 papers src/util.py ran Apache-2.0 (permissive) · 6bf3d4e2168f71c5 · report fixture: signature optimizer:SGD/0/?, num_warmup_steps:int/0/int, num_training_steps:int/0/int, num_cycles:float/0/float, last_epoch:int/0/int, min_percent:float/0/float · returned LambdaLR · level recorded 2026-09-25
get_metric in 19 papers src/convertor.py ran fingerprinted Apache-2.0 (permissive) · 6dfb1c716b6c83a7 · report fixture: signature line:str/0/str, type:str/0/str · returned tuple · level recorded 2026-09-25
get_true_head_and_tail src/dataset.py ran Apache-2.0 (permissive) · 4cf6f2aff9b0abed · report fixture: signature triples:list/1/tuple · returned tuple · level recorded 2026-09-25
index in 10 papers src/link_predictor.py ran Apache-2.0 (permissive) · 1be2ea3a070800ae · report fixture: signature array:Tensor/1/int, item:int/0/int · returned int · level recorded 2026-09-25
load_shared_entity src/dataset.py ran Apache-2.0 (permissive) · df000b54e9dee3f4 · report fixture: signature filename:str/0/str, separator:str/0/str · returned DataFrame · level recorded 2026-09-25
read_dictionary src/run_entity_alignment.py ran Apache-2.0 (permissive) · 2ecf01405509ebdf · report fixture: signature file_name:str/0/str · returned dict · level recorded 2026-09-25
get_learner_iter_per_shared src/dataset.py unverified Apache-2.0 (permissive) · d5eaad152c10fc75 · report
make_train_valid_test src/run_data_split.py unverified Apache-2.0 (permissive) · 6ecfdb3bf0b75d2a · report

Tasks

Graph EmbeddingKnowledge Graph CompletionKnowledge Graph EmbeddingKnowledge GraphsRepresentation Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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