✗ Mechanism failed 2026

Shared Symbolic Mechanism Bottleneck

Implementation & benchmark of arXiv:2607.26528 — Shared Symbolic Backbones for Physically Consistent Multi-Output Symbolic Regression

Usefulness7/10
Difficulty5/10
Novelty7/10

Source paper: Shared Symbolic Backbones for Physically Consistent Multi-Output Symbolic Regression arXiv:2607.26528 ⓘ · analyzed Aug 31, 2026

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

Idea description

Replace the shared hidden trunk of a multi-output regression network with a small bank of differentiable symbolic units, then let every output use a sparse additive or multiplicative combination of the same units. The architecture explicitly tests whether outputs share a latent mechanism instead of merely sharing arbitrary neural features, improving identifiability and producing equations that can be inspected or exported.

Formulas

$$\boldsymbol{\phi}(\mathbf{x})=[\,x,\ 1/x,\ \log x,\ \ldots\,],\qquad \boldsymbol{\phi}\in\mathbb{R}^{n_f}$$
$$z_h=\sigma_h\!\left(w_h^{\top}(s_h\odot\boldsymbol{\phi}(\mathbf{x}))+b_h\right),\qquad \sigma_h\in\{\exp,(\cdot)^2,\mathrm{id},1/(\cdot),\log(1+\cdot),\sin,\sqrt{\cdot}\}$$
$$\hat y_j=c_j+\sum_{h=1}^{H}r_{jh}a_{jh}z_h,\qquad r_{jh}\in\{0,1\}$$
$$\mathcal{L}=\frac{1}{N}\sum_{i=1}^{N}\sum_{j=1}^{m}\ell\!\left(\hat y_j(\mathbf{x}_i),y_{ij}\right)+\lambda_r\sum_{j,h}|a_{jh}|+\lambda_s\sum_h\|s_h\|_0$$

Mathematical statement

The feature bank is \(\boldsymbol{\phi}(\mathbf{x})=[x,1/x,\log x,\ldots]\in\mathbb{R}^{n_f}\), where \(\mathbf{x}\) is the input and \(n_f\) is the number of engineered primitive features. Latent unit \(h\in\{1,\ldots,H\}\) has a binary feature mask \(s_h\in\{0,1\}^{n_f}\), continuous weights \(w_h\in\mathbb{R}^{n_f}\), bias \(b_h\in\mathbb{R}\), and operation \(\sigma_h\) selected from \(\{\exp,(\cdot)^2,\mathrm{id},1/(\cdot),\log(1+\cdot),\sin,\sqrt{\cdot}\}\). Its value is \(z_h=\sigma_h(w_h^\top(s_h\odot\boldsymbol{\phi}(\mathbf{x}))+b_h)\), where \(\odot\) is elementwise multiplication. For output \(j\in\{1,\ldots,m\}\), use a read-out mask \(r_j\in\{0,1\}^H\), coefficients \(a_j\in\mathbb{R}^H\), and bias \(c_j\): \(\hat y_j=c_j+\sum_{h=1}^H r_{jh}a_{jh}z_h\). The shared mechanism is the same \(z_h\) across all outputs. A trainable relaxation uses gates \(q_{jh}=\operatorname{sigmoid}(v_{jh})\) and penalizes \(\sum_{j,h}|q_{jh}a_{jh}|\) plus feature-gate sparsity \(\sum_h\|s_h\|_0\), approximated during training by continuous gates.

Implementation notes

Integrate this as the final shared representation and output head for a small multi-task regression model. (1) For a batch \(X\in\mathbb{R}^{B\times d}\), construct a numerically safe feature bank: standardized raw inputs, clipped reciprocals \(1/\operatorname{clip}(x,\epsilon,\epsilon^{-1})\), and \(\log(|x|+\epsilon)\). Create \(H\) units with learnable \(w_h,b_h\), continuous feature gates \(g_{hk}=\operatorname{sigmoid}(u_{hk})\), and operator logits \(o_{hk}\). Compute operator probabilities \(p_{hk}=\operatorname{softmax}(o_h/\tau)_k\), then evaluate \(z_h=\sum_k p_{hk}\sigma_k(w_h^\top(g_h\odot\phi(X))+b_h)\). Use safe implementations for reciprocal, logarithm, square root, and exponential with clipping. (2) Give output \(j\) coefficients \(a_{jh}\), bias \(c_j\), and read-out gates \(q_{jh}=\operatorname{sigmoid}(v_{jh})\), computing \(\hat y_j=c_j+\sum_h q_{jh}a_{jh}z_h\). (3) Optimize prediction loss plus \(\lambda_r\sum_{j,h}|q_{jh}a_{jh}|\), \(\lambda_s\sum_{h,k}g_{hk}\), and operator entropy \(\lambda_o\sum_{h,k}p_{hk}\log p_{hk}\). Anneal \(\tau\) from 1 to 0.05. After training, set gates above 0.5 to one, choose each operator by argmax, prune inactive units, and fine-tune the remaining continuous parameters. Optionally mutate one operator or gate at a time and retain a child only when validation loss plus a complexity penalty improves. The first cheap experiment should use a 3-output synthetic kinetics model with a shared denominator, such as \(y_j=\alpha_jx_j/(1+K_1x_1+K_2x_2)\), with 1,000 samples and 0% or 1% noise. Compare against independent MLP heads and a standard shared MLP trunk at equal parameter count. Record validation error, extrapolation error, active-unit count, and whether all outputs recover the same denominator. Success is equal or lower in-range error, lower extrapolation error, and substantially more consistent recovery of the common factor.

Verification

Mechanism failed

Stage 1 · Toy mechanism gate: Failed ✗

Stage 2 · Mechanism transferred to benchmark: Not tested

Stage 2 · Practical benchmark result: Not run

Methodology: Toy-system gate first; the benchmark stage runs only after a pass. How verification works

Stage 1 — Mechanism check agent confidence 9/10

Built the differentiable shared symbolic bottleneck with gated feature primitives, soft operator selection, sparse readouts, temperature annealing, and an MLP comparison. Three quantitative sanity predictions were confirmed: softmax entropy followed the temperature law, exact shared-latent reconstruction residual was 3.13e-32, and noise MSE tracked sigma^2. However, the trained symbolic model had far worse in-range MSE than the MLP (0.0801 vs 0.000285), did not recover a common denominator, and therefore the proposed learned mechanism did not demonstrate the claimed overall effect despite better extrapolation.

Agent confidence
9/10
Baseline
Shared MLP: in-range MSE 0.000284852; extrapolation MSE 0.00317361
Idea
Shared symbolic bottleneck: in-range MSE 0.0800653; extrapolation MSE 0.0449622; 5 active units; no common-denominator recovery
Mechanism checks
Softmax entropy matched analytic values across tau=1,0.5,0.25,0.1,0.05; shared-latent residual 3.13e-32; measured noise MSE for sigma=0.01,0.03,0.1 was 0.00010046,0.00090141,0.0100255 versus predictions 0.0001,0.0009,0.01

Limitations: Only one seed, one small synthetic kinetics setup, and one 500-epoch optimization configuration were tested. The exact shared-latent and noise checks validate algebraic consequences rather than proving that gradient training discovers the intended denominator; no hard pruning/fine-tuning or mutation search was evaluated.

How to run: python3 experiment.py

Verdict computed by deterministic test code from paired-seed statistics — not by the language model.

Artifacts

Implementation overview ⬇ Download all as ZIP 4 files · code, reports and structured results