arXiv AI By Zihang Liu, Oleg Balabanov, Yaoqing Yang, Michael W. Mahoney

Learning to Discover Iterative Spectral Algorithms

Read the original on arXiv AI →

arXiv:2602. 09530v2 Announce Type: replace-cross Abstract: We introduce AutoSpec, a neural network framework for discovering iterative spectral algorithms for large-scale numerical linear algebra and numerical optimization.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
4d ago

Learning Spectrally Optimised Mesh-Free Discretisations

The paper introduces Spectrally Optimised Neural Discretisations (SpeND), a mesh‑free framework that learns discretisation weights from local stencil geometry on unstructured point clouds. By embedding discrete moment conditions into the network architecture, SpeND guarantees polynomial consistency and allows the weights to be optimised for spectral accuracy over a chosen wavenumber band, using an unsupervised Fourier‑mode loss. The resulting operators are PDE‑agnostic, perform well on Poisson, Burgers, and Navier–Stokes equations, and can reduce wall‑clock time by 3–20× compared to existing mesh‑free methods at the same accuracy.

By Lucas Gerken Starepravo, Henry Broadley, Steven Lind, Jack R. C. King
arXiv Machine Learning
Aug 24

SPARCL: Spectral Partitioned Analytic Continual Learning

SPARCL introduces a spectral partitioned analytic continual learning method that addresses forgetting in analytic class‑incremental learning. By decomposing the running autocorrelation into a high‑energy core and a residual complement, SPARCL freezes core components for old classes and updates only the residual block, ensuring closed‑form updates with an invariance guarantee. Experiments on CIFAR‑100, CUB‑200, ImageNet‑R, and ImageNet‑A with a frozen ViT‑B/16 protocol show that SPARCL narrows the performance gap between classical analytic learners and strong representation matchers while complementing sparse feature‑decorrelation approaches.

By James Hartley, Zeropy Surio, Daniel Whitmore, Hannah Clarke, Thomas Reed
arXiv Machine Learning
Sep 25

Spectral Graph Neural Networks with Hermite Polynomials: A Comprehensive Study

The paper introduces HermNet, a spectral graph neural network that uses Hermite polynomials for nodewise prediction and normalized propagation, avoiding eigendecomposition or learned bases. It compares HermNet to other complete polynomial bases, examining how coordinate choices affect optimization under limited training. Experiments on synthetic and real data show regimes where HermNet outperforms alternatives, and analyze the impact of calibration, regularization, and training duration on performance.

By Shuang Wu
arXiv Machine Learning
Jun 8

Closed-Form Spectral Regularization for Multi-Task Model Merging

arXiv:2606. 07289v1 Announce Type: new Abstract: Model merging combines several independently fine-tuned experts into a single multi-task model without any training data, reducing the storage, serving, and decentralized-development costs of large foundation models.

By Yongxian Wei, Runxi Cheng, Xingxuan Zhang, Li Shen, Chun Yuan, Peng Cui, Dacheng Tao