Hansi Yang

Tensorizing Subgraph Search in the Supernet.

2021 · arXiv (Cornell University)

Recently, a special kind of graph, i.e., supernet, which allows two nodes connected by multi-choice edges, has exhibited its power in neural architecture search (NAS) by searching for better architectures for computer vision (CV) and …

AutoWeird: Weird Translational Scoring Function Identified by Random Search

2022 · arXiv (Cornell University)

Scoring function (SF) measures the plausibility of triplets in knowledge graphs. Different scoring functions can lead to huge differences in link prediction performances on different knowledge graphs. In this report, we describe a weird scoring …