---
title: "CoRoPINN: Cognitive Region-Optimized PINNs for More Accurate PDE Solving"
id: "plos-one-20-coropinn-cognitive-region-optimized-physics-informed-neural-networks"
canonical_url: "https://medichelpline.com/clinical-feed/plos-one-20-coropinn-cognitive-region-optimized-physics-informed-neural-networks"
content_type: "clinical_feed_article"
specialty: "General"
source_name: "PLOS ONE (Medicine)"
source_url: "https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0358646"
published_at: "2026-09-21T14:00:00.000Z"
evidence_level: "Journal Feed"
license: "CC-BY-NC-4.0 / Informational Use"
---
# CoRoPINN: Cognitive Region-Optimized PINNs for More Accurate PDE Solving
## Provenance & Clinical Metadata
- **Canonical URL:** https://medichelpline.com/clinical-feed/plos-one-20-coropinn-cognitive-region-optimized-physics-informed-neural-networks
- **Specialty:** [General](https://medichelpline.com/clinical-feed/general.md)
- **Primary Source:** PLOS ONE (Medicine)
- **Source URL:** [Original Journal Publication](https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0358646)
- **Published At:** 2026-09-21T14:00:00.000Z
- **Evidence Rating:** Journal Feed
## Executive GIST (TL;DR)
- Partial differential equations (PDEs) are central to modeling in many fields but remain challenging to solve numerically, especially in high dimensions or with fine local structure. - **Physics-informed neural networks (PINNs)** embed PDE, initial, and boundary constraints as loss terms and offer a mesh-free alternative, but they typically enforce constraints only at discrete collocation points. - Two core limitations of standard PINNs are (1) pointwise constraints that under-supervise intervals between collocation points and (2) an Unbalanced Prediction Problem (UPP) where learning difficulty varies widely across the domain and uniform training overweights easy regions. - Region optimization (RoPINN) extends each collocation point to a continuous neighborhood and uses Monte Carlo sampling plus a trust-region calibration (based on gradient variance) to stabilize and regularize optimization. - Cognitive learning (CoPINN) applies a curriculum-style, difficulty-based dynamic weighting: early training emphasizes easier samples, mid-training balances weights, and late training shifts focus to harder samples. Difficulty is quantified by the PDE residual gradient norm. - CoRoPINN integrates region optimization and cognitive learning in a closed feedback loop: a globally calibrated stable radius and samplewise residual difficulty jointly determine point-specific neighborhoods and evolving cognitive weights. - The method applies Monte Carlo approximation to region integrals, dual radius updates (global trust-region then local adaptation), and difficulty-driven weight allocation to progressively shift optimization from easy to difficult regions. - Benchmarks: CoRoPINN was evaluated on three 1D PDEs across five backbone architectures, Poisson equations in 2D/3D/5D, and Burgers2D. It attained the lowest geometric-mean relative mean absolute error (rMAE) across the five backbones on all three 1D benchmarks and reduced aggregate error versus the second-best by 21.0%, 61.6%, and 52.9% on 1D-Reaction, 1D-Wave, and Convection respectively. - CoRoPINN ranked first in both metrics for 2D and 5D Poisson, second in 3D Poisson, and achieved the lowest rMAE and rMSE among four methods on Burgers2D. These results indicate an overall accuracy advantage for CoRoPINN in the evaluated settings. - Datasets are available at the reported GitHub repositories; funding sources and competing interests were declared in the source.
## Clinical Analysis & Structured Key Points
CoRoPINN: Cognitive region optimized physics-informed neural networks | PLOS One Browse Subject Areas ? Click through the PLOS taxonomy to find articles in your field. For more information about PLOS Subject Areas, click here . Article Authors Metrics Comments Media Coverage Reader Comments Figures Figures Abstract The solution of partial differential equations (PDEs) remains a significant problem in scientific computing. Although physics-informed neural networks (PINNs) provide a mesh-free paradigm, pointwise constraints offer limited supervision between collocation points and uniform training can under-resolve regions with greater learning difficulty. To address these coupled limitations, this paper introduces Co gnitive R egion O ptimized P hysics- I nformed N eural N etworks (CoRoPINN). Rather than treating region optimization and cognitive learning as independent additions, CoRoPINN forms a closed feedback loop. Gradient-stability statistics calibrate a globally stable baseline radius, PDE residuals estimate pointwise learning difficulty, and the same difficulty signal jointly adjusts sample-specific neighborhoods and cognitive weights. This coupling expands continuous physical constraints around under-resolved collocation points while progressively reallocating optimization from easier to more difficult regions. We evaluate CoRoPINN on three one-dimensional PDEs with five backbone architectures, Poisson equations in two, three, and five dimensions, and Burgers2D. Across the five backbones, CoRoPINN achieves the lowest geometric-mean relative mean absolute error (rMAE) on all three one-dimensional benchmarks, reducing the aggregate error relative to the second-best method by 21.0%, 61.6%, and 52.9% on 1D-Reaction, 1D-Wave, and Convection, respectively. It also ranks first in both metrics for 2D and 5D Poisson, remains second in 3D, and attains the lowest rMAE and relative root mean square error (rMSE) among all four methods on Burgers2D. These results establish a clear overall accuracy advantage for CoRoPINN among the evaluated baselines. Citation: Li J, Liao Y, Wang X, Deng J (2026) CoRoPINN: Cognitive region optimized physics-informed neural networks. PLoS One 21(9): e0358646. https://doi.org/10.1371/journal.pone.0358646 Editor: Vikash Kumar Sinha, Srinath University, INDIA Received: February 9, 2026; Accepted: September 3, 2026; Published: September 21, 2026 Copyright: © 2026 Li et al. This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Data Availability: The datasets for the 1D-Reaction, 1D-Wave, and Convection benchmarks are available at https://github.com/thuml/RoPINN , and the datasets for the Poisson and Burgers2D benchmarks are available at https://github.com/i207M/PINNacle . Funding: This work is partially supported by the National Natural Science Foundation of China under Grant 62020106003 and Grant 62263010. There was no additional external funding received for this study. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. Competing interests: The authors have declared that no competing interests exist. Introduction Partial differential equations (PDEs) play a pivotal role in the mathematical modeling of complex phenomena across various disciplines, including physics, chemistry, biology, and financial engineering. The numerical solution of PDEs presents a fundamental challenge in scientific computing [ 1 – 3 ]. Traditional numerical methods, such as the finite element method [ 4 ], finite difference method [ 5 ], and finite volume method [ 6 ], have matured and become the standard approaches. However, these methods primarily rely on grid discretization, which poses significant challenges, including high computational costs and the curse of dimensionality when dealing with high-dimensional problems, complex geometric boundaries, or the resolution of inverse problems [ 7 , 8 ]. In recent years, PINNs have emerged as a mesh-free deep learning framework, offering a novel paradigm for solving PDEs [ 9 ]. PINNs embed governing equations, initial conditions, and boundary conditions into the neural network’s optimization objective as residual losses. By leveraging automatic differentiation techniques to compute partial derivatives, they encourage the neural network to satisfy physical laws while fitting data. This integration of physical prior knowledge with data-driven approaches demonstrates immense potential for solving direct and inverse problems in data-scarce scenarios [ 8 , 10 ]. The success of PINNs has prompted refinements along four complementary directions. The first direction focuses on network architectures and seeks to improve expressiveness or computational efficiency. The separable physics-informed neural network (SPINN) [ 11 ] processes coordinate dimensions independently to reduce the cost of high-dimensional PDEs, whereas the deep fuzzy physics-informed neural network (FPINN) [ 12 ] introduces fuzzy-logic layers to improve robustness to data uncertainty. The second direction focuses on optimization strategies and seeks to make the PINN loss landscape easier to train. The gradient-enhanced physics-informed neural network (gPINN) [ 13 ] regularizes residual gradients, while the scale-invariant MultiAdam optimizer [ 14 ] balances the optimization rates of heterogeneous loss terms. The third direction focuses on balancing the multiple objectives in the PINN loss. Neural tangent kernel (NTK) weighting [ 15 ] estimates the relative importance of individual loss terms, whereas self-adaptive loss-balanced PINN [ 16 ] uses convergence status and uncertainty to update the weights. The fourth direction focuses on changing the training paradigm itself. The variational physics-informed neural network (vPINN) [ 17 ] expresses PDE constraints in integral form, residual-based adaptive refinement (RAR) [ 18 ] adds points where PDE residuals are large, and physics-informed generative adversarial networks (PI-GANs) [ 19 ] combine physical constraints with adversarial training. Despite this progress, two interconnected limitations remain. First, conventional PINNs impose PDE constraints at finite, discrete points, although the target equations are defined over continuous domains [ 9 , 20 ]. This spatial mismatch weakens supervision between collocation points and impairs the representation of local fine-scale structures ( Fig 1 ). Second, learning difficulty varies substantially across the domain, but conventional training assigns equal importance to all samples [ 21 ]. The resulting Unbalanced Prediction Problem (UPP) causes optimization to favor smooth or simple regions while under-resolving challenging structures such as boundary layers. Existing approaches address parts of these limitations, but they do not jointly coordinate continuous neighborhood constraints, pointwise difficulty, and training-stage progression within one feedback loop. Download: PNG larger image TIFF original image Fig 1. Point optimization PINNs. https://doi.org/10.1371/journal.pone.0358646.g001 To address these challenges, two distinct approaches to expanding training paradigms have emerged ( Fig 2 ). The region-optimized physics-informed neural network (RoPINN) [ 20 ] adopts a spatial continuity perspective, effectively enhancing local constraints and improving generalization capabilities by extending the optimization domain from discrete points to their continuous neighborhoods. Conversely, the cognitive physics-informed neural network (CoPINN) [ 21 ] focuses on temporal dynamics and introduces a self-paced learning mechanism that dynamically evaluates sample difficulty and adjusts learning weights, thereby effectively mitigating the UPP [ 22 ]. Download: PNG larger image TIFF original image Fig 2. Training paradigm extension PINNs. https://doi.org/10.1371/journal.pone.0358646.g002 Existing adaptive PINN methods differ in both their optimization units and their adaptation targets. Residual-based adaptive refinement (RAR) reallocates discrete collocation points according to residual magnitude, but its optimization unit remains an isolated point [ 18 ]. RoPINN expands each point into a neighborhood and calibrates a shared region scale through gradient stability, but it does not explicitly model pointwise difficulty or training-stage progression [ 20 ]. CoPINN schedules pointwise loss weights from easy to hard, but it retains point-based constraints [ 21 ]. CoRoPINN differs by coupling a globally calibrated stable radius with residual-based sample difficulty, point-specific regions, and progressive cognitive weights in one feedback loop. This coupling links spatial continuity with temporal curriculum learning instead of treating region optimization and cognitive weighting as independent additions. Accordingly, this paper introduces Co gnitive R egion O ptimized P hysics- I nformed N eural N etworks (CoRoPINN). Its central advantage targets PDEs whose learning difficulty is distributed unevenly over the solution domain. Difficulty-adaptive neighborhoods strengthen continuous supervision around under-resolved collocation points, while cognitive weights redirect optimization toward those regions as training progresses. The present benchmarks evaluate this capability through local fine-scale structures, sparse coverage in higher dimensions, and coupled nonlinear dynamics. Within this evaluated scope, the closed-loop coordination addresses limitations that neither region optimization nor pointwise cognitive weighting resolves alone. The main contributions of this paper are as follows: We develop a cognition-guided region optimization mechanism that links global trust-region calibration, sample-specific residual difficulty, adaptive region sampling, and progressive cognitive weighting within one training loop. We formulate a dual radius update that first identifies a globally stable region scale and then adapts each sampling neighborhood to local learning difficulty. Across five backbone architectures, CoRoPINN achieves the lowest geometric-mean rMAE on all three one-dimensional benchmarks. Under the stated loss-ranking rule, it leads or ties in 37 of 45 reported metric cells and also attains the lowest rMAE and rMSE on Burgers2D. Preliminaries PDE definition Consider a system of partial differential equations that incorporates equation constraints, boundary conditions, and initial conditions. This can be formalized as follows: (1) where , , and denote the governing PDE, boundary-condition, and initial-condition operators, respectively [ 1 ]. The symbols , , and denote the spatiotemporal domain, its boundary, and the initial-time domain at t = 0, respectively. The target solution is , where d is the number of spatial dimensions and m is the number of solution components. The coordinate combines spatial position and time, i.e., , where t denotes time. PINNs have been demonstrated to approximate the true solution through neural network parameterization, with the training objective being to minimize the loss function [ 9 ]. Region optimization method Region optimization is a training paradigm that extends the PINN optimization process from discrete sampling points to continuous neighborhoods. Conventional PINNs impose PDE constraints solely at finite sampling points, whereas region optimization theoretically reduces generalization error and enhances constraint satisfaction by applying continuous constraints within the neighborhood of each sampling point [ 20 ]. Region optimization comprises two iterative steps: Monte Carlo approximation and trust-region correction. The former effectively approximates the optimization objective, while the latter efficiently controls estimation error. Region optimization definition. For a set of sampling points S , with | S | denoting its cardinality, region optimization extends each point to its neighborhood , where r is the region radius and d denotes the spatial dimension. The region loss function can be defined as: (2) where denotes the point optimization loss at x , is the neural network parameterized by , is the measure (volume) of the extended neighborhood, and is an offset within that neighborhood. This definition extends the original point constraint to a region integral constraint, requiring the network to satisfy the PDE not only at the sampling point but also maintain physical consistency within the surrounding neighborhood. Monte Carlo approximation. Since the region integral in Eq (2) cannot be computed directly, region optimization employs Monte Carlo approximation. At each iteration, an offset is uniformly sampled from the neighborhood . The region loss gradient is approximated using the expected loss gradient at the sampled point [ 23 ], as follows: (3) Here, denotes the uniform distribution over , denotes expectation with respect to , and denotes the gradient with respect to the network parameters . This approximation method has been demonstrated to efficiently implement region optimization while implicitly introducing a higher-order regularization effect [ 20 ]. The application of Taylor expansion analysis reveals that Monte Carlo sampling is equivalent to constraining the original loss and its first-order derivative terms. Such a constraint aids in suppressing unphysical oscillations in the solution, making it particularly suitable for PDE problems characterized by drastic variations. Trust region calibration. To prevent excessive sampling areas from causing optimization instability, region optimization employs a trust region calibration mechanism to adjust region size dynamically. The trust region is defined as the input domain area characterized by low gradient variance, where optimization is more stable and reliable [ 24 ]. The region radius r is dynamically adjusted based on gradient variance: (4) where denotes the gradient variance when uniformly sampling within the neighborhood . By approximating the variance through multiple consecutive iterations, the system adaptively adjusts the radius to balance generalization performance and optimization stability. In scenarios where the gradient variance is high, the region radius automatically shrinks to ensure convergence stability. Conversely, when optimization is stable, a larger region is permitted, thus enhancing generalization capability. This mechanism ensures stronger local constraints while maintaining training stability. The implementation-specific statistic, initialization, update frequency, and clipping controls used by CoRoPINN are specified in the later Trust region evaluation and Difficulty-based region adaptation subsections. Cognitive learning method Cognitive learning is a machine learning training paradigm that emulates human learning processes. Its fundamental principle is the dynamic adjustment of learning strategies based on the difficulty level of learning materials [ 22 ]. In the domain of physical information, neural networks employ cognitive learning methods to facilitate a progressive training process, ranging from simplicity to complexity, by discerning variations in learning difficulty across different regions. Difficulty evaluation in CoPINN. The primary task for cognitive learning to achieve an easy-to-difficult progression involves accurately assessing the learning difficulty across various spatial locations. Difficulty levels are typically determined based on predefined heuristic rules, such as training loss or specific statistical properties of the data. In CoPINN, the difficulty metric for sampling points at the t -th iteration is defined by t he gradient norm of the PDE loss as: (5) Here, i indexes a sampling point, t indexes the training iteration, is the PDE residual loss at iteration t , and is the Euclidean norm. This metric dynamically reflects t he difficulty for the network to satisfy physical constraints at any given point. It does not rely on static, predefined difficulty measures but can continuously adjust its focus during training, emphasizing more challenging regions. A larger gradient norm indicates greater difficulty in satisfying the physical equations at that location. This phenomenon is often associated with boundary layers and other regions characterized by rapid changes [ 25 , 26 ]. Cognitive weight allocation. Based on difficulty assessment results, the core task of cognitive learning is to dynamically assign evolving weights to different samples over time. In the early training phase, the differences in weights are maximal. At this stage, the network’s capacity to adapt to challenging regions is weak. The system assigns higher weights to simple samples to rapidly establish a stable, correct global solution structure. During the mid-training phase, weight differences reach a minimum. At this point, the model engages in comprehensive, balanced learning, consolidating existing knowledge while preliminarily exploring difficult areas to prevent premature convergence to local optima. In the late training phase, weight differences gradually widen again but in the opposite direction, shifting focus toward challenging samples. This concentrates optimization resources on overcoming residual local difficulties, achieving refined fitting [ 21 ]. The dynamic weight adjustment mechanism ensures a learning process that is both robust and efficient, effectively avoiding initial instability and late-stage underfitting. Method Problem analysis and motivation PINNs are confronted with two fundamental challenges when attempting to solve PDEs: the local constraints of point optimization and the imbalance in spatial learning. Limitations of point optimization. Conventional PINNs minimize PDE residuals based on discrete sampling points, with the loss function defined as: (6) Here, , , and denote the PDE residual, initial-condition, and boundary-condition losses, respectively, while , , and are their nonnegative weighting coefficients. The PDE loss term is defined as: (7) Here, is the number of sampling points in , is the PDE operator, and is a discrete point. This point-based optimization imposes constraints solely on a finite set of discrete points, which results in insufficient supervision between these sampling points. This issue is particularly pronounced for PDEs with highly variable solutions, where the local nature of point constraints can lead to significant generalization problems. It has been demonstrated that the network may exhibit minimal residuals at the sampling points, while simultaneously generating nonphysical oscillations in the intervals between these points [ 27 – 29 ]. Unbalanced prediction problem (UPP). An analysis of error distributions during training reveals a severe spatial imbalance in PINNs when solving PDEs [ 21 , 29 ]. Notable disparities in learning difficulty have been observed across various spatial regions. In areas such as boundary regions and points of solution discontinuity, the residuals of PDEs are typically more than an order of magnitude higher than those in smooth internal regions. This phenomenon arises from drastic changes in physical quantities, leading to a highly uneven spatial distribution of prediction accuracy [ 15 ]. This imbalance stems from conventional PINN methods that apply identical optimization strategies across all training samples, neglecting the fundamental differences in physical properties and learning difficulty between regions. Since samples from simpler regions typically dominate the training process and gradient updates converge easily, uniform weight training strategies result in an overemphasis on these simpler regions. Consequently, this traps the model in local minima, hindering effective learning in more challenging regions that are critical to overall accuracy, thereby inducing
## Related Clinical Research

- [Design and testing of FFF-printed PLA honeycomb sandwich panels for flexural strength and mass eff](https://medichelpline.com/clinical-feed/plos-one-1-experimental-investigation-and-multi-response-design-of-fff-printed-pla.md)
- [How ritualized experiences and perceived authenticity shape tourists’ willingness to support intan](https://medichelpline.com/clinical-feed/plos-one-0-ritualized-experiences-and-perceived-authenticity-in-shaping-tourists.md)
- [Burden and adherence to long-term anti-VEGF intravitreal injections for retinal disease: qualitati](https://medichelpline.com/clinical-feed/bmj-open-11-treatment-burden-and-adherence-in-adults-receiving-long-term-anti-vegf.md)
- [Congress Pushes Back on Plan for Political Commission to Review NIH Grants](https://medichelpline.com/clinical-feed/stat-news-0-stat-members-of-congress-push-back-on-plan-to-create-a-commission-of-political.md)
- [Spatio-temporal imaging and acute manipulation of endogenous Yap1 in medaka using a Yap1-mGreenLan](https://medichelpline.com/clinical-feed/biorxiv-17-spatio-temporal-visualisation-and-manipulation-of-endogenous-yap1-in-medaka.md)

## Navigation
- [← Back to General Feed](https://medichelpline.com/clinical-feed/general.md)
- [← All Clinical Specialties](https://medichelpline.com/clinical-feed.md)
## Medical & Regulatory Disclaimer

> [!CAUTION]
> MedicHelpline content is structured for research, educational, and professional discovery purposes. It does not constitute individual medical advice, clinical diagnosis, or treatment recommendations.
> Always verify dosing, contraindications, and regulatory alerts against official product labeling and primary regulatory sources before clinical decision-making.