Model-Based Control with Sparse Neural Dynamics

Learning predictive models from observations using deep neural networks (DNNs) is a promising new approach to many real-world planning and control problems. However, common DNNs are too unstructured for effective planning, and current control methods typically rely on extensive sampling or local gradient descent. In this paper, we propose a new framework for integrated model learning and predictive control that is amenable to efficient optimization algorithms. Specifically, we start with a ReLU neural model of the system dynamics and, with minimal losses in prediction accuracy, we gradually sparsify it by removing redundant neurons. This discrete sparsification process is approximated as a continuous problem, enabling an end-to-end optimization of both the model architecture and the weight parameters. The sparsified model is subsequently used by a mixed-integer predictive controller, which represents the neuron activations as binary variables and employs efficient branch-and-bound algorithms. Our framework is applicable to a wide variety of DNNs, from simple multilayer perceptrons to complex graph neural dynamics. It can efficiently handle tasks involving complicated contact dynamics, such as object pushing, compositional object sorting, and manipulation of deformable objects. Numerical and hardware experiments show that, despite the aggressive sparsification, our framework can deliver better closed-loop performance than existing state-of-the-art methods.

Paper

References (75)

Scroll for more · 38 remaining

Similar papers

Peer review

Reviewer LeuW5/10 · confidence 3/52023-07-03

Summary

This paper proposes a method for pruning neural networks with ReLu activation functions during training. When employed for learning the dynamics of a control system, this often leads to networks with few activation functions performing similarly as large networks. This allows to apply mixed integer programming techniques to determine optimal control policies. The effectiveness of this approach is demonstrated in a comparison with a sampling based optimizer on several tasks for a robotic manipulator.

Strengths

The idea of formulating planning problems with neural network dynamics as mixed integer program seems novel to me. Moreover, I find the proposed approach of reducing the number of neurons during training very interesting, but I cannot comment on its novelty since I am no expert on this topic. Overall, the paper reads very well and has a good structure. The nice demonstration of the proposed method in a real-world robotic experiment is also a strength of the paper.

Weaknesses

My biggest concern is the missing discussion of computational complexity/computation time. I am not an expert on mixed integer programming, but a quick search suggests that even mixed integer linear programming is already NP hard, so this seems to be a problem in general. I understand that this problem can be mitigated through a sufficiently small number of neurons (‘If only a few ReLUs are left in the model, Equation 10 can be efficiently solved to global optimality’), but I am missing a clear specification what sufficient means in this context. Moreover, I would expect it to be connected to the prediction horizon, i.e., the number of time steps considered in the sum in (10). Therefore, I think a complexity (e.g., in O notation) should be provided to give the reader an impression how severe the computation times grows. This weakness also limits the usefulness of the evaluation in my opinion. Why would you reduce the number of neurons for MPPI in practice? I think the performance in relation to computation time is rather the important metric to look at for this comparison, i.e., a complexity-performance trade-off comparison would be essential. Therefore, the comparison seems a little unfair at the moment. This similarly extends to the robot experiment in Sec. 4.3, where the sampling and the horizon rate of the MPC are not specified. Moreover, it is not clear how fast the robot moves. These are all parameters which crucially influence how challenging the problem is. In general, the method seems tailored to piece-wise affine systems or systems that look almost like that. The examples seem to go into this direction, but I cannot say for sure since I could not find information what dynamics are actually learned in the robotic examples. I think it would be interesting to see how many activation functions are needed for accurately learning highly nonlinear dynamics, e.g., cart-pole swing-up, and how this affects the control performance. Overall, the novelty seems to be mainly the (straightforward) connection of existing ideas, even though I admit that it is a very clever combination. The proposed reduction of neurons is not even targeted to achieve a high control performance, but only to maintain high model accuracy. High control performance is only addressed a posteori by selecting the best model observed in experiments. Doing it as described in lines 206-208 runs the risk of executing a potentially bad controller on a real system. This seems like a dangerous thing to generally do. I think it would be much more interesting to directly optimize the model for achieving the best control performance. Finally, I find the comparison in the numerical evaluation a little weak. When no experiment has to be done like for the open-loop planning performance evaluation, I think more methods than only MPPI should be investigated. I am not an expert, but I know there exists more than one planning/control method for nonlinear systems, e.g., MPC with NN dynamics (Salzmann et al., 2023). Moreover, I do not understand why the learned dynamics model is not used as environment for the classical RL methods. It is apparently accurate enough to allow for a direct transfer to a real-world experiment. So why are the interactions limited to a relatively small number with the real environment, when a large number of interactions with a potentially only slightly more inaccurate model are available? T. Salzmann, E. Kaufmann, J. Arrizabalaga, M. Pavone, D. Scaramuzza and M. Ryll, "Real-Time Neural MPC: Deep Learning Model Predictive Control for Quadrotors and Agile Robotic Platforms," in IEEE Robotics and Automation Letters, vol. 8, no. 4, pp. 2397-2404, April 2023

Questions

What is the point of the regularization in (9) if you bound the total number of ReLu activation functions through $\epsilon$ in (5) anyways? What is a closed-loop planning performance? Or do you mean closed-loop control performance? In (8), is $z_{ij}$ the approximation of $\pi_{ij}$?

Rating

5: Borderline accept: Technically solid paper where reasons to accept outweigh reasons to reject, e.g., limited evaluation. Please use sparingly.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

2 fair

Presentation

3 good

Contribution

2 fair

Limitations

Potential negative societal impact is not mentioned in the paper. Some limitations of the proposed approach (e.g., restriction to ReLu activation functions) are mentioned throughout the paper, but there is no dedicated paragraph about limitations. I think there are some limitations (e.g., computational complexity) that should be added.

Authorsrebuttal2023-08-10

Additional Author Responses to Reviewer LeuW

> Why would you reduce the number of neurons for MPPI in practice? In the closed-loop control results in Fig. 5, we aimed to demonstrate that our method achieves comparable or better performance with a highly sparsified model, compared to MPPI using a full, non-sparsified model (rightmost column of each plot). We included the results of MPPI with slightly sparsified models to illustrate how a slightly sparsified model affects closed-loop control performance using the same optimizer, and to visualize the trend that a sweet spot exists where a reasonably accurate model can benefit from more powerful optimization tools, leading to superior closed-loop control performance. > This similarly extends to the robot experiment in Sec. 4.3, where the sampling and the horizon rate of the MPC are not specified. In the Object Pushing, Object Sorting, and Rope Manipulation tasks, we empirically find that using a horizon of one and re-optimizing at each step based on environmental feedback was sufficient to successfully complete a variety of tasks. > it is not clear how fast the robot moves We provided videos of our method controlling a real robot performing the tasks in the supplementary video. Since each action is standalone, there is no additional feedback from the environment while an action is being executed, so the speed of the robot does not affect the task completion. > it would be interesting to see how many activation functions are needed for accurately learning highly nonlinear dynamics, e.g., cart-pole swing-up, and how this affects the control performance We showed in Fig. 3a how the number of remaining ReLUs affects open-loop prediction accuracy of the learned dynamics model. For example, in Object Pushing, a model with 0 ReLUs (linear) failed drastically, while a model with 8 ReLUs was still reasonably accurate. In the Reacher-v4 environment, we observe a gap where all models with 16 ReLUs or less fail significantly. In the Cartpole-v1 environment with simpler dynamics, neural dynamics models sparsified down to 1 or 2 ReLUs can still have reasonable performance, but when sparsifying down to 0 ReLUs (linear), we observe a significant drop in both prediction accuracy and closed-loop control performance. Below we show the results on the closed-loop control performance of models sparsified to different numbers of ReLUs remaining on the Reacher-v4 environment. | Num. ReLUs | 48 | 32 | 24 | 16 | 8 | 2 | |:----------:|:-------:|:-------:|:--------:|:--------:|:--------:|:--------:| | RMSE | 0.053467 | 0.064591 | 0.064659 | 0.113871 | 0.153998 | 0.170154 | While the control performance gracefully degrades with the number of ReLUs in the beginning when the number of ReLUs is still sufficient to learn a reasonably accurate model, we start to observe significantly worse control performance once the number of ReLUs becomes insufficient to represent the complex dynamics of the system. > What is the point of the regularization in (9) if you bound the total number of ReLu activation functions through $\epsilon$ in (5) anyways? We indeed use $\epsilon$ as a cap on the number of ReLUs. The regularization term in (9) aims to discourage unnecessary use of ReLU and identity mappings so that the gradient-based optimization favors a model architecture that is more likely to perform well after we sparsify the model to fewer ReLUs in the next round. For example, we start with a full model of 512 ReLUs in the first iteration, and aim to sparsify down to 64 ReLUs after the first iteration. Because of the redundancy in neural networks, the model can likely achieve similar performance with all 512 ReLU activations, or with fewer ReLUs. If the model chooses to have 512 or significantly more than 64 ReLUs in the first iteration, then after we prune the network down to 64 ReLUs for the next iteration, this drastic change in modeling capacity could lead to noticeably larger decrease in prediction accuracy. >What is a closed-loop planning performance? Or do you mean closed-loop control performance? Yes, we apologize for the confusion. >In (8), is $z_{ij}$ the approximation of $\pi_{ij}$? Yes, $z_{ij}$ is the continuous softmax approximation of the discrete probability distribution $\pi_{ij}$. > I think there are some limitations (e.g., computational complexity) that should be added. Please refer to the global rebuttal response for discussions of limitations of our work. **Have these responses addressed the reviewer’s concerns? We look forward to continuing the discussion.**

Reviewer LeuW2023-08-14

Thank you for this detailed response. I appreciate the additional simulations and think they would significantly improve the paper. In particular, the usage of MIP indeed seems to provide a slight advantage to every other method. Despite these changes, one of my major concerns still remains: It is not clear how other methods perform when comparing them for the same computation time. This cannot be resolved by using the number of remaining neurons as an approximate measure for this since the methods' computation time depends differently on the number of neurons. Therefore, a plot showing computation time over performance is critical to demonstrate the advantages of the proposed method for closed-loop control, where the computation time defines the achievable sampling rate. Therefore, I currently do not intend to change my scores. Follow-up question: "Since each action is standalone, there is no additional feedback from the environment while an action is being executed" $\rightarrow$ Does this mean you only use the model and MIP optimization to plan a trajectory? If so, this should be stated more clearly.

Authorsrebuttal2023-08-18

Additional Experiment Results Requested by Reviewer LeuW

Thank you for the follow up questions! We provide the experiment results requested and our response below. > a plot showing computation time over performance is critical to demonstrate the advantages of the proposed method for closed-loop control This is a great point. Following your suggestion, **we conducted additional experiments examining the tradeoff between** ***computation time*** **and** ***closed-loop control performance*** using the Reacher-v4 environment. We are unfortunately unable to submit plots in the discussion stage, so we present the results in the tables below. The first row of each table denotes the mean computation time in seconds, and the second row denotes the closed-loop control performance measured by RMSE. The first table contains results using our method (MIP), and the second table contains results using MPPI. Both methods achieved better closed-loop control performance when given more time to compute. **Our method (MIP) improved significantly in closed-loop control performance with more computation time**, leading to an superior RMSE of 0.04795 with 0.09716 seconds of computation. On the contrary, **the performance of MPPI plateaued with more computation time** and achieved an RMSE of 0.06572 with 0.100086 seconds of computation. **MIP (Ours), 48 ReLUs** | | | | | | | |--|--|--|--|--|--| | Time (s) | 0.01198 | 0.02257 | 0.04903 | 0.08007 | **0.09716** | | RMSE | 0.20975 | 0.19609 | 0.17762 | 0.06916 | **0.04795** | **MPPI, 192 ReLUs** | | | | | | | |--|--|--|--|--|--| | Time (s) | 0.00791 | 0.01822 | 0.04686 | 0.08284 | 0.100086 | | RMSE | 0.09273 | 0.07185 | 0.06868 | 0.06693 | 0.06572 | **This comparison further supports that our method, using a sparsified dynamics model, can benefit from more powerful optimization tools, and lead to superior closed-loop control performance under the same computation time compared to MPPI using a full dynamics model.** > "Since each action is standalone…" Does this mean you only use the model and MIP optimization to plan a trajectory? If so, this should be stated more clearly. **Our method performs closed-loop control by incorporating environment feedback between actions, but not during an action execution.** For example, in the Object Sorting tasks, after a push action has been completed, we use the new environment state observed to optimize for the next action, but we do not account for environment feedback while the robot is executing a single push action from start to end. We apologize for the confusion. We hope that our additional experiments and responses addressed the reviewer’s questions and concerns. **We would be happy to continue the discussion if the reviewer has additional questions or concerns.**

Reviewer LeuW2023-08-20

Thank you for these clarifications and the additional simulation results. I believe these results will definitely improve the paper and recommend including them in the main paper. As these results show that the method offers clear advantages in scenarios, where a comparatively large time for the computation of control inputs is available, I suggest indicating this in the paper. Due to these additional results, I have updated my score.

Reviewer fLUK5/10 · confidence 3/52023-07-06

Summary

This paper proposes a new framework for model-based control. The approach focuses on learning a sparse deep neural network and using a mixed-integer program solver for closed-loop planning. Experimental results are presented on several tasks including object and rope manipulation tasks. The results show that the proposed approach improves performance over strong baselines.

Strengths

- The framework proposed in this paper elegantly combines concepts from deep neural network (DNN) pruning and mixed integer programming (MIP) into a solution for model-based control. - The specific technique for sparsifying a DNN by removing non-linearities rather than simply dropping nodes intuitively matches the goals of eventually using the model with a MIP solver. - The experiments demonstrate that the approach is effective in both simulation and in the real-world on real hardware -- providing strong evidence that this is a generally applicable approach. - The technique is demonstrated with both MLP and GNN based models, showing the versatility of the proposed approach. - The supplemental video presents strong qualitative evidence supporting the efficacy of the approach on real-robots. - The paper is very well written.

Weaknesses

- It is unclear if the performance gains in Figure 5 are significant. On the Object Pushing and Rope Manipulation tasks MIP does not appear to outperform MPPI. And the improvements of MIP on the Object Sorting tasks appear to be within the error bars. - A key ablation is missing. One of the main claims in this work is that the proposed sparsification technique, which focuses on removing nonlinearities rather than neurons, improves performance. Only a partial ablation in support of this claim is provided in the appendix A2. Specifically, A2 shows that the proposed approach leads to lower prediction error. However, to quote L277-279 in the main paper, “what we really care about is the performance when executing optimized plans in the original simulator or the real world. Therefore, it is crucial to evaluate the effectiveness of these models within a closed-loop control framework.” I agree. Thus, it is similarly crucial to perform this ablation in a closed-loop setting.

Questions

I am willing to adjust my rating if these questions can be answered: - Please comment further on the results in Figure 5; there is a trend but why is this a significant advance? - Does the proposed sparsification technique improve closed-loop performance? - What are the limitations of the work?

Rating

5: Borderline accept: Technically solid paper where reasons to accept outweigh reasons to reject, e.g., limited evaluation. Please use sparingly.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

2 fair

Presentation

4 excellent

Contribution

4 excellent

Limitations

No, the paper does not discuss limitations.

Authorsrebuttal2023-08-18

Are there any additional questions or concerns?

We hope that our additional experiments following the reviewer’s suggestions, discussion of limitations, and responses addressed the questions and concerns raised. **We would be happy to continue the discussion if the reviewer has additional questions or concerns.**

Reviewer fLUK2023-08-19

Questions resolved

Thank you for the detailed response. The closed-loop performance is encouraging and I believe it will strengthen the paper. Additionally, I appreciate the discussion of limitations in the main response. I do not have any remaining questions and I have updated my score.

Reviewer H7kE6/10 · confidence 4/52023-07-06

Summary

This paper proposes a framework for model-based planning with forward dynamics represented as sparse neural networks. The paper examines different ways of inducing sparsity in MLP and GNN based forward models, and performs real robot manipulation experiments investigating the tradeoffs with sparsity and performance.

Strengths

- the paper targets an interesting problem of learning efficient world models for control, by reducing optimization costs in learning the forward model. The specific approach of investigating how sparsity can enable this efficient learning of the forward model for real robot manipulation scenarios, is novel in my understanding. - the paper is easy to follow, with detailed descriptions of the different ways of inducing sparsity, and the different architectures. The research questions investigated are well formulated, and adequately addressed in the experiments - the experiments are on interesting real robot manipulation tasks like object sorting, and rope manipulation, so the findings are amenable to be deployed in real world control scenarios.

Weaknesses

- the main weakness of the paper is that there aren't comparisons to prior model-based RL approaches, e.g. PETS, Dreamer, MBPO etc (https://arxiv.org/abs/1805.12114,https://arxiv.org/abs/1912.01603, https://arxiv.org/abs/1906.08253) . If it is difficult to compare them on hardware experiments, there should be comparisons done on simulated robot control tasks. - it is unclear how general are the findings in terms of being applied to different model-based control frameworks. There should be a disucssion (and possibly experiments) about if we can take any prior model-based RL algorithm and replace the forward model with a sparse neural network, and see benefits under certain assumptions - if not, then a discussion of what exactly are the requirements on how the model should be learning and how a policy (or plan) should be learned is needed. - the experiments results in my understanding are on low-dimensional states instead of images. Is there a reason for not evaluating with image observations? Encoding image observations into latent states, and then doing policy learning is a common practice in the community now - so it will be helpful to have a discussion regarding this.

Questions

Please refer to my list of weaknesses above. In summary - comparisons to prior MBRL approaches? - discussion about generality of the findings? - feasibility of experiments with image observations?

Rating

6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.

Confidence

4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.

Soundness

3 good

Presentation

3 good

Contribution

3 good

Limitations

The limitations are a bit unclear at the moment (also refer to my list of weaknesses). It will be helpful to provide a detailed discussion of the limitations and generality of the findings.

Reviewer h4y25/10 · confidence 3/52023-07-08

Summary

This paper focused on the combination of predictive control and model learning. An autogressive dynamic model based on a ReLU neural network is first learned over the observation space. The authors then aimed to sparsify it after introducing the indicator mapping function. To make the optimization feasible, the Gumbel-Softmax trick is applied to replace the greedy operation. Once the sparse dynamic is learned, mixed-integer programming solvers are used to obtain the control policy. Finally, the authors validated the proposed method across a few tasks and showed its promising performance.

Strengths

1. The proposed framework of sparse neural dynamics in predictive control looks interesting. The use of Gumbel-Softmax to reparameterizing the original discrte optimization makes the gradient based methods feasible, and is indeed a reasonable idea. 2. The optimization for the control part is more efficient, compared with the gradient based methods, which constitutes another contribution of this paper.

Weaknesses

Regarding the experimental comparison, it would be more convincing if the authors can test on commonly used reinforcement learning benchmarks. The only comparison regarding control policy is from Figure 3 (b) and it only involves different optimization solvers. The current results would leave the impression that the proposed method may overfit on these tasks only.

Questions

1. What's the complexity of applying MIP? 2. What's the underlying architecture for the ReLu neural network? It would be a bit surprising if a feedforward neural network can capture the features from image inputs.

Rating

5: Borderline accept: Technically solid paper where reasons to accept outweigh reasons to reject, e.g., limited evaluation. Please use sparingly.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

3 good

Presentation

2 fair

Contribution

2 fair

Limitations

Yes

Reviewer H7kE2023-08-17

response to rebuttal

Dear authors, Thanks for the response and the additional experiments. The comparison to model-based baselines provided is helpful. I am still not convinced by the applicability to image based observations, which is important in order to be able to tackle more realistic tasks with less assumptions on the observed states. However, I am still leaning towards accept for the paper, as my other two concerns have been partially resolved.

Authorsrebuttal2023-08-18

Are there any additional questions or concerns?

We hope that our additional experiments following the reviewer’s suggestions, discussion of limitations, and responses addressed the questions and concerns raised. **We would be happy to continue the discussion if the reviewer has additional questions or concerns.**

Reviewer h4y22023-08-19

Thanks to the authors for addressing my concern and questions. Regarding the additional experiments, could you also add (i) the accumulated rewards (ii) standard deviation, as in previous papers? After the authors' response, the strength of this submission is more clear to me. On the other hand, I also see the concern from the other reviewers on the experimental significance and extension to other complex domain, which seems a bit challenging given the current status.

Authorsrebuttal2023-08-19

Thank you for the follow-up questions! We are glad to hear that our response addressed your concerns and questions. We respond to the additional questions below. > could you also add (i) the accumulated rewards (ii) standard deviation, as in previous papers? In Figure 1 of the Rebuttal PDF, we included the performance comparison of our approach against prior methods measured by RMSE, which in our setting is the additive inverse of the episode return averaged over steps. We included the interquartile range, minimum, and maximum as part of the box plot. These results further demonstrate that our approach achieved superior closed-loop control performance with sparsified dynamics models compared to prior works using full dynamics models. > I also see the concern from the other reviewers on the experimental significance and extension to other complex domain… We hope to highlight that **our approach achieved superior closed-loop control performance on the Object Sorting, Object Pushing, Cartpole, and Reacher tasks using highly sparsified neural dynamics models with fewer ReLUs, compared to model-free RL and prior methods using full dynamics models.** Only on the Rope Manipulation task, MIP (ours) achieves a similar performance to MPPI. The more significant gap in model prediction error between the full dynamics model and highly sparsified models limits the performance upper bound in closed-loop control, even though our approach using sparsified models enabled us to leverage a more powerful optimization tool giving better results in open-loop optimization. Future improvements could involve the co-optimization of the model sparsification procedure with control synthesis. Enabling the sparsification process to be mindful of the subsequent control task may lead to even better performance. Regarding the potential of extending our method to other complex domains, we would like to emphasize that **our method is generic and applicable to a wide variety of dynamics models instantiated using ReLU networks, including but not limited to feed-forward neural networks and graph-neural networks with compositional architectures.** Our experiments also showed **competitive performance and combinatorial generalizability on a wide range of tasks involving rigid and deformable objects in scenarios ranging from single to multiple objects.** The experiments on the two OpenAI Gym environments further demonstrated the generalizability of our method. **We wish to again express our heartfelt thanks for your helpful feedback and suggestions that helped us improve our paper. We would be happy to continue the discussion if the reviewer has additional questions or concerns.**

Program Chairsdecision2023-09-21

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC