scroll, or use ↑ ↓ / space
Artificial Organisms · Lab Update

One organism,
many theories.

An artificial organism is a computational agent we build so we can study behavior by constructing it (e.g., Feynman, "what I cannot create, I do not understand"). This update lays out where this line of research sits. We build organisms from first principles, animate them with different learning theories, and ask whether each reproduces behavior we already measure in the laboratory. The pieces below are clickable; each jumps to its section.

MPRQ-LearningETBDBrunt–VäisäläMolecular dynamicsEmpirical / ML
An artificial organism living out its energy budget
Where the work sits

The landscape of artificial organisms in behavior analysis

Every effort to build an artificial organism in behavior analysis can be placed by two questions: what is its algorithmic style (horizontal, from symbolic and heuristic, through stochastic and dynamical, to connectionist, reinforcement, and evolutionary), and what is its primary aim (vertical, from reproducing data, through closed-loop simulation, to engineering control, neural plausibility, and explicit mapping). Each point is a research approach. This lab's work is in accent; hover any point for its description, and click one of ours to jump into it.

The field we work in

Building organisms is an old idea

The ambition to understand behavior by constructing it predates this line of research by decades, and reinforcement learning in artificial intelligence grew up alongside it from the same question. To be clear, we are one branch of a long lineage. The two literatures developed in parallel, asking one question from two directions.

Two literatures, one question

artificial intelligence behavior analysis both
1898
Thorndike's law of effect: behavior is selected by its consequences (Thorndike, 1898).
1938
Skinner, The Behavior of Organisms (Skinner, 1938).
1954
Minsky's stochastic learning machines; Farley and Clark simulate self-organizing systems on a digital computer.
1961
Minsky names the credit-assignment problem; Michie's MENACE learns tic-tac-toe with matchboxes (win, +3; tie, +1; loss, −1).
1970
Herrnstein's matching law (Herrnstein, 1970).
1972
Rescorla and Wagner's model of Pavlovian conditioning.
1992
Watkins and Dayan formalize Q-learning.
2015
Mnih et al., human-level control through deep reinforcement learning.
2019
McDowell's evolutionary theory of behavior dynamics (ETBD).
2025
Cox and Santos connect reinforcement learning across behavior science and artificial intelligence.

Who builds artificial organisms in behavior analysis

We are far from alone. Where a public article exists, the entry links to it.

Reinforcement learning in artificial intelligence and reinforcement in behavior analysis share components (i.e., states, actions, and consequences), yet pursue different goals and permit different manipulations (Cox & Santos, 2025).

Many ways to build one; three we have tested

Many approaches could animate an artificial organism. These three are the families we have worked with so far, and each buys something at a price.

flexible reinforcement learning

Q-Learning

Affords: flexibility to model many antecedent, behavior, and consequence relations.

Costs: it may not stay tractable as states multiply (i.e., the curse of dimensionality).

evolutionary selection

ETBD

Affords: an extensive empirical record and functional equivalence with measured behavior.

Costs: functional match without material equivalence (McDowell, 2019).

where we aim

First principles

Affords: functional and material equivalence in the same organism.

Costs: more constrained, and the results still need replication.

Those are the approaches we have tried. The rest of this update is this line of research filling them in (i.e., the demonstration engines toward the left, the first-principles organism toward the right), with every engine answering to the same measured behavior.

a concrete result · predicting the next response (Cox & Santos, 2025)

Predicting the next swing-or-take in real Major League at-bats. Adding behavior-analytic structure to the state, rather than more data, is what moved accuracy:

.51
simple
.63
+ molecular
.68
+ molar
.86
molecular + molar
.88
+ embeddings
Artificial organisms animated by a theory

Pick a theory, then run the organism

One way to study a learning theory is to embody it as an artificial organism and watch what behavior emerges. Below are four such engines, each borrowing an existing theory. Select one and its controls appear; the organism then forages on concurrent variable-interval schedules (i.e., two options, each paying off on its own unpredictable timer). The first three are stochastic choosers, so the panel plots the generalized matching law (i.e., how the log ratio of behavior tracks the log ratio of obtained reinforcement). Brunt–Väisälä, being a continuous dynamical model, instead relaxes its allocation toward the matching equilibrium over time.

Q-learning matching fit
q-learning-aos, verified run. Under melioration (myopic, softmax), sensitivity is about 0.63 and R² is about 0.999.
ETBD matching fit
etbd-aos, verified run. Sensitivity is about 0.60 and R² is about 0.99; the mutation rate sets sensitivity.

All four engines run on the shared harness ao-simulator over the same environments and schedules. Each borrows its theory; the rest of this update builds an organism that borrows none.

The center of the work · molecular-dynamics-algorithm-ao

The organism we build from first principles

The four engines borrow a theory. This one borrows none. Most models of behavior install the answer in advance, a value function, a matching equation, a policy. This organism installs none of them, and is built to stay objective and non-mentalistic: every term reduces to something measurable (energy expended, distance moved, stimulus intensity, response probability), never a posited inner state.

It is not a reinforcement-learning policy. It is a distributed dynamical system of many coupled, response-capable units, the behavioral atoms. Stimuli act as force fields; learning history changes the forces those stimuli exert; behavior emerges from integrating the coupled dynamics over time; and survival is governed by an energy budget drawn from behavioral ecology. Nothing in the animation is scripted; the path is read out from the atom dynamics.

Organism living out its energy budget

A trained organism foraging (left): position and recent trail. The energy reserve (right) dips toward starvation on the trek to the patch, then is sustained by foraging it.

Two tiers: the operant is built into the architecture

drive atoms · carry the learning

approach_food, avoid_danger, approach_light, orient_to_cue. Sign-stable functional classes, each tagged with the stimulus it tracks and a valence (+ approach or − avoid). The learned weights live here.

movement atoms · carry no learning

move_up, move_down, move_left, move_right. Pure topographies that express the drive atoms through the live stimulus geometry.

This is the behavior-analytic definition of an operant, built into the design: a functional class defined by its outcome, not its topography. "Approach food" is the operant; it is expressed through whatever movements the environment makes available.

One step of the organism, repeated for a whole life

Sense Compute net force Integrate (damped Verlet) Emit (softmax / matching) Energy budget Learn (Rescorla–Wagner)

Stimuli are sensed as forces, the atom activations are integrated one step, an action is emitted by a softmax over activations, the energy reserve is updated, and the one learning rule changes the weights. Then it repeats. (1 step is 15 minutes; a life runs to ~10,000 steps.)

The governing equations

The physics of the organism

Nothing here is fit to behavioral data. These equations are the mechanics of the organism; the behavioral laws (matching, momentum, generalization, the energy-budget rule) come out the far end. Each is shown with a plain-language reading.

Each row pairs the equation with a live picture of what it does. The math is the bookkeeping; the picture on the right is the intuition.

Is = exp(−ds / range)
Sensing. Stimulus intensity falls off exponentially with distance, Shepard's universal law of generalization.
A food source glows at the left. As the organism moves away, what it senses fades along the curve, closer means stronger.
Fi = sensory + history + motivational + coupling − fatigue
Behavioral force. Each atom feels the current stimulus, its learned history, the motivational pull of hunger, coupling from other atoms, minus fatigue.
Four pulls stack up; fatigue eats back from the end. What is left, the arrow, is the net force on this atom this step.
g(E) = μ (1 − E/Ecap)p,  p ≥ 1
Convex marginal value of energy. A depleted reserve drives stronger food-seeking, because energy is worth more near the death boundary.
As the reserve drains toward the death line on the left, the value of the next bite climbs steeply, so seeking intensifies.
xt+1 = 2xt − xt−1 + (F − c v)/m · Δt2
Damped Verlet integration. Atoms move like damped particles: mass is behavioral inertia (momentum), damping dissipates it. The second-order term makes the atom ramp under drive and persist after it.
Drive switches on (grey band): activation ramps up, not instantly. Drive off: it coasts down. That lag is behavioral momentum.
P(a) = exa/T / Σb exb/T
Emission. Behavior is read out by a softmax over atom activations, the Luce choice rule (i.e., the matching law), with temperature T as sensitivity.
Same four activations (grey), turned into choice probabilities (blue). Low temperature is decisive; raise it and choice spreads out.
Et+1 = Et + intake − loss − metabolism − movement
Energy budget; death at E ≤ 0. Objective bookkeeping; the organism dies when the reserve runs out. This closes the force↔energy loop.
Intake refills the reserve; metabolism and movement drain it every step. Touch the red floor and the organism dies.
ei(t) = γ ei(t−1) + xi(t)
Eligibility trace. Recent activity is eligible to be changed by a consequence, recency-weighted by γ.
Each burst of activity leaves a fading mark. If a consequence lands now, the most recent actions are the most eligible to change.
Δwi[s] = η ei Is (λ mag − Vpred)
The core learning rule, valence-split Rescorla–Wagner (pluggable; this is the default, and a few phenomena use a specific variant). Approach drives learn from the appetitive signal, avoid drives from the aversive one. The same associative substrate underlies operant and respondent learning.
Learning tracks surprise: the red gap between what was expected and what arrived. Each trial shrinks it as the weight climbs to asymptote.
A capability the other engines here do not have

It also forms associations

Operant theories address what consequences select. They are largely silent on what a stimulus comes to predict. The first-principles organism also carries a Rescorla–Wagner associative process (Rescorla & Wagner, 1972), so the same body shows acquisition, an asymptote, and extinction. Adjust the salience and the phase lengths and watch associative strength build, then decline.

ΔV = αβ (λ − V)

In words: associative strength V moves toward the outcome λ (here 1 while the unconditioned stimulus is present, 0 in extinction) by a fraction set by salience.

asymptotic V trials to half-asymptote
Why an energy budget matters

State decides whether risk pays

Give the organism a reserve, a steady metabolic drain, and a hard death boundary, and risk preference stops being a free parameter. It follows from survival. This is the energy-budget rule (Caraco, 1980; Stephens & Krebs, 1986): with two options of equal mean intake, prefer the certain option when reserves sit above the requirement, and prefer the variable option when they fall below it. Move the reserve and the optimal choice changes.

Both options have the same mean intake (50). The organism survives the interval only if its reserve plus this period's intake reaches the requirement (100), so the break-even reserve is 50. Below it the certain option falls short for sure and only variance can clear the bar; above it the certain option already suffices and variance only risks it.

survival if certain survival if variable optimal choice

Below the break-even reserve the variable option gives the higher survival probability; above it the certain option does. That sign flip, at the requirement minus the mean intake, is the energy-budget rule. Raising the variance steepens the variable curve, widening both the gain below break-even and the loss above it.

molecular-dynamics-algorithm-ao · results

One substrate, operant and respondent

The organism is built toward a single goal: that one substrate (i.e., the atoms, the forces, the Verlet integration, the energy budget, and the Rescorla–Wagner rule) can account for the phenomena of operant and respondent conditioning, each demonstrated on its own. Many emerge from that core substrate directly; others currently use an added mechanism or a companion analysis in the same codebase, and the repository flags which is which. The organizing thesis is that respondent and operant conditioning are one associative process read out under different procedures. Whether behavior appears respondent or operant depends on the procedure arranged (a stimulus paired with an outcome, or a response followed by one); the mechanism inside the organism is the same in both cases.

respondent procedures

Acquisition, extinction, spontaneous recovery, stimulus generalization, the generalization gradient and peak shift, discrimination, blocking, overshadowing, renewal (ABA), rapid reacquisition.

operant procedures

Acquisition, extinction, the FR / VR / FI / VI schedule signatures, the partial-reinforcement extinction effect, three-term stimulus control, concurrent matching and the concatenated matching law, behavioral momentum, behavioral contrast, punishment.

These emerge from the core substrate, the organism's own behavior. Each is a population of organisms (95% confidence bands), run from the same engine:

Acquisition: across successive lives, food-contact rate and steps survived rise and the latency to reach food falls.
Extinction: the learned food weight climbs to asymptote during training, then collapses when food stops paying.
Matching: on concurrent VI VI signalled by cues, log behavior ratio tracks log reinforcer ratio (undermatching, sensitivity a = 0.56).
Stimulus generalization: after training at one cue value, responding falls off symmetrically for cues to either side.
Peak shift: after an S+/S− discrimination, the response peak shifts past S+, away from S−.
Stimulus control: a response reinforced under S+ but not S−δ comes under control of the cue (S+ about 0.88 vs S−δ about 0.50), graded by cue similarity.

From the same engine, the program has also taken these further, using its choice and survival-dynamics modules: risk-sensitive foraging and the energy-budget rule, resurgence as model mimicry, the reinforcement–punishment asymmetry, and higher-moment (skew) effects. Those are collected in the full suite.

The other half of this line of research

Building, then answering to data

The point of this arm is to put the models against real behavior. One case does it directly today: an artificial organism animated by Q-learning, applied to a real behavioral record (Cox & Santos, 2025). On the eight-pigeon data, a flexible machine-learning model defines the prediction benchmark, and human-task platforms supply more data.

01
An artificial organism animated by Q-learning, applied to data (Cox & Santos, 2025): the same Q-learning agent that reproduces matching in simulation, used to predict the next swing-or-take in real Major League at-bats. an AO model on real data
02
one-model-to-account-for-it-all: a flexible machine-learning benchmark (a hierarchical GRU plus a hierarchical-Bayesian belief state), not an artificial organism, fit to eight pigeons' inter-response times and side-entry choices. It sets the prediction bar the engines are asked to meet. ~10,750-word draft; analysis complete
03
BehavioralDynamics platforms: human tasks for depleting-patch foraging, concurrent-operant perturbation, and stimulus generalization. one foraging study under review; others built, awaiting runs

Putting our own engines against these data

We ran the actual engines, imported from their repositories, on the eight pigeons' side-entry choices: each is driven teacher-forced as an online predictor, with its own parameters tuned per pigeon (a grid seed plus a Nelder-Mead refine) on training trials and scored on held-out trials. Q-learning is the strongest, averaging about 0.65 AUROC and, on several pigeons, matching or exceeding the GRU (up to 0.75); tuning the learning rate well below the original grid is what closed the gap. MPR ranks choices above chance (about 0.57) but its probabilities hug indifference, so at a 0.5 cut it rarely flips its prediction (MCC near 0), which is what a matching-based engine does once local reinforcement rates equalize. ETBD stays near chance (about 0.53). The two evaluation splits, the last 30% of trials and the last ~30% of sessions held out, give the same picture. So a tuned Q-learning agent rivals the flexible GRU on individual birds, while MPR carries weaker rank-order signal and ETBD adds little here.

AO engines vs GRU on pigeon choice
Next-trial prediction of pigeon side-entry choices: the actual MPR, Q-learning, and ETBD engines (imported from their repositories, tuned per pigeon with a grid plus Nelder-Mead refine, scored on held-out trials) against the one-model GRU benchmark (red) and a choice-history baseline (past choices only, reinforcement ignored). AUROC and MCC, mean ± SD across 8 pigeons; temporal-holdout split shown, held-out-sessions gives the same ordering. The full first-principles organism and the inter-response times are not in this comparison; these three are choice models scored on the choice record.
The manuscripts of this line of research

What this line of research is writing

These are the manuscripts of this line of research, grouped as we group them internally. Statuses are current; unrelated work from other lines is left out.

1 · simulation demonstrations
·
Animated by MPR drafting; figures pending
·
Animated by Q-Learning verified; write-up
·
Animated by ETBD verified; write-up
·
Animated by the Multiscale Molar View title only; demonstration to be defined
·
Four processes, one phenomenon: mechanisms of resurgence study complete; being promoted to a manuscript
2 · mapped to experimental data
·
Multiscale ML of pigeon peck IRTs and side-entry choices (Cox, Drugan-Eppich, & Sanabria, 2025) under review
·
One Model to Account for It All substantial draft; finalizing
·
Behavior-dynamic models of choice in a non-stationary foraging task under review
·
Unified-model experimental test (gate-check plus 5-option coupling) platform built; pre-run
3 · theoretical / conceptual
·
A dynamical-systems account: matching, disequilibrium, momentum, Brunt–Väisälä accept pending revisions
·
Keystone Contingencies and the Organization of Behavior under review
·
A tensor-analytic approach to the behavior of organisms early; the operant + respondent unification target
·
On Levels in Operant and Respondent Learning Theory substantial draft
Where this is going

Toward one organism with swappable theories

The build is review-gated, so each phase is approved before the next begins. The aim is a single codebase in which one organism can be animated by any of the theories above, over a shared environment, scored against the same phenomena and the same data.

0
Consolidate. The four demonstration repos exist and are verified. done
1
Specify the organism: its state, its operant and respondent learning rules, its environment and schedule interface, and the phenomena it must reproduce.
2
Stand up the unified skeleton: one organism, with MPR, Q-learning, ETBD, and the dynamical model as pluggable backends.
3
Build the validation suite: each phenomenon becomes a regression test and is fit to the pigeon and human data.

The aim is one organism that any of these theories can animate, each judged against the same measured behavior.

Thanks for reading this far. Questions, disagreements, and "have you tried…" are all welcome.