MetaMo Deep Dive

Approved by Ursula Addison on 2026-05-14

MetaMo is Hyperon's motivational framework — a system for modeling how an AGI's goals, priorities, and evaluative signals update over time while preserving coherence, stability, and interpretability. It replaces scalar reward functions with structured "motive geometries" and replaces hand-tuned drive hierarchies with mathematically grounded dynamics. This card provides technical depth beyond the concise MetaMo index card.

Authors:

Contributors:

Editors:

Papers: Lian & Goertzel (2025), MetaMo: A Robust Motivational Framework for Open-Ended AGI (AGI 2025); Lian & Goertzel (2025), Embodying Abstract Motivational Principles in Concrete AGI Systems (AGI 2025); Goertzel (2025), Hyperon Whitepaper §5.10; Cai, Goertzel, Geisweiller (2011), OpenPsi

Status: MetaMo is under development. The theoretical framework is described in the AGI 2025 papers. A Python reference implementation exists (MetaMo-Python). The predecessor OpenPsi framework is operational in hyperon-openpsi.

Related cards: PLN (motivation-guided inference), ECAN (attention allocation), PRIMUS (goal management layer), Self-Modification and Safety (goal stability)

Core Mechanisms and Formalism

Motivational State

MetaMo represents motivation as a structured interaction between goal intensities and modulatory variables. Formally, the motivational state is an object \(X = G \times M\) in a category \(\mathcal{C}\), where \(G = (g_1, \ldots, g_P)\) is a vector of goal intensities and \(M = (\mu_1, \ldots, \mu_K)\) is a vector of modulator parameter values. The state includes:

  • Goal vectors: 8-dimensional representations of active goal intensities (e.g., competence, affiliation, energy)
  • Modulator vectors: 6-dimensional representations of modulatory variables (valence, arousal, risk sensitivity, ethical vigilance, social drive, energy level)
  • Dual overgoals: Two meta-level drives — Individuation (maintaining coherent identity) and Transcendence (evolving beyond current limits)

Appraisal and Decision

MetaMo explicitly couples two processes:

  • Appraisal updates modulators in response to contextual novelty and task relevance — assessing "what's happening and how does it matter?"
  • Decision scores candidate actions relative to active goals and current modulators — determining "what should I do about it?"

The critical insight is that these processes interact asymmetrically: "feeling then choosing" differs slightly from "choosing then feeling."

Pseudo-Bimonad Structure

MetaMo models cognitive motivation through a pseudo-bimonad coupling two components:

  • Appraisal comonad (\(\Psi\)): Equipped with counit \(\varepsilon\) (extract current assessment) and comultiplication \(\delta\) (extend assessments to broader contexts). Maps \(\Psi(X) \to X\).
  • Decision monad (\(D\)): Equipped with unit \(\eta\) (embed a state into a decision context) and multiplication \(\mu\) (flatten nested decisions). Maps \(X \to D(X)\).

These are linked by a lax distributive law \(\lambda_X : \Psi(D(X)) \Rightarrow D(\Psi(X))\). The composite \(F = D \circ \Psi\) inherits both monad and comonad structure. A motivational coalgebra \(\alpha : X \to F(X)\) governs one full cycle of appraisal plus decision.

The decision side of this coupling is not original to MetaMo. The Goertzel & Lian 2025 papers credit it to MAGUS — the hierarchical decision-and-goal system of Mikeda & Watkins (2024) — as the inspiration for the Decision monad; the reference implementation reflects this directly in its concrete MagusDecision component (magus/decision.py).

Stability Guarantees

  • Contractive update law: Small disturbances fade via damping, with tighter control near boundary conditions. Prevents runaway dynamics without external safety constraints.
  • Tubular topology: Any achievable target motivational state lies on a "thick, feasible path" of incremental steps — gradual convergence guaranteed, no discontinuous jumps.

Five Design Principles

  1. Modular Appraisal-Decision Interface: Separate mood updates from goal selection with controlled feedback
  2. Homeostatic Drive Stability: Apply damping so small disturbances fade
  3. Reciprocal State Simulation: Share state-translation maps for multi-agent empathy and hand-off
  4. Parallel Motivational Compositionality: Run multiple motivational subsystems in parallel, merge with small coherence corrections
  5. Incremental Objective Embodiment: Blend partway toward preferred states each cycle, guaranteeing gradual convergence

Implementation Backing

A 2026-05-06 source-code review of the Goertzel & Lian 2025 MetaMo papers and the reference implementations assessed iCog-Labs-Dev/MetaMo-Python(HEAD3ec409b ) as a paper-leaning hybrid: an implementation-backed core, but a reference implementation rather than production code. The formalism above has direct reference-code anchors at the skeleton level, with one important caveat.

The core state/operator skeleton is implemented:

  • \(X = G \times M\) — core/state.py:8 (class MotivationalState with NUM_GOALS=8, NUM_MODULATORS=6 at core/config.py:1-7)
  • Appraisal comonad \(\Psi\) — category/functors.py:7 (class AppraisalComonad); concrete OpenPsiAppraisal(AppraisalComonad) at openpsi/appraisal.py:17
  • Decision monad \(D\) — category/functors.py:32 (class DecisionMonad); concrete MagusDecision(DecisionMonad) at magus/decision.py
  • Composite \(F = D \circ \Psi\) — category/bimonad.py:12 (class MetaMoPseudoBimonad)
  • Lax distributive law \(\lambda_X\) check — category/bimonad.py:42 (check_lax_distributive_law; bounds numerical distortion ≤ LAX_DISTRIBUTIVE_DELTA, NOT a categorical proof)
  • Parallel-merge / lax-monoidal structure — category/bimonad.py:62 (parallel_merge)
  • Safe-region + boundary-band — dynamics/stability.py:18 + :43
  • Contractive update law — dynamics/stability.py:54 (check_contractive_update_law)
  • Homeostatic damping (Principle 4) — dynamics/stability.py:84 (apply_homeostatic_damping)
  • Blend factor + incremental embodiment (Principle 5) — dynamics/coherence.py:10 + :24
  • Translation functor (Principle 2) — category/functors.py:57 (class TranslationFunctor); applied at applications/research_assistant.py:88 via simulate_peer (the demo uses an identity translation matrix, so Principle 2 is only a skeleton implementation here — the class runs, but the demo is degenerate)

The categorical laws (monad/comonad coherence, lax distributive law, pseudo-bimonad equations) are, by contrast, paper-only: they are described in the paper and named in the code, but the code checks numeric distortion under sample inputs, not categorical coherence. There is no formal proof apparatus and no checked-in test suite (rg --files for tests in MetaMo-Python returns nothing; AGENTS.md:23 confirms no formal test suite).

This split also explains why MetaMo-Python is best read as a reference implementation, not production: it is small enough to map paper concepts to executable references, but it does not bind to MeTTa/AtomSpace, has no Hyperon runtime integration, and treats the principles as demo logic rather than validated system behavior. Production-grade MetaMo over Hyperon remains a roadmap item (see Status and Resources).

Provenance: the implementation-backing assessment comes from a 2026-05-06 source-code review; the extraction archive is at scripts/archive/non_clustered_haa_pilot/source2_metamo_paper/.

Status and Resources

Last verified: 2026-06-05

System Interfaces

  • PLN: MetaMo biases inference search toward contextually appropriate goals
  • SubRep: MetaMo defines what the system cares about; SubRep validates which skills serve those motives. Together they form PRIMUS's goal management layer.
  • ECAN: MetaMo's goal priorities influence attention allocation, directing STI toward goal-relevant atoms
  • TransWeave: MetaMo's motive signals guide transfer decisions across cognitive paradigms

Implementation Anchors

The MetaMo-related repositories fall into three distinct roles — a formal reference, a heuristic prototype, and a predecessor substrate. They should be distinguished rather than collapsed into a single "implementation":

  • Primary formal reference: iCog-Labs-Dev/MetaMo-Python (Python; HEAD 3ec409b; ~33 commits, primary committer Nahom Senay). A compact reference implementation of the MetaMo categorical skeleton: MotivationalState (\(X = G \times M\)), AppraisalComonad + DecisionMonad ABCs, MetaMoPseudoBimonad composition, a lax-distributive-law numeric check, parallel_merge, the contractive update law, homeostatic damping, blend-states, and a research_assistant.py interactive demo with OpenPsiAppraisal + MagusDecision + TranslationFunctor. The categorical skeleton is implementation-backed; the categorical proofs remain paper-only. There is no test suite (per AGENTS.md:23). See Core Mechanisms and Formalism for file:line citations.
  • Heuristic prototype: glicerico/MetaMo-Prototype (Python; ~24 commits, forked from dagemawinegash/MetaMo-Prototype, primary committer Dagemawi Bekele). An active LangGraph/LLM rewrite with rich goal/modulator dynamics in engine.py. It has no formal categorical structure — searches at HEAD for "bimonad" / "comonad" / "MAGUS" / "OpenPsi" return zero matches. Useful as a heuristic routing engine, but not a duplicate of MetaMo-Python and not the categorical implementation.
  • Predecessor OpenPsi substrate: iCog-Labs-Dev/hyperon-openpsi (MeTTa/Python; HEAD 3b356c5; ~575 commits). A mature MeTTa OpenPsi implementation with traditional MindAgent + Demand/Modulator patterns and use cases (ping-pong, a curious agent with LLM integration, a qwestor web API). It is not the primary MetaMo implementation at HEAD — searches for "MetaMo" / "MAGUS" / "individuation" / "transcendence" return zero matches, and the recent OpenPsi paper-alignment work (commit 01936f1, 2026-02-24) is OpenPsi-side, not MetaMo-side. This is the operational substrate that MetaMo's appraisal comonad abstracts one level higher.
  • Prolog-port variant: iCog-Labs-Dev/PeTTa-OpenPsi — a Prolog-based MeTTa port with A* and Thompson-sampling planners and a NARS-based trading-agent use case. An operational variant of the OpenPsi substrate, separate from the three roles above.

Current Status

  • Operational: hyperon-openpsi (MeTTa OpenPsi substrate, with use cases); MetaMo-Python (Python reference implementation, demo-grade); MetaMo-Prototype (heuristic engine, separate paradigm); PeTTa-OpenPsi (Prolog port variant)
  • Under development: Formal pseudo-bimonad proofs; MeTTa-native MetaMo integration with AtomSpace and PLN; production Hyperon runtime binding
  • Proposed: Multi-agent coordination via MetaMo (Reciprocal State Simulation beyond the identity-matrix demo); verification methods for motivational stability; benchmarking against alternative AI motivation approaches

Open Problems / Research Directions

  • Formalizing and proving stability via contractive updates in the full pseudo-bimonad structure (categorical proofs, not just numeric distortion checks)
  • Embedding MetaMo into Hyperon AtomSpace for motivation-guided PLN inference
  • Multi-agent MetaMo — coordinating motivational state via reciprocal state simulation with non-trivial translation functors
  • Blending dynamics between MetaMo's motive geometries and SubRep's option certificates
  • Temporal goal reasoning — implementing PredictiveImplication-style temporal windows (an inherited gap from the OpenPsi 2016 review)
  • A MetaMo-side test suite (currently absent per AGENTS.md:23 in MetaMo-Python)

Primary Sources

  • Goertzel, B. and Lian, R. (2025). MetaMo: A Robust Motivational Framework for Open-Ended AGI. AGI 2025.
  • Goertzel, B. and Lian, R. (2025). Embodying Abstract Motivational Principles in Concrete AGI Systems. AGI 2025.
  • Goertzel, B. (2025). Hyperon for AGI⇒ASI Whitepaper, §5.10: MetaMo.
  • Mikeda (2024). MAGUS. (An external decision-theory framework cited in the AGI 2025 paper as the decision-monad component of the MetaMo bimonad; see Historical Lineage for the boundary statement.)
  • Cai, Z., Goertzel, B., and Geisweiller, N. (2011). OpenPsi. AGI 2011.
  • See also: BBM Publication Map for the CogPrime→Hyperon correspondence.

Provenance: the three-role classification of the MetaMo repositories comes from a 2026-05-06 source-code review; the extraction archive is at scripts/archive/non_clustered_haa_pilot/source2_metamo_paper/.

History and design lineage →




- Related cards: PLN Full (motivation-guided inference), ECAN Full (attention allocation), PRIMUS Full (goal management layer) - these cards are open for editing, but nothing is there

 

- [PAPER-LEANING-HYBRID] / [IMPLEMENTATION-BACKED-CORE] / [REFERENCE-IMPLEMENTATION-NOT-PRODUCTION] verdict against iCog-Labs-Dev/MetaMo-Pythonat3ec409b HEAD - link not found. + [titles] are confusing - what are they pointing to?

 

(OpenPsi-review, 2016) - link to paper would be nice. Also OpenPsi deserves its own page

 

 

The decision side of MetaMo's pseudo-bimonad (

D

D in

F

=

D

∘

Ψ

F=D∘Ψ) is not a Goertzel/Lian invention. The AGI 2025 second paper (Embodying Abstract Motivational Principles, §2 + conclusion, reference [8]) attributes MAGUS — the hierarchical decision/goal system — to Mikeda 2024 -

Mikeda and Watkins. Also a more correct way to say - not invention, but inspired by.. and link to Magus would be useful here

 

 

OpenPsi's executable substrate (in hyperon-openpsiat3b356c5 HEAD ) - leads to page not found

Anna.....2026-05-08 11:22:40 UTC