The paper introduces two multi-stage neural operator learning frameworks—Deep Collocation Neural Operator (DCNO) and Deep Galerkin Neural Operator (DGNO)—for efficiently computing convolution integrals. DCNO is a supervised method that iteratively refines operator approximations by learning residuals from data pairs, while DGNO is an unsupervised approach that uses the weak form of a PDE residual when the operator can be represented by a PDE. Both frameworks build basis operators across multiple training stages, yielding markedly higher accuracy than one-shot learning and achieving near machine‑precision results for convolution problems, with significant efficiency gains for repeated queries or parametric variations.
By Zhiping Mao, Zhenye Wen, Yong Zhang, Xiaofei Zhao
arXiv:2510. 14217v2 Announce Type: replace Abstract: The spectral properties of feature embeddings offer critical insights into model generalization and representation quality.
By Asma Jamali, Tin Sum Cheng, Rodrigo A. Vargas-Hern\'andez
arXiv:2603. 23647v2 Announce Type: replace-cross Abstract: In fluorescence microscopy, spectral unmixing aims to recover individual fluorophore concentrations from spectral images that capture mixed fluorophore emissions.
By Federico Carrara, Talley Lambert, Mehdi Seifi, Florian Jug
arXiv:2606. 00401v1 Announce Type: cross Abstract: Simulating large molecular systems comprising thousands of atoms requires highly scalable methodologies.
By Abhiram Badrinarayanan, Davor Davidovic, Edoardo Di Napoli, Jurica Novak, Luigi Genovese, Gustavo Ramirez-Hidalgo, Xinzhe Wu
arXiv:2601. 17090v2 Announce Type: replace-cross Abstract: Partial differential equations (PDEs) govern complex systems, yet neural operators often struggle to efficiently capture the long-range, nonlocal interactions inherent in their solution maps.
By Noam Koren, Rafael Moschopoulos, Kira Radinsky, Elad Hazan
arXiv:2607. 03692v1 Announce Type: new Abstract: Spectral methods are widely used to construct representations from the geometry of data, but they often rely on a fixed kernel, graph Laplacian, or manually selected feature scaling.
By Varvara Nazarenkko, Timur Lidzhiev, Alexander Tarakanov