提出可微分的iLQR框架,实现高效精确的梯度计算。
DiLQR: Differentiable Iterative Linear Quadratic Regulator via Implicit Differentiation
- 基于隐式微分解析求解iLQR梯度,避免迭代开销。
- 相比自动微分最高提速128倍,学习性能提升10^6倍。
- 支持视觉输入的端到端控制,适合高维任务建模。
尽管可微控制结合了无模型灵活性与模型化效率,但迭代线性二次调节器(iLQR)作为可微组件仍研究不足。通过扩展迭代与时间步长进行微分面临显著可扩展性挑战,限制了iLQR作为有效可微控制器的应用。本文提出DiLQR,一种实现iLQR可微化的框架,使其可作为可训练模块嵌入神经网络。该框架的核心是利用隐式微分获得iLQR控制器梯度的解析解,确保反向传播成本恒定且梯度准确。我们在经典控制基准上评估了该方法在模仿学习任务中的表现。与自动微分相比,我们的解析方法在计算上表现出色,最高提速达128倍,最低也达21倍;学习性能相比传统神经网络策略提升10^6倍;在使用缺乏精确解析梯度的可微控制器时,模型损失更低。此外,我们将该模块集成到包含视觉输入的更大网络中,验证了其在高维、全端到端任务中的能力。代码可在项目主页 https://sites.google.com/view/dilqr/ 获取。
原文摘要 · Abstract (English)
While differentiable control has emerged as a powerful paradigm combining model-free flexibility with model-based efficiency, the iterative Linear Quadratic Regulator (iLQR) remains underexplored as a differentiable component. The scalability of differentiating through extended iterations and horizons poses significant challenges, hindering iLQR from being an effective differentiable controller. This paper introduces DiLQR, a framework that facilitates differentiation through iLQR, allowing it to serve as a trainable and differentiable module, either as or within a neural network. A novel aspect of this framework is the analytical solution that it provides for the gradient of an iLQR controller through implicit differentiation, which ensures a constant backward cost regardless of iteration, while producing an accurate gradient. We evaluate our framework on imitation tasks on famous control benchmarks. Our analytical method demonstrates superior computational performance, achieving up to 128x speedup and a minimum of 21x speedup compared to automatic differentiation. Our method also demonstrates superior learning performance ($10^6$x) compared to traditional neural network policies and better model loss with differentiable controllers that lack exact analytical gradients. Furthermore, we integrate our module into a larger network with visual inputs to demonstrate the capacity of our method for high-dimensional, fully end-to-end tasks. Codes can be found on the project homepage https://sites.google.com/view/dilqr/.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。