惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

J
Java Code Geeks
量子位
腾讯CDC
A
About on SuperTechFans
小众软件
小众软件
Microsoft Azure Blog
Microsoft Azure Blog
T
Tailwind CSS Blog
V
V2EX
B
Blog RSS Feed
H
Hackread – Cybersecurity News, Data Breaches, AI and More
GbyAI
GbyAI
Recent Announcements
Recent Announcements
Microsoft Security Blog
Microsoft Security Blog
博客园 - 叶小钗
罗磊的独立博客
宝玉的分享
宝玉的分享
WordPress大学
WordPress大学
大猫的无限游戏
大猫的无限游戏
IT之家
IT之家
V
Visual Studio Blog
D
DataBreaches.Net
博客园 - 三生石上(FineUI控件)
月光博客
月光博客
有赞技术团队
有赞技术团队

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
DDC-PINNs: A Predictor-Corrector Approach Based on Neural...
[Submitted on 28 Aug 2025 (v1), last revised 24 Jun 2026 (this v · 2026-06-25 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:When solving time-dependent partial differential equations (PDEs), traditional physics-informed neural networks (PINNs) may encounter several challenges. In particular, standard PINNs do not explicitly account for the temporal evolution order of time-dependent problems during training, which may affect the quality of temporal evolution in time-dependent PDEs. In addition, a single neural network may face difficulties in simultaneously representing different physical behaviors across multiple regions of the computational this http URL address these issues, we propose a domain-decomposition-based causal PINNs (DDC-PINNs) framework. The term causal refers to the fact that the temporal evolution is performed sequentially through classical ordinary differential equation (ODE) integration, thereby respecting the natural temporal ordering of time-dependent PDEs. The proposed framework enhances spatial approximation through domain decomposition and employs a sequential temporal-evolution strategy for time-dependent this http URL this framework, an approximate solution is first obtained using domain-decomposition PINNs. Subsequently, the time-derivative term in the original PDE is retained, while the remaining solution-dependent terms are replaced by the obtained approximation, thereby transforming the original PDE into an auxiliary ODE system. Classical numerical methods for ODEs are then employed to perform temporal evolution without repeated neural-network optimization. As a result, DDC-PINNs decouples spatial approximation from temporal evolution while preserving the temporal evolution order through sequential ODE this http URL experiments on several benchmark problems demonstrate the effectiveness of the proposed framework and provide proof-of-concept validation of the DDC-PINNs methodology.

Submission history

From: Xun Yang [view email]
[v1] Thu, 28 Aug 2025 05:38:08 UTC (334 KB)
[v2] Thu, 16 Oct 2025 12:14:01 UTC (334 KB)
[v3] Fri, 17 Oct 2025 01:30:58 UTC (752 KB)
[v4] Tue, 14 Apr 2026 12:02:08 UTC (1,531 KB)
[v5] Wed, 24 Jun 2026 00:26:12 UTC (1,851 KB)