PINNACLE: PINN Adaptive ColLocation and Experimental points selection
Gregory Kang Ruey Lau, Apivich Hemachandra, See-Kiong Ng, Bryan, Kian Hsiang Low

TL;DR
PINNACLE is a novel algorithm that adaptively selects and optimizes all training point types in Physics-Informed Neural Networks, improving training efficiency and accuracy by considering interactions among points.
Contribution
It introduces the first joint optimization method for collocation and experimental point selection in PINNs, based on NTK analysis and adaptive adjustment during training.
Findings
PINNACLE outperforms existing point selection methods in various PINN tasks.
The method adaptively balances point types, leading to better training dynamics.
Theoretical analysis links PINNACLE's criterion to generalization error.
Abstract
Physics-Informed Neural Networks (PINNs), which incorporate PDEs as soft constraints, train with a composite loss function that contains multiple training point types: different types of collocation points chosen during training to enforce each PDE and initial/boundary conditions, and experimental points which are usually costly to obtain via experiments or simulations. Training PINNs using this loss function is challenging as it typically requires selecting large numbers of points of different types, each with different training dynamics. Unlike past works that focused on the selection of either collocation or experimental points, this work introduces PINN Adaptive ColLocation and Experimental points selection (PINNACLE), the first algorithm that jointly optimizes the selection of all training point types, while automatically adjusting the proportion of collocation point types as…
Peer Reviews
Decision·ICLR 2024 spotlight
The paper contains a substantial amount of mathematical proofs. The experimental results are excellent, and the algorithm exhibits significantly higher accuracy compared to other algorithms.
The algorithm seems straightforward, and the presentation can be more concise.
1. The theoretical results are interesting. The author connects the proposed convergence degree notion with the generalization error bound. and demonstrates how to approximate the optimal set for convergence degree. 2. The experimental results are great. Compared with other baselines, proposed methods introduce observable improvements.
1. For the K-MEANS++ method, the authors are encouraged to provide the time consumption comparison with other baselines. I am not sure if K-MENAS++ will introduce much extra computation cost. 2. For the K-MEANS++ method, the author claims that "this method select points with high convergence degrees". The authors are expected to provide more explanation why this method increase the convergence degree. It is the same for SAMPLING method. The authors are expected to explain how to "select a point
The choice of collocation points for PINNs is an important issue that has a significant impact on performance. In particular, this paper deals with collocation points in a unified way, independent of the type of loss functions associated with them. As far as I know, this is certainly a new approach and seems to be very promising. In addition, the newly introduced criterion is derived with a theoretical basis and is highly reliable. This is just my impression but I suppose that the theorem that
The strength of this paper seems to be that collocation points for initial boundary values and those for PDEs can be treated in a unified way, but a method of training networks without collocation points for initial boundary values is also proposed. When such a method is employed, the proposed method may lose a certain extent of significance.
Code & Models
Videos
Taxonomy
TopicsModel Reduction and Neural Networks · Neural Networks and Applications · Generative Adversarial Networks and Image Synthesis
