{
 "artifacts": null,
 "category": "dynamics",
 "description": "Replace an unconstrained graph-message-passing block with a port-Hamiltonian layer whose edge interactions are generated by a skew-symmetric formation-matrix coupling and whose node damping is positive semidefinite. The layer can model relative graph structure while preventing unforced hidden-state energy growth, reducing exploding activations and oversmoothing caused by arbitrary repeated propagation.",
 "formulas_latex": [
  "$$\\begin{bmatrix}\\dot r\\\\\\dot f\\end{bmatrix}=\\begin{bmatrix}0\u0026-\\mathcal{F}(r)^T\\\\\\mathcal{F}(r)\u00260\\end{bmatrix}\\begin{bmatrix}\\dot r\\\\f\\end{bmatrix}+\\begin{bmatrix}\\nu\\\\0\\end{bmatrix},\\qquad \\zeta=\\mathcal{F}(r)\\dot r$$",
  "$$\\zeta^Tf+\\dot r^T\\dot p=0$$",
  "$$\\dot h=[J(h)-R(h)]\\nabla H(h),\\quad J^T=-J,\\quad R\\succeq0,\\qquad \\dot H=-\\nabla H(h)^TR(h)\\nabla H(h)\\leq0$$",
  "$$h_{k+1}=h_k+\\Delta t\\,[J(h_k)-R(h_k)]\\nabla H(h_k),\\qquad \\Delta t\u003c\\frac{2}{\\lambda_{\\max}(M^{-1/2}RM^{-1/2})}$$"
 ],
 "id": 3165,
 "implementation": "Integrate this as a replacement for one or more residual message-passing blocks in a graph neural network. Let each node carry hidden state $h_i\\in\\mathbb{R}^d$ and let each graph edge $(i,j)$ carry an edge state or force $f_{ij}$. Build a learned formation operator $F_\\theta(h)$ from relative node features, with one row per edge; its action can approximate edge differences, for example $F_\\theta h=\\{W_e(h_i-h_j)\\}_e$. Construct the node-edge interconnection explicitly as $J_F=\\begin{bmatrix}0\u0026-F_\\theta^T\\\\F_\\theta\u00260\\end{bmatrix}$, which is skew-symmetric by construction. Use energy $H_\\theta(h)=\\frac12h^TM_\\theta^{-1}h+\\sum_e\\psi_{e,\\theta}(f_e)$ with diagonal positive masses parameterized by softplus, and parameterize damping as $R_\\theta=L_\\theta L_\\theta^T$ rather than learning an unrestricted matrix. The update is: compute $F$ from edges; compute $g=\\nabla H$; compute $v=(J_F-R)g$; update $h\\leftarrow h+\\Delta t v$. Estimate $\\lambda_{\\max}$ by 5-10 power iterations and clip or adapt $\\Delta t$ below $2/\\lambda_{\\max}(M^{-1/2}RM^{-1/2})$. The paper supplies the power-preserving interconnection and energy argument; the neural energy, edge feature map, and damping factors are learned. First test on Cora or a synthetic spring-graph node-classification task with 20-50 repeated layers, comparing an unconstrained GNN, an antisymmetric GNN, and this layer. Measure hidden energy $H_k$, gradient norms, accuracy, and failure rate while sweeping $\\Delta t$. The prediction is that the unforced layer has non-increasing energy up to numerical error, and instability should appear near the predicted explicit-Euler boundary $\\Delta t_c\\approx2/\\lambda_{\\max}(M^{-1/2}RM^{-1/2})$; measured divergence should occur within 20% of this value, while the skew-only variant should show bounded but non-decaying energy.",
 "math_summary": "For node state $r\\in\\mathbb{R}^{2n}$ and edge force vector $f\\in\\mathbb{R}^{m}$, the paper introduces a formation matrix $\\mathcal{F}(r)$ that maps node velocities to edge velocities, $\\zeta=\\mathcal{F}(r)\\dot r$. Its interconnection subsystem uses the skew-symmetric matrix $\\begin{bmatrix}0\u0026-\\mathcal{F}(r)^T\\\\\\mathcal{F}(r)\u00260\\end{bmatrix}$, implying the power identity $\\zeta^Tf+\\dot r^T\\dot p=0$. A port-Hamiltonian neural layer should use $\\dot h=[J(h)-R(h)]\\nabla H(h)$, where $h$ is the concatenated node hidden state, $J(h)^T=-J(h)$ is the graph interconnection, $R(h)\\succeq0$ is damping, and $H(h)\\geq0$ is the learned energy. Then $\\dot H=-\\nabla H^TR\\nabla H\\leq0$ in the absence of external input. For a quadratic energy $H(h)=\\frac12h^TM^{-1}h$, $M\\succ0$, choosing $J$ from edge incidence or formation operators and $R=L_RL_R^T$ gives a computable stability certificate.",
 "math_tags": [
  "control-theory",
  "dynamical-systems",
  "graph-theory",
  "optimization",
  "linear-algebra"
 ],
 "ml_areas": [
  "graph-nn",
  "training-dynamics",
  "optimizer"
 ],
 "paper": {
  "arxiv_id": "2609.04158",
  "arxiv_url": "https://arxiv.org/abs/2609.04158",
  "summary_what_math_gives_to_ml": "The paper provides a constructive port-Hamiltonian formation mechanism in which graph edges are represented by spring-damper energy elements and agents are coupled through a formation matrix. The key transferable asset is a power-preserving interconnection: the skew-symmetric graph coupling redistributes energy without creating it, while a positive-semidefinite dissipation matrix guarantees non-increasing total energy. This can be converted into a graph neural network or neural ODE layer whose message passing is constrained to be skew-symmetric and whose damping is positive semidefinite, yielding a directly testable stability certificate for deep message-passing dynamics.",
  "title": "Formation Matrix and Energy-based Control of Multi-Agent Systems",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 5,
  "novelty": 6,
  "usefulness": 8
 },
 "solves": [
  "stability",
  "accuracy"
 ],
 "title": "Power-Preserving Formation GNN",
 "url": "https://synthcore.org/idea/3165/power-preserving-formation-gnn",
 "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
   }
  }
 }
}