English(EN) Second-Order Smooth Planning with Optimal-Transport Bellman Smoothing

新的规划方法使用最优传输平滑将复杂度降低了 3 倍

作者 PulseAugur 编辑部 · [1 个来源] · 2026-09-10 04:00

研究人员开发了一种名为 SecondOrderSmoothCruiser 的新规划方法，通过引入二阶光滑性来改进现有技术。这项进展将生成模型规划的预言机复杂度从 $\\widetilde O(\\varepsilon^{-4})$ 降低到 $\\widetilde O(\\varepsilon^{-3})$。该方法利用了最优传输平滑的贝尔曼备份，该备份具有闭式解和 Lipschitz Hessian，从而能够以更少的模拟器调用更有效地估计状态值。 AI

影响这项研究可能带来更高效的 AI 规划算法，降低复杂任务的计算成本。

排序理由该集群包含一篇详细介绍新颖算法及其理论改进的研究论文。[lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv cs.AI 阅读 →

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

本文如何被排名

Signal score: 13 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该集群包含一篇详细介绍新颖算法及其理论改进的研究论文。[lever_c_demoted from research: ic=1 ai=1.0]
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: High; Clearly on-topic for AI-industry coverage.
Story freshness: Breaking (< 6h); Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

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

报道来源 [1]

arXiv cs.AI TIER_1 English(EN) · Tuan Dam · 2026-09-10 04:00

具有最优传输贝尔曼平滑的二阶光滑规划

arXiv:2609.06484v1 Announce Type: cross Abstract: Planning with a generative model aims to estimate the value of a state using as few simulator calls as possible. SmoothCruiser achieves problem-independent complexity $\widetilde O(\varepsilon^{-4})$ by exploiting the smoothness o…

本文如何被排名

报道来源 [1]

具有最优传输贝尔曼平滑的二阶光滑规划

相关实体

相关话题