# Bundle-Glued Neural Field

- ID: 1695
- Canonical URL: https://synthcore.org/idea/1695/bundle-glued-neural-field
- API JSON: https://synthcore.org/api/idea/1695.json
- API Markdown: https://synthcore.org/api/idea/1695.md
- Verification status: mech_ok_no_baseline
- Source: [arXiv:2608.02108](https://arxiv.org/abs/2608.02108)
- Category: architecture
- Solves: accuracy, stability, generalization
- ML areas: graph-nn, embedding, regularization, geometry
- Math tags: differential-geometry, lie-groups, representation-theory, numerical-analysis
- Ratings: usefulness 7/10; difficulty 5/10; novelty 7/10

## Idea description

Represent a field on a manifold with one neural network per chart, while enforcing the exact transition law between chart outputs on overlaps. This avoids the artificial requirement that one coordinate frame work globally and should improve learning on spherical, periodic, or otherwise topologically nontrivial domains. Use an augmented Lagrangian rather than only a pointwise penalty so chart compatibility is enforced strongly without requiring identical local parameterizations.

## Mathematical statement

The paper defines local sections \(\sigma_i\) and transition functions \(g_{ij}:U_i\cap U_j\to G\) by \(\sigma_j(x)=\sigma_i(x)\cdot g_{ij}(x)\), where \(U_i,U_j\) are overlapping charts, \(G\) is the structure group, and \(x\) is an overlap point. A connection represented in two charts obeys the affine gluing equation \(\omega_j-\Ad_{g_{ij}^{-1}}\omega_i=g_{ij}^{\ast}\theta\), where \(\omega_i,\omega_j\) are local Lie-algebra-valued 1-forms, \(\Ad_{g_{ij}^{-1}}\) is the adjoint action of the inverse transition, and \(g_{ij}^{\ast}\theta\) is the pullback of the Maurer--Cartan form \(\theta\), producing the inhomogeneous gauge term. The reverse-orientation equation is \(\omega_i-\Ad_{g_{ji}^{-1}}\omega_j=g_{ji}^{\ast}\theta\). The paper treats local fields as independent broken finite-element fields and imposes this jump condition weakly on facets using Lagrange multipliers. For a general neural feature representation \(\rho:G\to GL(d)\), replace \(\Ad\) by \(\rho\), let \(y_i(x),y_j(x)\in\mathbb{R}^d\) be local network outputs, and let \(b_{ij}(x)\) be a known transition-dependent offset. Define \(r_{ij}(x)=y_j(x)-\rho(g_{ij}(x)^{-1})y_i(x)-b_{ij}(x)\). Train with the augmented Lagrangian \(\mathcal{L}_{\mathrm{aug}}=\mathcal{L}_{\mathrm{task}}+\sum_{(i,j)}\int_{U_i\cap U_j}\langle\lambda_{ij}(x),r_{ij}(x)\rangle+(\beta/2)\|r_{ij}(x)\|^2\,d\mu(x)\), where \(\lambda_{ij}\) is a dual multiplier, \(\beta>0\) is a penalty coefficient, and \(d\mu\) is the overlap measure. For connection 1-forms, evaluate the residual componentwise in a local tangent basis or output coefficients relative to a local coframe.

## Key formulas

- $$\sigma_{\beta}(x)=\sigma_{\alpha}(x)\cdot g_{\alpha\beta}(x),\qquad g_{\alpha\beta}^{-1}(x)=g_{\beta\alpha}(x),\qquad g_{\alpha\gamma}=g_{\alpha\beta}\cdot g_{\beta\gamma}.$$
- $$\omega_{j}-\Ad_{g_{ij}^{-1}}\omega_{i}=g_{ij}^{\ast}\theta\Longleftrightarrow\omega_{i}-\Ad_{g_{ji}^{-1}}\omega_{j}=g_{ji}^{\ast}\theta.$$
- $$r_{ij}(x)=y_j(x)-\rho\!\left(g_{ij}(x)^{-1}\right)y_i(x)-b_{ij}(x).$$
- $$\mathcal{L}_{\mathrm{aug}}=\mathcal{L}_{\mathrm{task}}+\sum_{(i,j)}\int_{U_i\cap U_j}\left[\left\langle\lambda_{ij}(x),r_{ij}(x)\right\rangle+\frac{\beta}{2}\left\|r_{ij}(x)\right\|_2^2\right]d\mu(x).$$

## Implementation notes

(1) Exact integration point. Choose a manifold with an explicit overlapping atlas, such as the sphere covered by two stereographic charts, a torus, or a periodic domain. Instantiate either one shared MLP with chart embeddings or separate local MLP heads \(f_i\); each head receives chart coordinates \(u_i(x)\) and outputs \(y_i(x)\in\mathbb{R}^d\). Insert the compatibility module immediately after the local heads and evaluate it at sampled points in chart overlaps. For a scalar trivial bundle use \(\rho(g)=1\) and \(b_{ij}=0\). For vector or connection-like outputs use a supplied matrix representation \(\rho(g_{ij}^{-1})\); for the paper's connection law use \(\rho=\Ad\) and \(b_{ij}=g_{ij}^{\ast}\theta\).

(2) Pseudocode. Sample task points \(x\) and overlap points \(x_{ij}\). Compute \(y_i=f_i(u_i(x))\), \(y_j=f_j(u_j(x))\), then compute \(A_{ij}=\rho(g_{ij}(x)^{-1})\) and \(r_{ij}=y_j-A_{ij}y_i-b_{ij}(x)\). Minimize \(L_{task}+\sum_{ij}[\lambda_{ij}^{\mathsf T}r_{ij}+(\beta/2)\|r_{ij}\|^2]\). After each primal optimizer step, update dual variables by \(\lambda_{ij}\leftarrow\lambda_{ij}+\eta_\lambda r_{ij}\), where \(\eta_\lambda\) is a dual step size. If memory is limited, maintain one multiplier vector per overlap sample batch instead of a persistent multiplier at every point. Increase \(\beta\) geometrically only when validation jump error stops decreasing.

(3) Mathematical versus empirical quantities. The atlas, transition functions \(g_{ij}\), representation matrices \(A_{ij}\), and offset \(b_{ij}\) are computed analytically from the chosen manifold and bundle. Estimate the overlap integral by Monte Carlo or quadrature. The task loss, \(\beta\), primal learning rate, dual learning rate, and overlap sampling density are empirical choices. Check the cocycle identity numerically by comparing direct and two-hop transformations, \(A_{ik}\) versus \(A_{jk}A_{ij}\), before training. For a genuine 1-form output, obtain local tangent bases from chart Jacobians and apply the compatibility residual to each coefficient vector.

(4) First cheap experiment. Use a two-chart stereographic atlas on \(S^2\) and train a small four-layer MLP to regress a known smooth tangent vector field from randomly sampled sphere points. Compare (a) one global latitude-longitude MLP, (b) two independent chart MLPs with no gluing, (c) two chart MLPs with a fixed penalty \(\|r\|^2\), and (d) the proposed augmented-Lagrangian model. Hold total parameter count and sample count fixed. Measure task MSE, maximum and mean overlap residual, sensitivity near chart boundaries, and accuracy under random sphere rotations. Success is lower boundary error and more uniform rotated-sphere accuracy than the global-coordinate baseline at equal parameter count; a useful target is at least a tenfold reduction in overlap residual at matched task MSE with no meaningful increase in inference cost beyond evaluating the active chart head. A second test can use the Hopf-fibration transition law, where the nonzero affine term tests whether the network learns genuinely gauge-consistent outputs rather than merely matching duplicated values.

## Verification

- Status: mech_ok_no_baseline
- Mechanism evidence: yes
- Mechanism confirmed: yes
- Practical verdict: harms
- Verdict: Built a two-chart periodic neural field with independent local MLPs, overlap residuals, fixed quadratic penalty, and augmented-Lagrangian dual updates. The toy math verified all three predictions: penalty residual 2/(1+beta), AL contraction |1-eta/(1+beta)|, and one-step annihilation at eta=1+beta, with relative errors at machine precision. In the neural comparison, AL reduced boundary residual to 0.000150 versus 0.000190 independent and 0.002876 penalty, but its mean overlap residual 0.009265 was worse than independent 0.001583 and penalty 0.005399; therefore the mechanism is confirmed, but a broad accuracy win is not established.

### Mechanism check

- Verdict: Built a two-chart periodic neural field with independent local MLPs, overlap residuals, fixed quadratic penalty, and augmented-Lagrangian dual updates. The toy math verified all three predictions: penalty residual 2/(1+beta), AL contraction |1-eta/(1+beta)|, and one-step annihilation at eta=1+beta, with relative errors at machine precision. In the neural comparison, AL reduced boundary residual to 0.000150 versus 0.000190 independent and 0.002876 penalty, but its mean overlap residual 0.009265 was worse than independent 0.001583 and penalty 0.005399; therefore the mechanism is confirmed, but a broad accuracy win is not established.
- Confidence: 8/10
- Limitations: The neural test used a scalar trivial bundle on a periodic circle with A=1 and b=0, not the sphere, connection 1-forms, nonzero affine Maurer-Cartan term, or nontrivial structure-group representation. It used one fixed seed and dataset, did not test random rotations, generalization, multiple seeds, adaptive beta, equal parameter counts, or rigorous equal-FLOP accounting. The independent model was already highly accurate on this easy target, limiting room for improvement.

### Practical benchmark

- Paired seeds: 8
- Baseline mean: 0
- Idea mean: 0
- p-value: 0.0081
- Paired wins: 0/8
- Benchmark verdict: idea worse (significant)

## Artifacts

- [bench_bundle_glued.py](https://synthcore.org/code/626/bench_bundle_glued.py)
- [bench_report.json](https://synthcore.org/code/626/bench_report.json)
- [bundle_glued_experiment.py](https://synthcore.org/code/626/bundle_glued_experiment.py)
- [periodic_atlas_track.py](https://synthcore.org/code/626/periodic_atlas_track.py)
- [report.md](https://synthcore.org/code/626/report.md)
- [report_bench_2026-08-31T201257.md](https://synthcore.org/code/626/report_bench_2026-08-31T201257.md)
- [results.json](https://synthcore.org/code/626/results.json)
- [sweep_tmp.py](https://synthcore.org/code/626/sweep_tmp.py)
- [Download all files as ZIP](https://synthcore.org/download/626)

## Disclaimer

AI-generated research hypothesis, automatically tested. Not peer-reviewed.