arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.06012cs.LGcs.CV
收藏

学习不同特征是有帮助的,且可证明

Learning distinct features helps, provably

Tampere University(坦佩雷大学);University of Jyväskylä(于韦斯屈莱大学);Finnish Environment Institute(芬兰环境研究所);Aarhus University(奥胡斯大学)

Firas Laakom, Jenni Raitoharju, Alexandros Iosifidis, Moncef Gabbouj

AI总结:

该研究针对两层神经网络的特征多样性问题,以隐藏层特征的平均$L_2$距离衡量多样性,基于Rademacher复杂度推导出依赖特征多样性的泛化界,证明隐藏层特征越多样泛化越好,并给出向深层网络与不同损失的扩展方法。

摘要:

我们研究了采用最小二乘损失训练的两层神经网络所学习特征的多样性。我们通过隐藏层特征之间的平均$L_2$距离来衡量多样性,并从理论上探究学习非冗余的不同特征如何影响网络性能。为此,我们基于Rademacher复杂度推导出了这类网络中依赖特征多样性的新型泛化界。我们的分析证明,网络隐藏层内单元的特征越具差异性,泛化效果越好。我们还展示了如何将研究结果扩展到更深层网络及不同损失函数的场景。

英文摘要:

We study the diversity of the features learned by a two-layer neural network trained with the least squares loss. We measure the diversity by the average $L_2$-distance between the hidden-layer features and theoretically investigate how learning non-redundant distinct features affects the performance of the network. To do so, we derive novel generalization bounds depending on feature diversity based on Rademacher complexity for such networks. Our analysis proves that more distinct features at the network's units within the hidden layer lead to better generalization. We also show how to extend our results to deeper networks and different losses.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑