Graph neural networks (GNNs) have been proposed for a wide range of graph-related learning tasks. In particular, in recent years, an increasing number of GNN systems were applied to predict molecular properties. However, a direct impediment is to select appropriate hyperparameters to achieve satisfactory performance with lower computational cost. Meanwhile, many molecular datasets are far smaller than many other datasets in typical deep learning applications. Most hyperparameter optimization (HPO) methods have not been explored in terms of their efficiencies on such small datasets in the molecular domain. In this paper, we conducted a theoretical analysis of common and specific features for two state-of-the-art and popular algorithms for HPO: TPE and CMA-ES, and we compared them with random search (RS), which is used as a baseline. Experimental studies are carried out on several benchmarks in MoleculeNet, from different perspectives to investigate the impact of RS, TPE, and CMA-ES on HPO of GNNs for molecular property prediction. In our experiments, we concluded that RS, TPE, and CMA-ES have their individual advantages in tackling different specific molecular problems. Finally, we believe our work will motivate further research on GNN as applied to molecular machine learning problems in chemistry and materials sciences.
翻译:特别是,近年来,越来越多的GNN系统被用于预测分子特性,然而,一个直接障碍是选择适当的超参数,以较低的计算成本取得令人满意的性能。与此同时,许多分子数据集比典型深层学习应用中的其他数据集要小得多。大多数超光谱优化(HPO)方法尚未就其在分子域内这类小数据集上的效率进行探讨。我们在本文件中对HPO的两个最先进和流行的算法(TPE和CMA-ES)进行了理论分析,并将它们与随机搜索(RS)进行比较,后者用作基线。从不同角度对MoleculeNet中的若干基准进行了实验研究,以调查RS、TPE和CMA-ESPO对GNPO对分子特性预测的影响。在我们的实验中,我们得出结论,RS、TPE和CMA-ES-NS的两种状态和流行算法的共同和具体特性的特性的共特性的共特性,将它们与随机搜索(RS)进行比较。我们最终相信,在研究中,我们各自的分子科学研究中,将进一步运用它们作为研究的动力。