Black Hole Black Boxes: Numerical Black Hole Metrics via AInstein Neural Networks
- URL: http://arxiv.org/abs/2607.05489v1
- Date: Mon, 06 Jul 2026 18:00:00 GMT
- Title: Black Hole Black Boxes: Numerical Black Hole Metrics via AInstein Neural Networks
- Abstract summary: AInstein architecture introduced an unsupervised neural method for solving the Einstein equations on arbitrary manifold.<n>PINN is extended here to Lorentzian signature, validated by recovering the maximally extended Schwarzschild geometry.<n>It is tested as novel search method for arbitrary black hole solutions.
- Score: 42.07621961895129
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The AInstein architecture introduced an unsupervised neural method for solving the Riemannian Einstein equations on arbitrary manifolds. This Physics Informed Neural Network approach (PINN) is extended here to Lorentzian signature, validated by recovering the maximally extended Schwarzschild geometry, and tested as novel search method for arbitrary black hole solutions. The topology is built into the architecture by treating $S^{2}$ globally through its standard embedding, such that the network learns an ambient metric on the manifold $\mathbb{R}^{2} \times \mathbb{R}^{3}$, where Penrose coordinates are chosen for $\mathbb{R}^2$ and the metric on $S^{2}$ is obtained by pullback. The architecture is first trained with the objective of recovering the Schwarzschild metric via losses encoding the vacuum Einstein equation, a quadratic Weyl scalar constraint, and the $SO(3)$ symmetry of the resultant metric; directly motivated by the Birkhoff--Jebsen theorem. Following this, the objective is generalised to use the Petrov speciality index, a horizon curvature anchor, and a trapped-surface constraint, to allow search for algebraically general Petrov type I solutions, finding potentially novel general-type Lorentzian Einstein metrics with a genuinely trapped interior.
Related papers
- Riemann GeoResolver: A Non-Euclidean Attention Framework from Euclidean Resolver to Hyperbolic-Spherical Geometry [0.0]
We present a theoretical foundation for inverse-distance attention, from its Euclidean prototype (Resolver) to its non-Euclidean realization (Riemann GeoResolver)<n>The non-Euclidean extension then builds upon this prototype, replacing Euclidean distance with hyperbolic geodesic distance for storage and spherical geodesic distance for routing.
arXiv Detail & Related papers (2026-08-11T03:05:44Z) - Intrinsic Wasserstein Rates for Score-Based Generative Models on Smooth Manifolds [61.14405512940818]
We show that Score-based generative models are trained in high-dimensional ambient spaces.<n>We use a ReLU implementation of nearest-projection coordinates via finite intrinsic anchors and Gauss Newton.
arXiv Detail & Related papers (2026-05-15T10:20:05Z) - When Attention Beats Fourier: Multi-Scale Transformers for PDE Solving on Irregular Domains [0.0]
msat achieves state-the-art generalization on complex geometry problems.<n>textbfMulti-Scale Attention Transformer (msat) encodes solution histories as token sequences and trains end-to-end.
arXiv Detail & Related papers (2026-05-08T15:23:13Z) - Intrinsic Lorentz Neural Network [49.83037691286893]
Real-world data frequently exhibit latent hierarchical structures, which can be naturally represented by hyperbolic geometry.<n>We propose the emphIntrinsic Lorentz Neural Network (ILNN), a fully intrinsic hyperbolic architecture that conducts all computations within the Lorentz model.<n>At its core, the network introduces a novel emphpoint-to-hyperplane fully connected layer (FC), replacing traditional Euclidean affine logits with closed-form hyperbolic distances.
arXiv Detail & Related papers (2026-02-27T12:48:05Z) - Obstructions to Unitary Hamiltonians in Non-Unitary String-Net Models [0.0]
We prove that the Yang-Lee fusion rules admit no unitary solution to the pentagon equations.<n>We invoke the theory of $mathcalPT$-symmetric quantum mechanics to interpret the non-Hermitian Hamiltonian.
arXiv Detail & Related papers (2026-01-11T09:10:03Z) - Geometric Latent Space Tomography with Metric-Preserving Autoencoders [0.0]
We introduce geometric latent space tomography, combining classical neural encoders with parameterized quantum circuit decoders trained via a metric-preservation loss.<n>Our geometry-aware latent space enables direct state discrimination, fidelity estimation from Euclidean distances, and interpretable error for quantum error mitigation without repeated full tomography.
arXiv Detail & Related papers (2025-12-16T20:18:10Z) - Expressive Power of Deep Networks on Manifolds: Simultaneous Approximation [2.815765641180636]
We show that a constant-depth $mathrmReLUk-1$ network with bounded weights can approximate any function in the Sobolev space.<n>We also prove that our construction is nearly optimal by showing the required number of parameters matches up to a logarithmic factor.
arXiv Detail & Related papers (2025-09-11T11:28:20Z) - Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks.
In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
arXiv Detail & Related papers (2024-04-29T15:04:07Z) - Geometry of degenerate quantum states, configurations of $m$-planes and invariants on complex Grassmannians [55.2480439325792]
We show how to reduce the geometry of degenerate states to the non-abelian connection $A$.
We find independent invariants associated with each triple of subspaces.
Some of them generalize the Berry-Pancharatnam phase, and some do not have analogues for 1-dimensional subspaces.
arXiv Detail & Related papers (2024-04-04T06:39:28Z) - $O(N^2)$ Universal Antisymmetry in Fermionic Neural Networks [107.86545461433616]
We propose permutation-equivariant architectures, on which a determinant Slater is applied to induce antisymmetry.
FermiNet is proved to have universal approximation capability with a single determinant, namely, it suffices to represent any antisymmetric function.
We substitute the Slater with a pairwise antisymmetry construction, which is easy to implement and can reduce the computational cost to $O(N2)$.
arXiv Detail & Related papers (2022-05-26T07:44:54Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.