几乎与最优二次可微回归量一样好的预测
Predicting Nearly As Well As the Optimal Twice Differentiable Regressor
摘要:
我们以单独的序列方式研究实值数据的非线性回归,在那里我们提供的结果保证在没有任何统计假设的情况下保持不变。我们解决了传统非线性回归方法的收敛和训练不足问题,并引入了一种算法,该算法通过增量分层结构(即,经由增量决策树)。特别地,我们提出了一个分段线性(或非线性)回归算法,该算法以数据驱动的方式划分回归空间,并在每个区域学习线性模型。与传统的方法不同,我们的算法逐渐增加的不相交的分区的数量在回归空间中的顺序方式,根据观察到的数据。通过这种数据驱动的方法,我们的算法顺序和渐近实现的性能的最佳二次可微回归函数的任何数据序列与未知的和任意长度。在一定的正则性条件下,该算法的计算复杂性仅为数据长度的对数。我们提供了明确的描述算法,并证明了显着的收益为著名的基准真实数据集和混沌信号。
英文摘要:
We study nonlinear regression of real valued data in an individual sequence manner, where we provide results that are guaranteed to hold without any statistical assumptions. We address the convergence and undertraining issues of conventional nonlinear regression methods and introduce an algorithm that elegantly mitigates these issues via an incremental hierarchical structure, (i.e., via an incremental decision tree). Particularly, we present a piecewise linear (or nonlinear) regression algorithm that partitions the regressor space in a data driven manner and learns a linear model at each region. Unlike the conventional approaches, our algorithm gradually increases the number of disjoint partitions on the regressor space in a sequential manner according to the observed data. Through this data driven approach, our algorithm sequentially and asymptotically achieves the performance of the optimal twice differentiable regression function for any data sequence with an unknown and arbitrary length. The computational complexity of the introduced algorithm is only logarithmic in the data length under certain regularity conditions. We provide the explicit description of the algorithm and demonstrate the significant gains for the well-known benchmark real data sets and chaotic signals.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。