Solution-space heterogeneity shapes federated learning dynamics across partial differential equations

• URL: http://arxiv.org/abs/2609.05012v1
• Date: Fri, 04 Sep 2026 11:23:29 GMT
• Title: Solution-space heterogeneity shapes federated learning dynamics across partial differential equations
• Abstract summary: Federated machine learning enables institutions to train neural surrogates without centralizing local physical data.<n>Existing protocols partition coordinates, coefficients, boundary conditions, or geometries according to equation-specific rules.<n>Here, we introduce solution-space PDE-Dirichlet, a protocol that converts continuous supervised responses into reusable solution bins.
• Score: 41.890949680958805
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Federated scientific machine learning enables institutions to train neural surrogates without centralizing local physical data, yet studies of partial differential equations (PDEs) lack a transferable definition of non-independent and identically distributed data. Existing protocols partition coordinates, coefficients, boundary conditions, or geometries according to equation-specific rules. Here, we introduce solution-space PDE-Dirichlet, a protocol that converts continuous supervised responses into reusable solution bins and quantifies the realized separation between clients through optimal transport over the geometry of these bins. We derive an exact inverse relation between population allocation heterogeneity and the Dirichlet concentration, and we establish conditions under which response heterogeneity induces gradient disagreement, local-update dispersion, and parameter divergence. Across seven controlled and public PDE tasks, three neural-operator families, and five random seeds, a lower concentration consistently increases the realized solution distance and optimization heterogeneity. The degradation in final error is task dependent: the largest effect occurs for low-viscosity Burgers, reaching 4.157 percentage points under the most heterogeneous setting, whereas additional communication or smoother dynamics can reduce the final gap despite persistent parameter separation. These results distinguish a reproducible geometric mechanism from task-dependent generalization outcomes and provide a common basis for evaluating non-IID federated PDE learning.

Related papers

• Characterizing Heterogeneous Rates in Finite Mixture Estimation via Partial Optimal Transport [88.55403215843967]
  Voronoi-based partial optimal transport (VPOT) for obtaining refined local and global convergence guarantees for the maximum likelihood estimator of the mixing measure.<n>Results hold in arbitrary fixed dimension without requiring mixing proportions to be uniformly bounded away from zero or prior knowledge of the true number of mixture components.
  arXiv  Detail & Related papers  (2026-09-15T04:32:53Z)
• PG-KINN: A Physics-Informed Petrov-Galerkin Kolmogorov-Arnold Network for Solving Forward and Inverse PDEs [0.33585724475660284]
  Physics-informed learning of partial differential equations (PDEs) has been dominated by multilayer perceptrons (MLPs)<n> Kolmogorov Arnold Networks (KANs) mitigate these limitations because their learnable activations are structurally aligned with the classical discretizations.<n>We present PG-KINN, a physics-informed KAN built on a Petrov-Galerkin formulation in which the test space is an independent, compactly supported, piecewise-polynomial space evaluated with Gauss-re quadrature.
  arXiv  Detail & Related papers  (2026-07-22T17:08:29Z)
• Adjoint Method versus Physics-Informed Neural Networks in PDE-Constrained Inverse Problems [48.470700002941136]
  Inverse problems governed by partial differential equations (PDEs) are central to computational mechanics and are commonly solved by adjoint-based optimization.<n> physics-informed neural networks (PINNs) have emerged as a flexible alternative.<n>We present a fair comparison of adjoint optimization and PINNs for PDE-constrained inverse problems.
  arXiv  Detail & Related papers  (2026-06-10T17:07:09Z)
• Guided Flow Matching for Forward and Inverse PDE Problems with Sparse Observations: Algorithm and Theory [2.148615003900331]
  We present FM4PDE, a flow-matching generative framework that learns the joint distribution of PDE coefficients.<n>Experiments on static and time-dependent benchmark PDEs demonstrate competitive accuracy and faster inference than diffusion-based generative models.
  arXiv  Detail & Related papers  (2026-05-25T07:14:11Z)
• Differentiable Inverse Modeling with Physics-Constrained Latent Diffusion for Heterogeneous Subsurface Parameter Fields [9.42765150299276]
  We present a latent diffusion-based differentiable inversion method (LD-DIM) for PDE-constrained inverse problems involving high-dimensional spatially distributed coefficients.<n>LD-DIM couples a pretrained latent diffusion prior with an end-to-end differentiable numerical solver to reconstruct unknown heterogeneous parameter fields in a low-dimensional nonlinear manifold.
  arXiv  Detail & Related papers  (2025-12-27T01:01:19Z)
• Governing Equation Discovery from Data Based on Differential Invariants [52.2614860099811]
  We propose a pipeline for governing equation discovery based on differential invariants.<n>Specifically, we compute the set of differential invariants corresponding to the infinitesimal generators of the symmetry group.<n>Taking DI-SINDy as an example, we demonstrate that its success rate and accuracy in PDE discovery surpass those of other symmetry-informed governing equation discovery methods.
  arXiv  Detail & Related papers  (2025-05-24T17:19:02Z)
• Collaborative Heterogeneous Causal Inference Beyond Meta-analysis [68.4474531911361]
  We propose a collaborative inverse propensity score estimator for causal inference with heterogeneous data. Our method shows significant improvements over the methods based on meta-analysis when heterogeneity increases.
  arXiv  Detail & Related papers  (2024-04-24T09:04:36Z)
• Lie Point Symmetry Data Augmentation for Neural PDE Solvers [69.72427135610106]
  We present a method, which can partially alleviate this problem, by improving neural PDE solver sample complexity. In the context of PDEs, it turns out that we are able to quantitatively derive an exhaustive list of data transformations. We show how it can easily be deployed to improve neural PDE solver sample complexity by an order of magnitude.
  arXiv  Detail & Related papers  (2022-02-15T18:43:17Z)
• Decentralized Local Stochastic Extra-Gradient for Variational Inequalities [125.62877849447729]
  We consider distributed variational inequalities (VIs) on domains with the problem data that is heterogeneous (non-IID) and distributed across many devices. We make a very general assumption on the computational network that covers the settings of fully decentralized calculations. We theoretically analyze its convergence rate in the strongly-monotone, monotone, and non-monotone settings.
  arXiv  Detail & Related papers  (2021-06-15T17:45:51Z)
• Non-intrusive reduced order modeling of poroelasticity of heterogeneous media based on a discontinuous Galerkin approximation [0.0]
  We present a non-intrusive model reduction framework for linear poroelasticity problems in heterogeneous porous media. We utilize the interior penalty discontinuous Galerkin (DG) method as a full order solver to handle discontinuity. We show that our framework provides reasonable approximations of the DG solution, but it is significantly faster.
  arXiv  Detail & Related papers  (2021-01-28T04:21:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.