# Connection-rank boundary bottleneck

- ID: 1482
- Canonical URL: https://synthcore.org/idea/1482/connection-rank-boundary-bottleneck
- API JSON: https://synthcore.org/api/idea/1482.json
- API Markdown: https://synthcore.org/api/idea/1482.md
- Verification status: unverified
- Source: [arXiv:2607.27198](https://arxiv.org/abs/2607.27198)
- Category: memory
- Solves: memory, scalability, generalization
- ML areas: graph-nn, embedding, memory, regularization
- Math tags: linear-algebra, tensor-decomposition, combinatorics, category-theory
- Ratings: usefulness 6/10; difficulty 7/10; novelty 7/10

## Idea description

Compress representations of graph fragments according to their empirical edge-connection rank instead of using a generic hidden dimension. For fragments with t open ends, learn only the quotient space of boundary behaviors that remain distinguishable after gluing, producing a compositional graph network whose boundary-state dimension is capped by an estimated R^t.

## Mathematical statement

For a graph parameter f and t-open-end fragments F,G, the edge-connection matrix is M_{f,t}(F,G)=f(F\ast G), where F\ast G glues corresponding open ends. The paper assumes f(\varnothing)=1 and \operatorname{rk}M_{f,t}\le R^t for every t\ge0. Define \Theta_t(F)=(G\mapsto f(F\ast G)) from finite formal combinations of t-fragments to their dual, and N_t=\ker\Theta_t. The quotient \mathbb C^{(\mathfrak F_t)}/N_t has dimension exactly \operatorname{rk}M_{f,t}\le R^t. Thus two fragments are equivalent when they have identical responses against every complementary fragment. In the ML adaptation, f is a learned scalar graph score or a vector of probe scores, and an empirical SVD estimates the observable quotient dimension. The exponential law R^t is used as a target for adaptive bottleneck size or as a rank-growth regularizer.

## Key formulas

- $$M_{f,t}(F,G)\coloneqq f(F\ast G),\qquad \operatorname{rk}M_{f,t}\le R^t,$$
- $$\Theta_t\colon\mathbb C^{(\mathfrak F_t)}\to\bigl(\mathbb C^{(\mathfrak F_t)}\bigr)^*,\qquad \Theta_t(F)=\bigl(G\mapsto f(F\ast G)\bigr),$$
- $$N_t=\ker\Theta_t,\qquad \dim\left(\mathbb C^{(\mathfrak F_t)}/N_t\right)=\operatorname{rk}M_{f,t}\le R^t,$$
- $$\widehat M_t=U_t\Sigma_tV_t^{\top},\qquad d_t=\#\{i:\sigma_i\ge\tau\},\qquad d_t\le \widehat R^{\,t}\ \text{(target bottleneck)}.$$

## Implementation notes

Apply this to a fragment-based graph network or a hierarchical graph transformer that cuts a graph into subgraphs with t boundary vertices. The exact integration point is the boundary-state tensor: instead of passing a generic d-dimensional vector for each fragment, construct a bank of complementary probes. For sampled t-fragments F_i and G_j, glue each pair along matching boundary ports and evaluate a scalar probe f_theta(F_i*G_j), such as the current graph-classification logit or several random readout projections. Form the empirical matrix \widehat M_t with entries f_theta(F_i*G_j), compute a randomized SVD, and retain the top d_t singular directions with threshold     au=\epsilon\sigma_1. Encode a fragment by coordinates in the retained left-singular basis, then compose two fragments with a learned bilinear map followed by projection back to that basis. Pseudocode: sample F_i,G_j; set \widehat M_t[i,j]=f_theta(glue(F_i,G_j)); compute U,S,V=rand_svd(\widehat M_t); set d_t=min(d_max,count(S>=    au)); compute z_F=U[:,1:d_t]^T probe(F); compute z_{F\circ H}=P_tB(z_F,z_H), where B is bilinear composition and P_t is retained-basis projection. Estimate \widehat R by fitting a line to \log d_t versus t, and penalize excess growth with \lambda\sum_t\max(0,\log d_t-t\log\widehat R)^2. The theorem supplies the quotient interpretation and exponential target; sampling, thresholding, and composition are empirical. First test on MUTAG or ZINC with hierarchical fragment cuts, comparing a fixed-width hierarchical GNN and DiffPool at equal memory. Measure peak activation memory, accuracy, singular-value spectra, and performance on graphs larger than training examples. Success is lower boundary-state memory with unchanged accuracy and stable large-graph extrapolation.

## Disclaimer

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