Separating Artificial-Viscosity Annealing from the L-BFGS Viscosity in Physics-Informed Neural Networks for Two-Phase Flow
Physics-informed neural networks (PINNs) remain difficult to train for hyperbolic conservation laws. Artificial viscosity is a common remedy, and several methods reduce its coefficient during training. We examine adaptive moment estimation (Adam) followed by limited-memory Broyden–Fletcher–Goldfarb–Shanno (L-BFGS) optimisation. The schedule followed during Adam, the viscosity used during L-BFGS, and the checkpoint supplied between them can change together. We separate these factors for the one-dimensional Buckley–Leverett equation using a fixed multilayer perceptron with hyperbolic-tangent activations and 15 paired seeds per configuration. The central experiments impose a zero-diffusive-flux outlet condition. Lowering the L-BFGS viscosity from 3.5×10−3 to 1.67×10−4 increased full-grid relative L2 error by 0.0413±0.0069. The schedule–viscosity interaction was −0.0067±0.0075 and was not detected after multiplicity adjustment. A decay ending at 3.5×10−3 improved on the tested low-endpoint decay before high-viscosity polishing, while its difference from constant high viscosity remained inconclusive. The higher of the two tested constant viscosities improved aggregate and pre-breakthrough accuracy but increased post-breakthrough error. Stage-matched curricula showed no detected accuracy advantage; their greater executed cost arose from intermediate diagnostic L-BFGS phases whose states were discarded. These results identify the terminal viscosity, checkpoint rule, outlet treatment, and optimiser exposure as controls needed to interpret schedule comparisons in this pipeline.
Authors
- Timur Imankulov (ORCID: https://orcid.org/0000-0002-8865-3676)
- Samson Dawit Bekele (ORCID: https://orcid.org/0009-0005-9719-4343)
- Saltanbek Talapedenovich MUKHAMBETZHANOV (ORCID: https://orcid.org/0000-0003-1335-7319)
- Saida Tastanova (ORCID: https://orcid.org/0000-0001-5948-8205)
- Yerzhan Kenzhebek (ORCID: https://orcid.org/0000-0002-6492-8292)
- Dagmawi Lemma (ORCID: https://orcid.org/0000-0002-1647-5188)
Institutions
- Al-Farabi Kazakh National University (KZ)
- Tashkent University of Information Technology (UZ)
- Addis Ababa University (ET)
Publication Details
- Journal
- Big Data and Cognitive Computing
- Published
- 2026-10-07
- DOI
- https://doi.org/10.3390/bdcc10100342
- Primary Topic
- Model Reduction and Neural Networks
- Type
- article
- Field-Weighted Citation Impact
- 0.00