稀疏多尺度学习的前向后向贪婪算法
A Forward Backward Greedy approach for Sparse Multiscale Learning
摘要:
多尺度模型被认为是成功地发现和分析数据中的结构在不同的分辨率。在目前的工作中,我们提出了一个特征驱动的再生核希尔伯特空间(RKHS),其中相关的内核具有加权多尺度结构。为了在这个空间中生成近似,我们提供了一个实用的前向-后向算法,该算法被证明可以greetly构造一组具有多尺度结构的基函数,同时还可以从给定的数据集创建稀疏表示,使得表示和预测非常有效。我们提供了一个详细的分析算法,包括选择算法的超参数和估计概率收敛率在个别尺度的建议。然后,我们将这种分析扩展到多尺度设置,研究有限尺度截断和固有的RKHS的解决方案的质量的影响。在最后一节中,我们分析了各种模拟和真实数据集上的方法的性能,从而证明了模型质量和数据减少方面的效率要求。
英文摘要:
Multiscale Models are known to be successful in uncovering and analyzing the structures in data at different resolutions. In the current work we propose a feature driven Reproducing Kernel Hilbert space (RKHS), for which the associated kernel has a weighted multiscale structure. For generating approximations in this space, we provide a practical forward-backward algorithm that is shown to greedily construct a set of basis functions having a multiscale structure, while also creating sparse representations from the given data set, making representations and predictions very efficient. We provide a detailed analysis of the algorithm including recommendations for selecting algorithmic hyper-parameters and estimating probabilistic rates of convergence at individual scales. Then we extend this analysis to multiscale setting, studying the effects of finite scale truncation and quality of solution in the inherent RKHS. In the last section, we analyze the performance of the approach on a variety of simulation and real data sets, thereby justifying the efficiency claims in terms of model quality and data reduction.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。