Target-Guided Selective Reweighting for Physics-Informed Neural Network Inverse Problems: A Transfer Learning Approach
Not on the map. Why?
Abstract (arXiv)
Physics-informed neural networks (PINNs) often face ill-posed optimization, competing losses, and parameter compensation in partial differential equation (PDE) inverse problems. Transfer learning can reuse source-task representations, but direct fine-tuning may induce negative transfer when source and target physics differ, leading to low field error but inaccurate parameter recovery. To address this issue, we propose Target-Guided Selective Reweighting PINN (TGSR-PINN), a target-evidence-driven representation correction method for PINN inverse transfer learning. TGSR-PINN transfers source network weights and biases but initializes target physical parameters independently. After target short adaptation, it scores neurons using first-order Taylor sensitivity and pre-activation variance on fixed batches. These scores are converted into continuous weak-adaptation signals using a Gaussian mixture model with rank fallback. TGSR-PINN then applies bounded selective soft decay to the corresponding input weight rows and biases without pruning or resetting them. Experiments on a zero-source high-P'eclet inflow-outflow problem with nonzero Dirichlet data and an outflow boundary layer, Allen-Cahn to Burgers cross-PDE transfer, and 5%-noise reaction-diffusion inverse problems show that TGSR-PINN improves parameter recovery while maintaining low field error. Ablation studies indicate that neuron target scoring, weak-adaptation estimation, layer protection, and selective soft decay jointly contribute to the observed benefits.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 28 of its 40 references that are in the map. First posted on arXiv 6 Jul 2026.
Builds on
28 of 40 references.
References · 28
- 2017Attention Is All You Needcited by 59,932
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?cited by 2,335
- 2019MS-TCN: Multi-Stage Temporal Convolutional Network for Action Segmentationcited by 370
- 2018Videos as Space-Time Region Graphscited by 221
- 2019Graph Convolutional Networks for Temporal Action Localizationcited by 208
- 2019Probabilistic Face Embeddingscited by 171
- 2014Word Representations via Gaussian Embeddingcited by 96
- 2019Unsupervised learning of action classes with continuous temporal embeddingcited by 75
- 2018Unsupervised Learning and Segmentation of Complex Activities from Videocited by 61
- 2021Temporally-Weighted Hierarchical Clustering for Unsupervised Action Segmentationcited by 58
16 more
- 2018Modeling Uncertainty with Hedged Instance Embeddingcited by 52
- 2021Unsupervised Action Segmentation by Joint Representation Learning and Online Clusteringcited by 48
- 2019View-Invariant Probabilistic Embedding for Human Posecited by 47
- 2020Joint Visual-Temporal Embedding for Unsupervised Learning of Actions in Untrimmed Sequencescited by 45
- 2023Energy-Based Sliced Wasserstein Distancecited by 39
- 2024Temporally Consistent Unbalanced Optimal Transport for Unsupervised Action Segmentationcited by 37
- 2021Action Shuffle Alternating Learning for Unsupervised Action Segmentationcited by 33
- 2021Unsupervised Discriminative Embedding for Sub-Action Learning in Complex Activitiescited by 26
- 2022Timestamp-Supervised Action Segmentation with Graph Convolutional Networkscited by 18
- 2024Hierarchical Vector Quantization for Unsupervised Action Segmentationcited by 18
- 2023Permutation-Aware Action Segmentation via Unsupervised Frame-to-Segment Alignmentcited by 17
- 2023Unbalanced Optimal Transport: A Unified Framework for Object Detectioncited by 14
- 2022Learning of Global Objective for Network Flow in Multi-Object Trackingcited by 11
- 2025Joint Self-Supervised Video Alignment and Action Segmentationcited by 11
- 2024Gated Temporal Diffusion for Stochastic Long-Term Dense Anticipationcited by 6
- 2025CLOT: Closed Loop Optimal Transport for Unsupervised Action Segmentationcited by 6
Built on by
Citing papers per year: 2026: 1.
1 paper.