通过隐参数的确定性分配进行学习
Learning through deterministic assignment of hidden parameters
摘要:
监督学习通常归结为基于有限输入输出样本在参数化假设空间中确定隐藏和亮参数。隐参数决定了隐预测量的属性或估计量的非线性机制,而亮参数则表征了隐预测量如何线性组合或线性机制。在传统的学习范式中,隐参数和亮参数不能在一个学习过程中同时区分和训练。这种一阶段学习(OSL)带来了理论分析的好处,但遭受高计算负担。为了克服这一困难,提出了一种两阶段学习(TSL)方案,其特征在于通过确定性隐参数分配(LtDaHP)进行学习,该方案建议通过使用球面上的最小Riesz能量点和区间上的等距点来确定性地生成隐参数。我们从理论上证明了在这样确定性地分配隐参数的情况下,具有神经网络实现的LtDaHP的泛化性能几乎与OSL的泛化性能相同,并给出了一系列的仿真和应用实例来支持LtDaHP的优越性能
英文摘要:
Supervised learning frequently boils down to determining hidden and bright parameters in a parameterized hypothesis space based on finite input-output samples. The hidden parameters determine the attributions of hidden predictors or the nonlinear mechanism of an estimator, while the bright parameters characterize how hidden predictors are linearly combined or the linear mechanism. In traditional learning paradigm, hidden and bright parameters are not distinguished and trained simultaneously in one learning process. Such an one-stage learning (OSL) brings a benefit of theoretical analysis but suffers from the high computational burden. To overcome this difficulty, a two-stage learning (TSL) scheme, featured by learning through deterministic assignment of hidden parameters (LtDaHP) was proposed, which suggests to deterministically generate the hidden parameters by using minimal Riesz energy points on a sphere and equally spaced points in an interval. We theoretically show that with such deterministic assignment of hidden parameters, LtDaHP with a neural network realization almost shares the same generalization performance with that of OSL. We also present a series of simulations and application examples to support the outperformance of LtDaHP
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。