Fast Reconstruction of Exact Maxwell Dynamics from Sparse Data
We introduce FLASH-MAX, a shallow, exact-by-construction neural network architecture for predicting homogeneous electromagnetic fields from sparse pointwise observations. Each hidden neuron represents a separate exact solution to Maxwell's equations, so that the network satisfies the governing equations symbolically by construction and can be trained end-to-end from sparse data within seconds. We prove a universal approximation result showing that this exact model class remains universal on arbitrary domains. FLASH-MAX reaches sub-1% relative validation error from about 1K sparse pointwise observations in seconds, all while maintaining a zero PDE residual, and keeps single-digit errors even for only 100 observations sampled from 3D space. These results suggest that moving governing structure from the loss into the hypothesis class can dramatically improve the trade-off between precision and optimization speed in scientific machine learning.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Frank-Wolfe Algorithm for the Exact Sparse Problem
In this paper, we study the properties of the Frank-Wolfe algorithm to solve the \ExactSparse reconstruction problem. We prove that when the dictionary is quasi-incoherent, at each iteration, the Frank-Wolfe algorithm pi…
Structure-preserving Randomized Neural Networks for Incompressible Magnetohydrodynamics Equations
The incompressible magnetohydrodynamic (MHD) equations are fundamental in many scientific and engineering applications. However, their strong nonlinearity and dual divergence-free constraints make them highly challenging…
Electrodynamics Correlates Knock-on and Knock-off: Current is Spatially Uniform in Ion Channels
Ions in channels have been imagined as hard balls in a macroscopic mechanical model, for a very long time. Hard balls interact by collisions in such models, randomly knocking each other on and off `binding' sites in ther…
Astral: training physics-informed neural networks with error majorants
The primal approach to physics-informed learning is a residual minimization. We argue that residual is, at best, an indirect measure of the error of approximate solution and propose to train with error majorant instead. …
On Performance of Sparse Fast Fourier Transform Algorithms Using the Aliasing Filter
Computing the Sparse Fast Fourier Transform(sFFT) of a K-sparse signal of size N has emerged as a critical topic for a long time. There are mainly two stages in the sFFT: frequency bucketization and spectrum reconstructi…
compressed sensing