arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.18283cs.CGcs.DSmath.OC
收藏

具有不确定测量的Turnpike问题:带有确定性恢复保证的三角等式ILP

Turnpike with Uncertain Measurements: Triangle-Equality ILP with a Deterministic Recovery Guarantee

Carnegie Mellon University(卡内基梅隆大学)

C. S. Elder, Guillaume Marçais, Carl Kingsford

AI总结:

本文研究了在有限噪声和四舍五入下的Turnpike问题,提出基于三角等式的ILP方法,通过多匹配验证可实现性,并在确定性条件下精确恢复P_y集合。

摘要:

我们研究了具有不确定测量的Turnpike问题:在有限噪声和四舍五入下,从无标签的多重距离集合中重建一维点集。我们通过多匹配对区间索引进行标记,满足所有三角等式,从而得到基于三角等式的ILP。该ILP的约束结构仅依赖于两部分集P_y={ (r,s,t): y_r+y_s=y_t }和一个自然的线性松弛,具有{0,1}系数约束。整数解证明了可实现性,并输出显式分配矩阵,使下游坐标估计能够采用先分配后回归的流程。在有限噪声后四舍五入的情况下,我们证明了在确定性分离条件下,P_y能够被精确恢复,因此ILP/LP接收与无噪声情况相同的组合输入。实验展示了整数行为和在可证明范围外的退化。

英文摘要:

We study Turnpike with uncertain measurements: reconstructing a one-dimensional point set from an unlabeled multiset of pairwise distances under bounded noise and rounding. We give a combinatorial characterization of realizability via a multi-matching that labels interval indices by distinct distance values while satisfying all triangle equalities. This yields an ILP based on the triangle equality whose constraint structure depends only on the two-partition set $\mathcal{P}_y=\{(r,s,t): y_r+y_s=y_t\}$ and a natural LP relaxation with $\{0,1\}$-coefficient constraints. Integral solutions certify realizability and output an explicit assignment matrix, enabling an assignment-first, regression-second pipeline for downstream coordinate estimation. Under bounded noise followed by rounding, we prove a deterministic separation condition under which $\mathcal{P}_y$ is recovered exactly, so the ILP/LP receives the same combinatorial input as in the noiseless case. Experiments illustrate integrality behavior and degradation outside the provable regime.

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

↑