SKG: A Law-Induced Engine from Inference to Induction
This paper proposes the SKG (Symplectic-Kernel Gradient) reasoning engine for law-induced inference and induction. Laws are a priori; data provide instances. Inference is geometric evolution under law constraints. We organize symplectic geometry, GENERIC, kernel methods, RKHS, group-equivariant networks, and constrained mechanics into a unified, analyzable, implementable, verifiable framework. We propose the SKG octuple S = (M, g, omega, H, S, G, Delta, Pi), whose four components correspond to four levels of laws: conservation laws, constitutive relations, symmetry groups, and axiom systems. Main results: (1) Invariants enter metric construction via the Jacobian: g = J^T Sigma^-1 J + epsilon_G I. For constant cases, we establish inverse reconstruction theory: solvability rank condition (Thm 3.9), consistency criterion (Thm 3.11), and uniqueness theorem (Thm 3.14). (2) The kernel bandwidth matrix is uniquely determined by Fisher information and satisfies task-independence (Thm 3.19). (3) The metric reconstruction error decomposes into four terms (Thm 3.21), with squared condition number kappa(Sigma^*)^2 as the dominant amplification factor (Thm 3.22). (4) For state-dependent…
- arXiv
- 2610.19505
- Authors
- Jian An, Chaoshi Wu, Jinhui Wu
- Categories
- cs.LG