跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.19660 · v1

PSK: A Matrix-Free Single-Loop Method for K-Level Physics-Based Control

首次提交 2026-11-15 07:09
版本更新 2026-11-15 07:09
雷达观测 2026-11-17 12:06
arXiv ↗PDF ↗

摘要

Physics-based control is central to robot learning, but differentiating through implicit physics steps typically requires Hessian or Karush--Kuhn--Tucker (KKT) linear solves; we ask whether gradient steps suffice. Each simulation step minimizes an energy under many contact and collision constraints. Without constraints, we view control over KK steps as KK-level optimization with strongly convex lower levels, recast as one min--max problem. Our Penalized Single-loop KK-level method (PSK) uses only gradients and a projection, updates all levels in parallel, and reaches an εε-stationary control in O(ε−3)O(ε^{-3}) iterations, with a KK-independent exponent but a KK-dependent constant. Contact-rich constraints, however, typically violate a constraint qualification (CQ). We replace each constraint by a smooth wall that acts on a band of constant width. Under mild assumptions that need no CQ, every exact solution of the banded lower levels is then feasible and banded Fritz--John, and PSK keeps the O(ε−3)O(ε^{-3}) complexity. Without a CQ that is uniform in the band width, however, a shrinking band loses the KK-independent exponent: with width εε and fixed K≥2K\geq2, deterministic zero-respecting methods need Ω(ε−(K+3)/4)Ω(ε^{-(K+3)/4}) calls on a hard instance whose control dimension grows with 1/ε1/ε. We prove our assumptions for smoothed kinematic and dynamic multi-robot navigation among segment obstacles. In navigation experiments, PSK, tuned per case, reaches every goal with sixteen levels and, at equal time, reaches a lower loss than tuned unrolling in 17 of 18 cases, while implicit differentiation is lower in 10.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-15 07:09 · 最新观测版本

PSK: A Matrix-Free Single-Loop Method for K-Level Physics-Based Control

Physics-based control is central to robot learning, but differentiating through implicit physics steps typically requires Hessian or Karush--Kuhn--Tucker (KKT) linear solves; we ask whether gradient steps suffice. Each simulation step minimizes an energy under many contact and collision constraints. Without constraints, we view control over KK steps as KK-level optimization with strongly convex lower levels, recast as one min--max problem. Our Penalized Single-loop KK-level method (PSK) uses only gradients and a projection, updates all levels in parallel, and reaches an εε-stationary control in O(ε−3)O(ε^{-3}) iterations, with a KK-independent exponent but a KK-dependent constant. Contact-rich constraints, however, typically violate a constraint qualification (CQ). We replace each constraint by a smooth wall that acts on a band of constant width. Under mild assumptions that need no CQ, every exact solution of the banded lower levels is then feasible and banded Fritz--John, and PSK keeps the O(ε−3)O(ε^{-3}) complexity. Without a CQ that is uniform in the band width, however, a shrinking band loses the KK-independent exponent: with width εε and fixed K≥2K\geq2, deterministic zero-respecting methods need Ω(ε−(K+3)/4)Ω(ε^{-(K+3)/4}) calls on a hard instance whose control dimension grows with 1/ε1/ε. We prove our assumptions for smoothed kinematic and dynamic multi-robot navigation among segment obstacles. In navigation experiments, PSK, tuned per case, reaches every goal with sixteen levels and, at equal time, reaches a lower loss than tuned unrolling in 17 of 18 cases, while implicit differentiation is lower in 10.

查看此版本解读 →查看此版本原文 ↗