# Discriminant-Gated Positive Edge Adaptation

- ID: 2291
- Canonical URL: https://synthcore.org/idea/2291/discriminant-gated-positive-edge-adaptation
- API JSON: https://synthcore.org/api/idea/2291.json
- API Markdown: https://synthcore.org/api/idea/2291.md
- Verification status: failed_benchmark
- Source: [arXiv:2608.14439](https://arxiv.org/abs/2608.14439)
- Category: regularization
- Solves: stability, accuracy
- ML areas: graph-nn, optimizer, regularization, training-dynamics
- Math tags: spectral-theory, linear-algebra, graph-theory, optimization, dynamical-systems
- Ratings: usefulness 7/10; difficulty 7/10; novelty 8/10

## Idea description

Make directed edge weights trainable while constraining optimization to remain away from eigenvalue collisions of the graph Laplacian. The network can learn task-specific interaction strengths while preserving a measurable diagonalizability margin and avoiding ill-conditioned modal dynamics.

## Mathematical statement

For trainable edge parameters theta_e, use strictly positive weights omega_e=omega_min+softplus(theta_e), and construct L(theta). Let r be the algebraic multiplicity of the zero eigenvalue and q_theta(s)=det(sI-L(theta))/s^r. A repeated nonzero eigenvalue occurs when q_theta and its derivative share a root, equivalently Disc(q_theta)=0. In practice define the normalized nonzero eigenvalue gap g(theta) as the minimum pairwise distance divided by the eigenvalue magnitudes. Penalize violations of g(theta)>=g_min and optionally penalize the eigenvector condition number kappa(V), because near-collisions produce unstable modal coordinates even before exact defectiveness.

## Key formulas

- $$\omega_e(\theta_e)=\omega_{\min}+\operatorname{softplus}(\theta_e),\qquad L(\theta)=D(\theta)-A(\theta).$$
- $$q_\theta(s)=\frac{\det(sI-L(\theta))}{s^r},\qquad \operatorname{Disc}(q_\theta)=0\Longleftrightarrow\exists s:\ q_\theta(s)=q_\theta'(s)=0.$$
- $$g(\theta)=\min_{i\ne j,\ \lambda_i,\lambda_j\ne0}\frac{|\lambda_i-\lambda_j|}{1+|\lambda_i|+|\lambda_j|},\qquad \mathcal{L}_{\mathrm{gap}}=\beta[\max(0,g_{\min}-g(\theta))]^2.$$
- $$\theta_{k+1}=\theta_k-\eta\nabla_\theta\left(\mathcal{L}_{\mathrm{task}}+\mathcal{L}_{\mathrm{gap}}+\gamma\log(1+\kappa(V(\theta)))\right).$$

## Implementation notes

Integration point: attach trainable positive edge gates to a directed GCN, graph transformer bias, graph neural ODE, or graph state-space transition. Use omega_e=omega_min+softplus(theta_e), with omega_min small but nonzero. Recompute the Laplacian spectrum every K optimizer steps, initially K=10, rather than for every minibatch. Pseudocode: `omega=softplus(theta)+omega_min; L=build_in_laplacian(omega); eig,V=eig(L); nonzero=remove_zero_modes(eig); gap=min_normalized_pairwise_gap(nonzero); barrier=relu(g_min-gap)^2; cond=log(1+condition_number(V)); loss=task_loss+beta*barrier+gamma*cond; backward(loss); optimizer.step()`. For graphs with at most 64 nodes, additionally compute the characteristic polynomial and its discriminant; for larger graphs use Arnoldi or stochastic subspace iteration to estimate the smallest eigenvalue gap. The paper supplies positivity and the repeated-root discriminant boundary; numerical eigensolvers estimate gaps, condition numbers, and gradients. First experiment: train a two-layer directed GCN on synthetic directed stochastic block graphs and Cora, comparing unconstrained positive gates, fixed paper-designed weights, and gap-gated gates. Sweep g_min over 1e-4, 1e-3, and 1e-2. Prediction: as g(theta) approaches zero, eigenvector conditioning and modal reconstruction error rise sharply; the gated model maintains g(theta)>=g_min. On small graphs, the first exact loss of diagonalizability must coincide with Disc(q_theta)=0 within numerical tolerance. A useful falsification is failure to observe this spectral transition or absence of improved long-horizon stability despite preserved gaps.

## Verification

- Status: failed_benchmark
- Mechanism evidence: yes
- Mechanism confirmed: no
- Practical verdict: inconclusive
- Verdict: Built a positive-weight directed-Laplacian toy implementing softplus edge weights, normalized spectral-gap measurement, discriminant evaluation, conditioning diagnostics, and gap-gated optimization. The sweeps matched the predictions: gap scales as epsilon^1 (observed 1.000000), the nonzero characteristic-polynomial discriminant scales as epsilon^2 (observed 2.000000), and condition(V)*epsilon is approximately constant (1.568 to 1.558). At exact collision, Disc(q)=0 and the repeated eigenvalue has algebraic multiplicity 2 but eigenspace nullity 1, confirming defectiveness. In optimization, the unconstrained positive model reached task loss 1.23e-32 but gap approximately 3.7e-17 and condition number 2.66e16; the g_min=0.03 gated model reached gap 0.0414, condition 24.4, and task loss 0.00772. Thus the proposed mechanism manifested clearly, though this is not evidence of a downstream accuracy win.

### Mechanism check

- Verdict: Built a positive-weight directed-Laplacian toy implementing softplus edge weights, normalized spectral-gap measurement, discriminant evaluation, conditioning diagnostics, and gap-gated optimization. The sweeps matched the predictions: gap scales as epsilon^1 (observed 1.000000), the nonzero characteristic-polynomial discriminant scales as epsilon^2 (observed 2.000000), and condition(V)*epsilon is approximately constant (1.568 to 1.558). At exact collision, Disc(q)=0 and the repeated eigenvalue has algebraic multiplicity 2 but eigenspace nullity 1, confirming defectiveness. In optimization, the unconstrained positive model reached task loss 1.23e-32 but gap approximately 3.7e-17 and condition number 2.66e16; the g_min=0.03 gated model reached gap 0.0414, condition 24.4, and task loss 0.00772. Thus the proposed mechanism manifested clearly, though this is not evidence of a downstream accuracy win.
- Confidence: 9/10
- Limitations: Only a 3-node directed path and a synthetic quadratic task were tested; no directed GCN, stochastic minibatches, Cora, long-horizon dynamics, FLOP/speed comparison, condition-number penalty, characteristic-polynomial numerical stability study, or multi-seed statistical evaluation was performed.

### Practical benchmark

- Paired seeds: 8
- Baseline mean: 0
- Idea mean: 0
- p-value: 0.30765
- Paired wins: 3/8
- Benchmark verdict: no significant win

## Artifacts

- [bench_experiment.py](https://synthcore.org/code/911/bench_experiment.py)
- [experiment.py](https://synthcore.org/code/911/experiment.py)
- [report.md](https://synthcore.org/code/911/report.md)
- [report_bench_2026-09-01T145228.md](https://synthcore.org/code/911/report_bench_2026-09-01T145228.md)
- [results.json](https://synthcore.org/code/911/results.json)
- [Download all files as ZIP](https://synthcore.org/download/911)

## Disclaimer

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