使用基于Wasserstein距离的重新加权增强选择性
Enhancing selectivity using Wasserstein distance based reweighing
AI总结:
本文提出基于Wasserstein距离的贪心重加权算法,使源域训练的网络权重分布逼近目标域,并证明其最优性与效率,应用于识别MNK2选择性抑制剂,实验成功率为5%。
摘要:
给定两个带标签的数据集$\mathcal{S}$和$\mathcal{T}$,我们设计了一种简单高效的贪心算法来重新加权损失函数,使得在$\mathcal{S}$上训练得到的神经网络权重的极限分布逼近在$\mathcal{T}$上训练所得的极限分布。在理论方面,我们证明了当输入数据集的度量熵有界时,我们的贪心算法输出接近最优的重新加权,即网络权重的两个不变分布在总变差距离上可证明地接近。此外,该算法简单且可扩展,我们还证明了算法效率的界。作为一个激励性应用,我们训练了一个神经网络来识别MNK2(一种MAP激酶,负责细胞信号传导)的小分子结合剂,这些结合剂不是MNK1(一种高度相似的蛋白质)的结合剂。在我们的示例数据集中,从enamine目录中预测为最具选择性的43种不同小分子中,有2种小分子经实验验证具有选择性,即在10$\mu$M浓度下,它们将MNK2的酶活性降低到50%以下,但未降低MNK1的酶活性——成功率为5%。
英文摘要:
Given two labeled data-sets $\mathcal{S}$ and $\mathcal{T}$, we design a simple and efficient greedy algorithm to reweigh the loss function such that the limiting distribution of the neural network weights that result from training on $\mathcal{S}$ approaches the limiting distribution that would have resulted by training on $\mathcal{T}$. On the theoretical side, we prove that when the metric entropy of the input datasets is bounded, our greedy algorithm outputs a close to optimal reweighing, i.e., the two invariant distributions of network weights will be provably close in total variation distance. Moreover, the algorithm is simple and scalable, and we prove bounds on the efficiency of the algorithm as well. As a motivating application, we train a neural net to recognize small molecule binders to MNK2 (a MAP Kinase, responsible for cell signaling) which are non-binders to MNK1 (a highly similar protein). In our example dataset, of the 43 distinct small molecules predicted to be most selective from the enamine catalog, 2 small molecules were experimentally verified to be selective, i.e., they reduced the enzyme activity of MNK2 below 50\% but not MNK1, at 10$μ$M -- a 5\% success rate.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。