High-order Regularization for Machine Learning and Learning-based Control
Xinghua Liu, Ming Cao

TL;DR
This paper introduces a high-order regularization method for neural networks that improves convergence, interpretability, and generalization, with theoretical guarantees and practical validation in reinforcement learning control tasks.
Contribution
The paper presents a novel high-order regularization technique that connects regularization with approximation theory, ensuring convergence and enhancing neural network interpretability and generalization.
Findings
Proves convergence and error bounds for the HR method.
Shows HR improves neural network generalizability.
Demonstrates superior performance in reinforcement learning control.
Abstract
The paper proposes a novel regularization procedure for machine learning. The proposed high-order regularization (HR) provides new insight into regularization, which is widely used to train a neural network that can be utilized to approximate the action-value function in general reinforcement learning problems. The proposed HR method ensures the provable convergence of the approximation algorithm, which makes the much-needed connection between regularization and explainable learning using neural networks. The proposed HR method theoretically demonstrates that regularization can be regarded as an approximation in terms of inverse mapping with explicitly calculable approximation error, and the regularization is a lower-order case of the proposed method. We provide lower and upper bounds for the error of the proposed HR solution, which helps build a reliable model. We also find that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
