arXiv Machine Learning By Nathan Benjamin, A. Liam Fitzpatrick, Wei Li, Jesse Thaler

Descending into the Modular Bootstrap

Read the original on arXiv Machine Learning →

arXiv:2604. 01275v3 Announce Type: replace-cross Abstract: In this paper, we attempt to explore the landscape of two-dimensional conformal field theories (2d CFTs) by efficiently searching for numerical solutions to the modular bootstrap equation using machine-learning-style 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 Machine Learning.

arXiv Machine Learning
Sep 3

Learning Spectral-Like Mesh-Free Discretisations

The paper introduces Spectral-like Neural Discretisation (SpeND), a mesh‑free method that learns stencil weights via a neural network to approximate the modal response of a spectral operator across a specified band of wavenumbers. By projecting the network output onto the space of polynomial‑consistent weights, SpeND ensures exact consistency while minimizing dispersion and dissipation errors in a self‑supervised, physics‑agnostic manner. Experiments on disordered 2‑D node sets demonstrate that the learned fourth‑order operator matches the exact spectral response over a wider band than traditional LABFM or structured‑grid finite differences, and retains fourth‑order convergence upon refinement.

By Lucas Gerken Starepravo, Henry Broadley, Steven Lind, Jack R. C. King
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 AI
Jul 7

Learning to Discover Iterative Spectral Algorithms

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.

By Zihang Liu, Oleg Balabanov, Yaoqing Yang, Michael W. Mahoney
arXiv Statistics ML
6d ago

Multivariate conformal uncertainty propagation in multitask atomistic simulation: Successes and pitfalls

The paper explores multivariate conformal uncertainty propagation for multitask atomistic simulations, introducing methods such as Bonferroni‑corrected hyperrectangles, hyperellipsoidal sets based on Mahalanobis distance, and custom loss functions within conformal risk control. It applies these techniques to calibrate predictions of energies, forces, and stresses, then propagates the resulting uncertainty sets to downstream quantities like elastic constants and vacancy formation energies. The study emphasizes how incorporating correlation predictions can capture symmetries and error cancellation, and discusses the interaction between computational protocols and conformal guarantees.

By Katharine Fisher, Michael Herbst, James Kermode, Youssef Marzouk