Searcharxiv⌕ Search

arXiv subjects

Han Shi

Publications and source records attributed to Han Shi.

39 records · Page 3Linked to original sources

Bridging the Gap between Sample-based and One-shot Neural Architecture Search with BONAS

Neural Architecture Search (NAS) has shown great potentials in finding better neural network designs. Sample-based NAS is the most reliable approach which aims at exploring the search space and evaluating the most promising architectures. However, it is computationally very costly. As a remedy, the one-shot approach has emerged as a popular technique for accelerating NAS using weight-sharing. However, due to the weight-sharing of vastly different networks, the one-shot approach is less reliable than the sample-based approach. In this work, we propose BONAS (Bayesian Optimized Neural Architecture Search), a sample-based NAS framework which is accelerated using weight-sharing to evaluate multiple related architectures simultaneously. Specifically, we apply Graph Convolutional Network predictor as a surrogate model for Bayesian Optimization to select multiple related candidate models in each iteration. We then apply weight-sharing to train multiple candidate models simultaneously. This approach not only accelerates the traditional sample-based approach significantly, but also keeps its reliability. This is because weight-sharing among related architectures are more reliable than those in the one-shot approach. Extensive experiments are conducted to verify the effectiveness of our method over many competing algorithms.

cs.LG↗

Effective Decoding in Graph Auto-Encoder using Triadic Closure

The (variational) graph auto-encoder and its variants have been popularly used for representation learning on graph-structured data. While the encoder is often a powerful graph convolutional network, the decoder reconstructs the graph structure by only considering two nodes at a time, thus ignoring possible interactions among edges. On the other hand, structured prediction, which considers the whole graph simultaneously, is computationally expensive. In this paper, we utilize the well-known triadic closure property which is exhibited in many real-world networks. We propose the triad decoder, which considers and predicts the three edges involved in a local triad together. The triad decoder can be readily used in any graph-based auto-encoder. In particular, we incorporate this to the (variational) graph auto-encoder. Experiments on link prediction, node clustering and graph generation show that the use of triads leads to more accurate prediction, clustering and better preservation of the graph characteristics.

cs.LG↗

Coalition Formation Games Based Sub-Channel Allocation for Device-to-Device Underlay mmWave Small Cells

Small cells in the millimeter wave band densely deployed underlying the macrocell have been regarded as one of promising candidates for the next generation mobile networks. In the user intensive region, device-to-device (D2D) communication in physical proximity can save power and improve spectral efficiency. In this paper, we focus on the optimal sub-channel allocation for access and D2D links in the scenario of densely deployed multiple mmWave small cells. The problem is modeled as a coalitional game to maximize the system sum rate of access and D2D links in the system. Then we propose a coalition formation game based algorithm for sub-channel allocation. Performance evaluation results demonstrate superior performance in terms of the system sum rate compared with other practical schemes.

cs.NI↗