Pruning-as-Search: Efficient Neural Architecture Search via Channel Pruning and Structural Reparameterization

Abstract

Learning rational behaviors in open-world games like Minecraft remains to be challenging for Reinforcement Learning (RL) research due to the compound challenge of partial observability, high-dimensional visual perception and delayed reward. To address this, we propose JueWu-MC, a sample-efficient hierarchical RL approach equipped with representation learning and imitation learning to deal with perception and exploration. Specifically, our approach includes two levels of hierarchy, where the high-level controller learns a policy to control over options and the low-level workers learn to solve each sub-task. To boost the learning of sub-tasks, we propose a combination of techniques including 1) action-aware representation learning which captures underlying relations between action and representation, 2) discriminator-based self-imitation learning for efficient exploration, and 3) ensemble behavior cloning with consistency filtering for policy robustness. Extensive experiments show that JueWu-MC significantly improves sample efficiency and outperforms a set of baselines by a large margin. Notably, we won the championship of the NeurIPS MineRL 2021 research competition and achieved the highest performance score ever.

Hybrid Cooperative Cache Based on Temporal Convolutional Networks in Vehicular Edge Network

“…In this paper, random search is used to set the parameters of the established TCN prediction model, which effectively avoids the curse of dimensionality. We set the parameters of the TCN prediction model by Random Search [35], which samples the search space instead of brute-forcing all possible parameter sets, thus avoiding the curse of dimensionality. The specific parameters are shown in Table 1 below:…”