一维数据的稀疏分段线性回归
Sparsest Piecewise-Linear Regression of One-Dimensional Data
摘要:
我们研究的问题,一维回归的数据点与总变差(TV)正则化(在这个意义上的措施)的二阶导数,这是已知的促进分段线性解决方案,很少结。虽然存在用于确定这种自适应样条的有效算法,但TV正则化的困难在于解通常是非唯一的,这是在实践中经常被忽略的方面。在本文中,我们提出了一个系统的分析,结果在一个完整的描述的解决方案集之间的情况下,解决方案是唯一的和那些,更频繁,它不是一个明确的区别。对于后一种情况,我们确定了稀疏的解决方案,即,那些具有最小数量的结,我们推导出一个公式来计算最小数量的结的基础上的数据点。为了实现这一点,我们首先考虑的问题,精确插值,从而导致一个更容易的理论分析。接下来,我们放松了精确的插值要求回归设置,我们考虑一个惩罚的最优化问题的严格凸数据保真度费用函数。我们表明,潜在的惩罚问题可以重新表述为一个约束问题,因此,我们以前的所有结果仍然适用。基于我们的理论分析,我们提出了一个简单而快速的两步算法,不可知的唯一性,达到一个稀疏的解决方案,这个惩罚问题。
英文摘要:
We study the problem of one-dimensional regression of data points with total-variation (TV) regularization (in the sense of measures) on the second derivative, which is known to promote piecewise-linear solutions with few knots. While there are efficient algorithms for determining such adaptive splines, the difficulty with TV regularization is that the solution is generally non-unique, an aspect that is often ignored in practice. In this paper, we present a systematic analysis that results in a complete description of the solution set with a clear distinction between the cases where the solution is unique and those, much more frequent, where it is not. For the latter scenario, we identify the sparsest solutions, i.e., those with the minimum number of knots, and we derive a formula to compute the minimum number of knots based solely on the data points. To achieve this, we first consider the problem of exact interpolation which leads to an easier theoretical analysis. Next, we relax the exact interpolation requirement to a regression setting, and we consider a penalized optimization problem with a strictly convex data-fidelity cost function. We show that the underlying penalized problem can be reformulated as a constrained problem, and thus that all our previous results still apply. Based on our theoretical analysis, we propose a simple and fast two-step algorithm, agnostic to uniqueness, to reach a sparsest solution of this penalized problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。