Residual-Driven Basis and Data Selection for Polynomial Approximation of High-Dimensional Hamilton-Jacobi-Bellman Equations
We develop greedy strategies for selecting global polynomial basis functions and training data in the sparse approximation of high-dimensional partial differential equations, with emphasis on Hamilton-Jacobi-Bellman (HJB) equations arising in nonlinear optimal control. Inspired by the goal-oriented dual-weighted residual framework, we derive a closed-form, mesh-free indicator that predicts, to first order, the reduction of the PDE residual obtained by adding a single candidate basis function, without solving an adjoint problem. In the data-driven regime, we jointly select basis functions and gradient-augmented training samples by maximizing the predicted decrease of a supervised loss. Numerical experiments on benchmark PDEs and nonlinear optimal control problems in up to 35 dimensions show accuracy comparable to non-adaptive approaches with substantially fewer basis functions and training samples.
Authors
- Dante Kalise B (ORCID: https://orcid.org/0000-0003-2327-1957)
- Yuyang Huang
- Yuhua Zhu
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-17
- DOI
- https://doi.org/10.48550/arxiv.2611.22979
- Primary Topic
- Model Reduction and Neural Networks
- Type
- preprint