arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0912.5182cs.DScs.CG
收藏

路和树上的Lipschitz单峰和保序回归

Lipschitz Unimodal and Isotonic Regression on Paths and Trees

Pankaj K. Agarwal, Jeff M. Phillips, Bardia Sadri

摘要:

我们描述的算法找到回归的t,一个序列的值,最接近的序列s的均方误差,使s总是增加(保序性),所以两个连续点的值不会增加太多(Lipschitz)。保序性约束可以用单模约束代替,其中s中恰好有一个局部最大值。这些算法从值序列推广到了值树。对于每种情况,我们描述了近线性时间算法。

英文摘要:

We describe algorithms for finding the regression of t, a sequence of values, to the closest sequence s by mean squared error, so that s is always increasing (isotonicity) and so the values of two consecutive points do not increase by too much (Lipschitz). The isotonicity constraint can be replaced with a unimodular constraint, where there is exactly one local maximum in s. These algorithm are generalized from sequences of values to trees of values. For each scenario we describe near-linear time algorithms.

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

↑