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

推荐订阅源

Apple Machine Learning Research
Apple Machine Learning Research
M
MIT News - Artificial intelligence
罗磊的独立博客
博客园 - 【当耐特】
A
About on SuperTechFans
Last Week in AI
Last Week in AI
雷峰网
雷峰网
IT之家
IT之家
aimingoo的专栏
aimingoo的专栏
H
Hackread – Cybersecurity News, Data Breaches, AI and More
博客园_首页
博客园 - 叶小钗
Microsoft Azure Blog
Microsoft Azure Blog
博客园 - Franky
J
Java Code Geeks
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
D
Docker
Engineering at Meta
Engineering at Meta
B
Blog RSS Feed
The Cloudflare Blog
大猫的无限游戏
大猫的无限游戏
阮一峰的网络日志
阮一峰的网络日志
S
SegmentFault 最新的问题
Recent Announcements
Recent Announcements

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
Principal-Part Decomposition for Neural Operator Learning...
[Submitted on 24 Jun 2026] · 2026-06-25 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:Dirichlet-to-Neumann (DtN) maps send boundary values of a partial differential equation (PDE) solution to its normal derivative on the boundary. Learning such maps across varying domains is important for boundary-value problems, but a black-box neural operator must model both the operator's non-smoothing principal behavior and its dependence on boundary geometry. We use the boundary integral representation of the DtN map to obtain, for smooth planar boundaries, a useful principal-part decomposition: a geometry-independent leading operator can be written as a universal Fourier multiplier, while the remaining geometry-dependent correction is smoother. We propose Principal-Part Decomposed Neural Operators (PPDNO), a hybrid analytic-neural framework that turns this decomposition into a geometry-conditioned operator learning model. PPDNO computes the principal part by FFT and trains a low-rank Deep Operator Network (DeepONet)-type architecture to approximate only the residual correction across families of boundary geometries. This design keeps the exact linear action on the boundary data, exposes the sampled boundary as an input to the model, and turns the learned target into a smoother operator family. We justify the decomposition theoretically by proving smoothing and separated-approximation properties of the residual, and we derive finite-node and training-error bounds for the reconstructed full map. Experiments on interior Laplace problems over elliptical and Fourier-parameterized domains, and on exterior Helmholtz problems over rose curves, show that PPDNO improves accuracy over direct neural operator baselines while adding little inference overhead and generalizing to unseen boundary data. These results suggest that analytic operator structure and geometry-conditioned learning can be combined effectively for boundary solution maps.

Submission history

From: Shuo Ling [view email]
[v1] Wed, 24 Jun 2026 15:27:00 UTC (930 KB)