Where to Compute and How to Interact: Operator-Readable Adaptation with Gauge-Aware Transport

• URL: http://arxiv.org/abs/2609.15620v1
• Date: Mon, 14 Sep 2026 14:13:30 GMT
• Title: Where to Compute and How to Interact: Operator-Readable Adaptation with Gauge-Aware Transport
• Abstract summary: We propose a physics-informed adaptive allocation system for partial differential equations (PDEs)<n>The Gauge-Aware Adaptive Mesh Neural Operator (GA-AMNO) can account for and test why computation is allocated to particular locations.<n> Experiments on five PDE benchmarks demonstrate improved predictive accuracy, while controlled interventions and geometric-mismatch analyses verify the roles of allocation and interaction.
• Score: 17.892151567058367
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Adaptive meshes enable neural operators for partial differential equations (PDEs) to allocate spatial samples and computation according to local physical structures. Existing approaches, however, mainly address where to compute, with less attention to how information should interact after node relocation. Mesh adaptation changes local sampling scales, neighborhood structures, and geometric contexts, so representations formed at different nodes may not be directly comparable. Direct aggregation can therefore entangle physical variation with discretization-induced representation variation. Because allocation and interaction are jointly optimized through the same output objective, their individual roles are also difficult to distinguish from final errors alone. We introduce operator readability, requiring an adaptive operator to account for and test why computation is allocated to particular locations and how representations interact under the resulting nonuniform discretization. Based on this principle, we propose the Gauge-Aware Adaptive Mesh Neural Operator (GA-AMNO). Physics-informed adaptive allocation answers where to compute, while geometry-conditioned low-rank Gauge transport maps source features into target representation contexts before aggregation, answering how to interact. This makes mesh-to-solver information exchange inspectable and intervenable. We establish sufficient conditions for representation-consistent aggregation and analyze approximate transport errors and continuity under topology-preserving mesh deformations. Experiments on five PDE benchmarks demonstrate improved predictive accuracy, while controlled interventions and geometric-mismatch analyses verify the roles of allocation and interaction and show that Gauge transport improves cross-discretization representation compatibility under strong geometric mismatch.

Related papers

• 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)
• TRACE: Transport Alignment Conformal Prediction via Diffusion and Flow Matching Models [4.9352098965615]
  We study how to construct valid and informative regions for multi-dimensional outputs.<n>We measure how well a candidate output aligns with the learned generative dynamics by averaging denoising velocity or errors along transport trajectories.<n>The resulting transport-based scores are scalar-valued and can be calibrated using conformal prediction split.
  arXiv  Detail & Related papers  (2026-05-08T01:28:57Z)
• Information-Theoretic Generalization Bounds for Stochastic Gradient Descent with Predictable Virtual Noise [0.0]
  We introduce history-adaptive virtual perturbations, where the perturbation covariance at each iteration may depend on the past real SGD history but not on current or future randomness.<n>This predictability enables a conditional Gaussian relative-entropy argument and yields generalization bounds for SGD with adaptive virtual-noise geometry.<n>The framework recovers fixed isotropic and geometry-aware bounds as special cases while extending virtual perturbation analysis to history-dependent SGD without modifying the algorithm.
  arXiv  Detail & Related papers  (2026-04-30T08:54:42Z)
• Direct Segmentation without Logits Optimization for Training-Free Open-Vocabulary Semantic Segmentation [48.806000388608005]
  Open-vocabulary semantic segmentation (OVSS) aims to segment arbitrary category regions in images using open-vocabulary prompts.<n>We propose a more direct approach that eschews the logits-optimization process by directly deriving an analytic solution for the segmentation map.
  arXiv  Detail & Related papers  (2026-04-09T02:14:35Z)
• Gauge-Equivariant Intrinsic Neural Operators for Geometry-Consistent Learning of Elliptic PDE Maps [0.0]
  We propose Gauge-Equivariant Intrinsic Neural Operators (GINO) for geometric partial differential equations (PDEs)<n>GINO parameterize elliptic solution maps through intrinsic spectral multipliers acting on geometry-dependent spectra, coupled with gauge-equivariant nonlinearities.<n>We show GINO achieves low operator-approximation error, near machine-precision gauge equivariance, equi robustness to structured metric perturbations, strong cross-resolution generalization with small commutation error under restriction/prolongation, and structure-preserving performance on a regularized exact/coexact decomposition task.
  arXiv  Detail & Related papers  (2026-03-16T02:10:06Z)
• Elliptic Loss Regularization [24.24785205800212]
  We propose a technique for enforcing a level of smoothness in the mapping between the data input space and the loss value.<n>We specify the level of regularity by requiring that the loss of the network satisfies an elliptic operator over the data domain.
  arXiv  Detail & Related papers  (2025-03-04T00:08:08Z)
• PseudoNeg-MAE: Self-Supervised Point Cloud Learning using Conditional Pseudo-Negative Embeddings [55.55445978692678]
  PseudoNeg-MAE enhances global feature representation of point cloud masked autoencoders by making them both discriminative and sensitive to transformations.<n>We propose a novel loss that explicitly penalizes invariant collapse, enabling the network to capture richer transformation cues while preserving discriminative representations.
  arXiv  Detail & Related papers  (2024-09-24T07:57:21Z)
• Equivariant Disentangled Transformation for Domain Generalization under Combination Shift [91.38796390449504]
  Combinations of domains and labels are not observed during training but appear in the test environment. We provide a unique formulation of the combination shift problem based on the concepts of homomorphism, equivariance, and a refined definition of disentanglement.
  arXiv  Detail & Related papers  (2022-08-03T12:31:31Z)
• Equivariance Discovery by Learned Parameter-Sharing [153.41877129746223]
  We study how to discover interpretable equivariances from data. Specifically, we formulate this discovery process as an optimization problem over a model's parameter-sharing schemes. Also, we theoretically analyze the method for Gaussian data and provide a bound on the mean squared gap between the studied discovery scheme and the oracle scheme.
  arXiv  Detail & Related papers  (2022-04-07T17:59:19Z)
• Spatially Adaptive Inference with Stochastic Feature Sampling and Interpolation [72.40827239394565]
  We propose to compute features only at sparsely sampled locations. We then densely reconstruct the feature map with an efficient procedure. The presented network is experimentally shown to save substantial computation while maintaining accuracy over a variety of computer vision tasks.
  arXiv  Detail & Related papers  (2020-03-19T15:36:31Z)

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.