arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2310.09677math.OCcs.NAmath.NA
收藏

S-过程松弛:涉及切比雪夫中心的精确性案例

S-Procedure Relaxation: a Case of Exactness Involving Chebyshev Centers

Simon Foucart, Chunyang Liao

AI总结:

本研究证明在实数情形下,当二次约束涉及正交投影算子时,用于确定切比雪夫中心的半定规划方法是精确的,扩展了Beck和Eldar的复数结果,并提出了开放性问题。

摘要:

最优恢复是一个数学框架,用于从观测数据中学习函数,它采用与待学习函数的模型假设相关的最坏情况视角。在有限维希尔伯特空间中,我们考虑基于可逼近性和观测不准确性的模型假设,其中观测不准确性被建模为在$\ell_2$中有界的加性误差。我们关注局部恢复问题,该问题相当于确定切比雪夫中心。Beck和Eldar的早期工作提出了用于确定切比雪夫中心的半定规划方法。该结果仅在复数情形下有效,但在实数情形下不一定有效,因为它依赖于具有两个二次约束的S-过程,而该过程仅在复数情形下提供紧松弛。我们的贡献在于证明,在二次约束涉及正交投影算子的特定实例中,该半定规划方法在实数情形下也是精确的。我们的论证利用了我们先前的相关工作,在那项工作中我们以不同方式获得了精确的切比雪夫中心。最后,我们提出了一些开放性问题,并评论了最优恢复领域其他近期成果。

英文摘要:

Optimal recovery is a mathematical framework for learning functions from observational data by adopting a worst-case perspective tied to model assumptions on the functions to be learned. Working in a finite-dimensional Hilbert space, we consider model assumptions based on approximability and observation inaccuracies modeled as additive errors bounded in $\ell_2$. We focus on the local recovery problem, which amounts to the determination of Chebyshev centers. Earlier work by Beck and Eldar presented a semidefinite recipe for the determination of Chebyshev centers. The result was valid in the complex setting only, but not necessarily in the real setting, since it relied on the S-procedure with two quadratic constraints, which offers a tight relaxation only in the complex setting. Our contribution consists in proving that this semidefinite recipe is exact in the real setting, too, at least in the particular instance where the quadratic constraints involve orthogonal projectors. Our argument exploits a previous work of ours, where exact Chebyshev centers were obtained in a different way. We conclude by stating some open questions and by commenting on other recent results in optimal recovery.

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

↑