Purpose & architecture
The shared implementation keeps hidden and memory vectors, splits input into steps and selects a basic RNN, LSTM or GRU update. It preserves the resulting state between calls. Train compares the output vector with the target using mean squared error.
Flags such as bidirectional are separate from the inspected forward switch, which selects only rnn, lstm or gru behavior. Their presence does not prove a second backward pass or every named architecture. Train itself returns a loss without updating weights.
This source generation
This record follows the claude/improve-math-logic-ehIW1 branch of Janady13/complete-agi-core at commit 33aa84f2aa61cedbe010240ada7f4efbdfe795a7. The snapshot identifies the source inspected in this audit. It is not a statement about which revision is currently running on a device.
| Field | Source record |
|---|---|
| Revision | 33aa84f2aa61cedbe010240ada7f4efbdfe795a7 |
| Branch | claude/improve-math-logic-ehIW1 |
| Recorded generation | Generator Core · recurrent |
Recovered implementation structure
These paths locate the components and entry points represented by this build. The source register contains their inspected revisions.
- generator_core/pkg/generators/recurrent/recurrent.go
Behavior & verification limits
Flags such as bidirectional are separate from the inspected forward switch, which selects only rnn, lstm or gru behavior. Their presence does not prove a second backward pass or every named architecture. Train itself returns a loss without updating weights.
Original project documentation
The following documentation is preserved as a dated source account. Claims in it retain the source’s wording and must be read alongside the implementation notes above.
Package recurrent implements recurrent generators (86-92) h_t = f(h_{t-1}, x_t) ═══════════════════════════════════════════════════════════════════════════════ RECURRENT GENERATOR BASE ═══════════════════════════════════════════════════════════════════════════════ RecurrentGenerator implements RNN-based generators NewRecurrentGenerator creates a new recurrent generator Initialize initializes the recurrent generator
Equations in this build
2 linked mathematical records. Each opens its notation, interpretation and source.
recurrent · h_t
This relation defines h_t in the source section “recurrent · h_t”. It specifies the displayed relationship between the named quantities or parameters. Its interpretation depends…
func (g *RecurrentGenerator) Initialize() error · rnnStep performs one RNN step: h
This relation defines rnnStep performs one RNN step: h in the source section “func (g *RecurrentGenerator) Initialize() error · rnnStep performs one RNN step: h”. It specifies the…