{
 "artifacts": null,
 "category": "geometry",
 "description": "Use signed spanning-forest minor numerators to encourage a graph-structured neural layer to preserve independent multi-coordinate responses instead of collapsing several outputs onto the same direction. The determinant coefficients are only 0 or ±1, making the regularizer combinatorial and sign-exact rather than a noisy learned determinant surrogate.",
 "formulas_latex": [
  "$$L=(D^{T}K^{-1}D)^{-1},\\qquad Z:=D^{T}K^{-1}D.$$",
  "$$B_F=Q_FD,\\qquad \\widehat{\\chi}_F(I)=\\det\\!\\begin{pmatrix}B_F\\\\ E_I^{T}\\end{pmatrix}\\in\\{0,\\pm1\\}.$$",
  "$$N_{I,J}=\\sum_{F}w(F)\\,\\widehat{\\chi}_F(I)\\widehat{\\chi}_F(J),\\qquad w(F)=\\prod_{e\\in F}c_e.$$",
  "$$\\mathcal L_{\\mathrm{minor}}=-\\frac{1}{|\\mathcal P|}\\sum_{(I,J)\\in\\mathcal P}\\log\\!\\left(\\frac{|N_{I,J}|+\\epsilon}{N_{\\varnothing,\\varnothing}+\\epsilon}\\right).$$"
 ],
 "id": 3021,
 "implementation": "Integrate this into a graph-attention or message-passing block whose routing structure is a fixed sparse graph. Represent each node feature group as a virtual dipole coordinate: construct D by placing +1 at the source node, -1 at the reference or target node, and zero elsewhere. Let each trainable positive edge conductance be c_e=softplus(theta_e)+epsilon, and construct the grounded Laplacian K with K_uu=sum_{e incident to u}c_e and K_uv=-c_uv. For the first experiment use graphs with at most 12 nodes, enumerate spanning forests or spanning trees, form Q_F by assigning every vertex its contracted component index, compute B_F=Q_FD, and evaluate the exact 0/±1 determinant chi_hat_F(I). Accumulate N_{I,J} over randomly chosen 2- and 3-coordinate subsets; use the normalized negative log-minor term shown above together with the task loss. The denominator N_emptyset is the total forest weight and can be computed by a matrix-tree determinant rather than enumeration once the MVP is validated. The network can either use L=(D^TK^{-1}D)^{-1} as a learned graph mixing matrix or use N only as an auxiliary regularizer on the corresponding output Jacobian. Estimate no signs empirically: all signs come from the exact incidence determinant; only conductances and task gradients are learned. Test a 2-layer GNN on Cora or a 4-layer graph Transformer on synthetic tree-versus-cycle classification, comparing ordinary weight decay, log-determinant regularization, and this forest-minor loss at matched parameter count. Track validation accuracy, smallest singular value of the coordinate-response Jacobian, condition number of K, and gradient explosion frequency. Success is higher accuracy with a larger minimum singular value and fewer collapsed output coordinates at equal training cost.",
 "math_summary": "Let K be the grounded weighted Laplacian of a connected physical graph, D the matrix whose columns encode independent virtual voltage-difference or dipole coordinates, and Z=D^T K^{-1}D. The superport response is L=Z^{-1}. For a spanning forest F, contract each component to obtain a quotient port multigraph H_F, let Q_F be its reduced component-incidence map, and define B_F=Q_FD. If I is a k-element coordinate set and E_I^T is the selector matrix containing rows of the k-dimensional identity indexed by I, the completed quotient-incidence determinant is chi_hat_F(I)=det([B_F;E_I^T]). Every column of B_F is 0, ±e_a, or e_a-e_b, so chi_hat_F(I) is in {0, ±1}; it is nonzero exactly when the complementary quotient edges form a spanning tree of H_F. For coordinate sets I,J of equal size, the paper's arbitrary response-minor theorem assigns each forest the signed coefficient chi_hat_F(I)chi_hat_F(J), so a minor numerator has the form N_{I,J}=sum_F w(F)chi_hat_F(I)chi_hat_F(J), with w(F)=product_{e in F}c_e. Use these exact signed sums to reward independent, non-collapsed coordinate responses in a neural graph layer.",
 "math_tags": [
  "graph-theory",
  "linear-algebra",
  "combinatorics",
  "spectral-theory"
 ],
 "ml_areas": [
  "graph-nn",
  "attention",
  "regularization",
  "initialization"
 ],
 "paper": {
  "arxiv_id": "2609.01672",
  "arxiv_url": "https://arxiv.org/abs/2609.01672",
  "summary_what_math_gives_to_ml": "The paper provides an unusually concrete bridge between electrical-network determinants, graphic incidence, and negatively dependent subset measures. Its most transferable asset is that arbitrary determinant minors can be expanded over spanning forests with coefficients in exactly {0, ±1}, while the associated unsigned principal numerators form a real-stable multiaffine polynomial and therefore a strongly Rayleigh distribution. This suggests structured dropout or pruning schemes that preserve diversity through negative dependence rather than independently deleting features, as well as determinant-based regularizers for graph-structured neural modules. The constructions are most practical on small or sparse dependency graphs, where matrix-tree or Laplacian determinant evaluations replace explicit forest enumeration.",
  "title": "All-Minors Matrix-Tree Theory for Superport Networks: Completed Quotient-Incidence Determinants and Conductance-Weighted Subdivision Extensions",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 6,
  "novelty": 7,
  "usefulness": 6
 },
 "solves": [
  "accuracy",
  "stability",
  "generalization"
 ],
 "title": "Graphic-Minor Diversity Regularizer",
 "url": "https://synthcore.org/idea/3021/graphic-minor-diversity-regularizer",
 "verification": {
  "peer_reviewed": false,
  "status": "unverified",
  "status_label": "Unverified",
  "verdict_source": "deterministic test code (paired-seed permutation statistics)",
  "verification_axes": {
   "benchmark_mechanism": {
    "confirmed": null,
    "tested": false
   },
   "practical_benchmark": {
    "beats_baseline": null,
    "tested": false
   },
   "toy_mechanism_gate": {
    "confirmed": null,
    "tested": false
   }
  }
 }
}