PulseAugur
中
实时 07:57:12

新的控制方法在在线LQR中实现了多对数遗憾

研究人员开发了一种新的在线线性二次控制方法,该方法利用确定性等价性来实现多对数遗憾。该方法放宽了最优控制器的可辨识性要求,从而扩大了确定性等价性可以有效应用的 সমস্যা 范围。新算法保证在控制器可辨识性下,T次交互的预期遗憾为 $O(\log^2 T)$,而在可辨识性失败的情况下,则建立了相应的 $\Omega(\sqrt{T})$ 下界。这项工作以一个倒立摆为例进行了说明,并为最小方差控制提供了比先前方法更宽松的要求。 AI

排序理由 该集群包含一篇在arXiv上发表的研究论文,详细介绍了一种控制系统中的新理论方法。[lever_c_demoted from research: ic=1 ai=0.4]

在 arXiv cs.LG 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →

新的控制方法在在线LQR中实现了多对数遗憾

本文如何被排名

Signal score
10 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Tool
该集群包含一篇在arXiv上发表的研究论文,详细介绍了一种控制系统中的新理论方法。[lever_c_demoted from research: ic=1 ai=0.4]
Source corroboration
Single-source cluster
Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics
paper, other
Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance
Standard
On-topic for AI-industry coverage; kept in the public index.
Story freshness
Breaking (< 6h)
Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

完整方法见我们的编辑标准。

报道来源 [1]

  1. arXiv cs.LG TIER_1 English(EN) · Luca Vignola, Melanie Zeilinger, Bruce D. Lee ·

    退化LQR中通过确定性等价实现多对数悔恨

    arXiv:2611.21927v1 Announce Type: cross Abstract: Singular input penalties, as in minimum variance control, can reduce what must be identified to control an unknown linear system. In online linear quadratic control, certainty equivalence can achieve polylogarithmic regret when th…