AI & ML
Finite sample guarantees of MPPI: suboptimality, sample complexity and closed-loop guarantees
arXiv eess.SY0 views
arXiv:2611.22142v1 Announce Type: cross Abstract: This paper considers model predictive path integral (MPPI) control for nonlinear finite-horizon optimal control problems with bounded inputs, allowing nonconvex and nonsmooth costs. We prove theoretical guarantees that quantify the suboptimality caused by positive temperature and finite sampling on MPPI and establish their implications for closed-loop guarantees. Specifically, we derive a suboptimality bound for infinite-sample MPPI that characterizes the effects of temperature and prior coverage, followed by a high-probability finite-sample approximation error bound that reveals the dependence on sample size, temperature, and cost variability. By incorporating these bounds into a terminal-constraint-free MPC framework, we further establish semi-global practical recurrence of the closed-loop system. Numerical examples involving a four-link planar manipulator illustrate the temperature-sampling tradeoff and the influence of prior quality on approximation accuracy and closed-loop performance.
Source:https://arxiv.org/abs/2611.22142PreviousCRA: Continuous Risk Assessment for Safety-critical Visual NavigationNextWhen does deep reinforcement learning pay off in HVAC supervisory control? Four small Modelica case studies trained directly on FMUs
Related posts

‘It’s a risk’: How Rockstar built the most detailed (and romantic) GTA yet
0The Verge
China dominates battery graphite, but this startup could break the monopoly
0TechCrunch
AI visibility: mentions, recommendations and citations need separate checks
0dev.to
Background AI Makes Inference a Scheduling Problem
0dev.to

DeepSeek vs Claude vs Kimi vs Codex vs Gemini: A 70-Call AI Ethics Test
0dev.to
Fluent English is not evidence of ASL understanding: lessons from building a video translator
0dev.to