← 研踪 PaperTrailarXiv:2609.37351 · v2
Typed Edge-Tensor Non-Reciprocal Port-Hamiltonian Deliberation for Counterfactual Open-World Deductive Reasoning
首次提交 2026-09-29 20:17
版本更新 2026-11-07 21:46
雷达观测 2026-11-10 11:14
摘要
Scaling test-time computation in continuous latent spaces offers an attractive alternative to verbose token-by-token generation for multi-step deductive reasoning. However, unregularized recurrent latent updates suffer from a deliberation drift cliff when rolled out beyond training horizons, while strictly energy-conserving or symmetric message-passing dynamics cannot break parent-to-child causal symmetry or suppress cyclic modus-ponens amplification on cyclic distraction graphs. We introduce Typed Edge-Tensor Non-Reciprocal Port-Hamiltonian Deliberation (TE-BPHD), a neuro-symbolic continuous-time latent reasoning architecture that couples skew-symmetric port-Hamiltonian conservation with relation-typed non-reciprocal directional transport and monotone dissipative damping on a semantic entity-state manifold. We prove (i) unconditional input-to-state stability and exponential contraction of autonomous rollouts across arbitrary inference depths without external norm projection, (ii) strict directional DAG reachability separation over symmetric message passing, and (iii) exact cycle-suppression margins under finite cyclic horn perturbations. Across counterfactual open-world deductive benchmarks (PrOntoQA-OOD up to depth 15, ProofWriter-OWA Cyclic at depths 5-10, FOLIO-Symbolic, and Cluttr-Relational), TE-BPHD eliminates the deep-horizon drift cliff, improves depth-10 cyclic reasoning accuracy to 90.0% (+/- 0.8%) over symmetric port-Hamiltonian and standard Transformer baselines, and supports zero-retraining adaptive Lyapunov halting that reduces average solver evaluations by 44% with negligible accuracy loss.
作者备注：16 pages, 4 figures, 6 tables
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-07 21:46 · 最新观测版本
Typed Edge-Tensor Non-Reciprocal Port-Hamiltonian Deliberation for Counterfactual Open-World Deductive Reasoning
Scaling test-time computation in continuous latent spaces offers an attractive alternative to verbose token-by-token generation for multi-step deductive reasoning. However, unregularized recurrent latent updates suffer from a deliberation drift cliff when rolled out beyond training horizons, while strictly energy-conserving or symmetric message-passing dynamics cannot break parent-to-child causal symmetry or suppress cyclic modus-ponens amplification on cyclic distraction graphs. We introduce Typed Edge-Tensor Non-Reciprocal Port-Hamiltonian Deliberation (TE-BPHD), a neuro-symbolic continuous-time latent reasoning architecture that couples skew-symmetric port-Hamiltonian conservation with relation-typed non-reciprocal directional transport and monotone dissipative damping on a semantic entity-state manifold. We prove (i) unconditional input-to-state stability and exponential contraction of autonomous rollouts across arbitrary inference depths without external norm projection, (ii) strict directional DAG reachability separation over symmetric message passing, and (iii) exact cycle-suppression margins under finite cyclic horn perturbations. Across counterfactual open-world deductive benchmarks (PrOntoQA-OOD up to depth 15, ProofWriter-OWA Cyclic at depths 5-10, FOLIO-Symbolic, and Cluttr-Relational), TE-BPHD eliminates the deep-horizon drift cliff, improves depth-10 cyclic reasoning accuracy to 90.0% (+/- 0.8%) over symmetric port-Hamiltonian and standard Transformer baselines, and supports zero-retraining adaptive Lyapunov halting that reduces average solver evaluations by 44% with negligible accuracy loss.
查看此版本解读 →查看此版本原文 ↗