Search Results for author:
Found 4 papers, 0 papers with code
Adversarial Attack against Cross-lingual Knowledge Graph Alignment
Recent literatures have shown that knowledge graph (KG) learning models are highly vulnerable to adversarial attacks.
A Survey of Lottery Ticket Hypothesis
The Lottery Ticket Hypothesis (LTH) states that a dense neural network model contains a highly sparse subnetwork (i. e., winning tickets) that can achieve even better performance than the original model when trained in isolation.
Validating the Lottery Ticket Hypothesis with Inertial Manifold Theory
Despite achieving remarkable efficiency, traditional network pruning techniques often follow manually-crafted heuristics to generate pruned sparse networks.
Adversarial Attacks on Deep Graph Matching
Despite achieving remarkable performance, deep graph learning models, such as node classification and network embedding, suffer from harassment caused by small adversarial perturbations.
