S-AI-Recursive: Convergent Recursive Reasoning
This article introduces S-AI-Recursive, a bio-inspired Sparse Artificial Intelligence architecture in which reasoning is implemented as a hormonally regulated closed-loop iteration rather than a single feed-forward pass. The Recursive Reasoning Cycle (RRC) is governed by two recursive hormones: Clarifine, a convergence signal, and Confusionin, a residual-uncertainty signal. Their antagonistic interaction regulates state refinement, stopping, resource allocation, and recursive-engram retrieval. The revised framework distinguishes hormonal-subsystem stability from joint cognitive state-hormone convergence and gives explicit sufficient conditions for coupled contraction on fixed-point-structured tasks. It also includes Lyapunov analysis, conditional entropic contraction, multi-signal stopping, Euler-Maruyama discretization with projection, constrained agent selection, and warm-start memory. Experimental evaluation combines controlled SAI-UT+ simulations with exactly verifiable task-level tests. On convergent Maze instances, adaptive stopping reduces mean depth from 20.00 to 11.31 iterations at unchanged resolution, a 43.4 percent reduction. On compatible recurring Sudoku instances, warm-start reduces mean depth from 18.39 to 2.00 cycles, saving 16.39 cycles at unchanged resolution. ARC-style tasks are used to assess operator portability rather than full benchmark performance. Robustness tests show an advantage over residual-only stopping on deceptive plateaus, but not under homogeneous Gaussian noise. These results support adaptive temporal parsimony, memory-assisted acceleration, and selected robustness under stated conditions, without establishing superiority over independently trained external architectures.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Necessary and Sufficient Conditions for Existence and Uniqueness of Recursive Utilities
We study existence, uniqueness and computability of solutions for a class of discrete time recursive utilities models. By combining two streams of the recent literature on recursive preferences---one that analyzes princi…
Tab-TRM: Tiny Recursive Model for Insurance Pricing on Tabular Data
We introduce Tab-TRM (Tabular-Tiny Recursive Model), a network architecture that adapts the recursive latent reasoning paradigm of Tiny Recursive Models (TRMs) to insurance modeling. Drawing inspiration from both the Hie…
Generative Recursive Reasoning
How should future neural reasoning systems implement extended computation? Recursive Reasoning Models (RRMs) offer a promising alternative to autoregressive sequence extension by performing iterative latent-state refinem…
Tiny Recursive Reasoning with Mamba-2 Attention Hybrid
Recent work on recursive reasoning models like TRM demonstrates that tiny networks (7M parameters) can achieve strong performance on abstract reasoning tasks through latent recursion -- iterative refinement in hidden rep…
Recursive Reasoning in Minimax Games: A Level $k$ Gradient Play Method
Despite the success of generative adversarial networks (GANs) in generating visually appealing images, they are notoriously challenging to train. In order to stabilize the learning dynamics in minimax games, we propose a…
GPUImage GenerationUnconditional Image Generation