Sparsifying Dimensionality Reduction of PDE Solution Data with Bregman Learning

Source abstract

Abstract. Classical model reduction techniques project the governing equations onto a linear subspace of the original state space. More recent data-driven techniques use neural networks to enable nonlinear projections. While those often enable stronger compression, they may have redundant parameters and lead to suboptimal latent dimensionality. To overcome these issues, we propose a multistep algorithm that induces sparsity in the encoder-decoder networks for effective reduction in the number of parameters and additional compression of the latent space. This algorithm starts with sparsely initializing a network and training it using linearized Bregman iterations. These iterations have been very successful in computer vision and compressed sensing tasks, but have not yet been used for reduced-order modeling. After the training, we further compress the latent space dimensionality by using a form of proper orthogonal decomposition. Last, we use a bias propagation technique to change the induced sparsity into an effective reduction of parameters. We apply this algorithm to three representative PDE models: 1D diffusion, 1D advection, and 2D reaction-diffusion. Compared to conventional training methods like Adam, the proposed method achieves similar accuracy with 30% fewer parameters and a significantly smaller latent space. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/TJHeeringa/bregman-pde-dimensionality-reduction/tree/v1.0.0 and in the supplementary materials ( bregman-pde-dimensionality-reduction-1.0.0.zip [2.39MB]). [Formula: see text]