PART 22 / Frontier

Frontier questions & experiment design

What observation would convince us that a biological prior actually helps?

Illustrated introduction

What you will learn

Turn an attractive idea into a preregistered comparison with realistic failure outcomes.

Before you begin: AGI connections: evidence before promises; Connectome programming

Make the frontier specific

A promising question has a variable you can manipulate, a result you can measure and a baseline that could win. Asking whether biological connectivity helps is too broad. Asking whether a fixed topology reduces sample requirements for a bounded navigation task under matched degree and compute constraints is testable.

Separate the causal candidates

Topology, weight distribution, dynamics, encoder and decoder can all affect behavior. Changing several at once prevents a clean conclusion about any one. Use an ablation matrix and reserve evaluation cases before tuning. Parameter sensitivity matters when a connectome does not supply the dynamics you need.

Neural-network perspective

A biological motif can be treated as an inductive-bias candidate alongside generic sparsity, recurrence or modularity. The scientific value of a comparison includes negative results. If a simpler network matches the result, the study can clarify which complexity is unnecessary rather than hide the comparison.

SEE THE RELATIONSHIPS

From structure to behavior.

Evidence: a labelled conceptual diagram
Figure 22.1 · Evidence. Original educational diagram; synthetic, not a measured result.
The reasoning pathSpecify contrast then Match budgets then Repeat & ablate then Report uncertainty1. Specify contrast2. Match budgets3. Repeat & ablate4. Report uncertainty
A learning flow for this part. Follow the assumptions through to an observable result.

MAKE THE IDEA PRECISE

The mathematics.

mean_delta = sum(delta_i)/n; SE = sample_std(delta)/sqrt(n)
Symbols and units
SymbolMeaning
delta_iPaired candidate-minus-baseline score for independent run i
nNumber of paired runs
SEEstimated standard error of the mean under independence assumptions

Build the equation, step by step

  1. Pair candidate and baseline measurements under matched conditions and compute their differences.
  2. Average those differences for the estimated effect. Estimate sample standard deviation using n − 1 in the variance denominator, requiring at least two pairs.
  3. For independent comparable pairs, estimated standard error of the mean is sample standard deviation divided by the square root of n. Correlated trials, selection after looking at results and dataset leakage can invalidate a naive interpretation.

WORK THROUGH THE NUMBERS

Worked example

Illustrative paired differences [0.04, 0.02, -0.01, 0.03] have mean 0.020 and estimated standard error about 0.011. Four runs are a small example, not an adequate universal experimental sample size.

A small Python experiment.

Python 3 · Standard library only · Synthetic educational example. Run this in your own notebook or a local file.

from statistics import mean, stdev
from math import sqrt
differences = [0.04, 0.02, -0.01, 0.03]
print(f"mean = {mean(differences):.3f}; SE = {stdev(differences)/sqrt(len(differences)):.3f}")

Expected output

mean = 0.020; SE = 0.011

Change one quantity, predict the result, and then run the code again. Explain any difference before adding complexity.

Test your understanding.

Try it: Compare independent evaluation environments with repeated measurements from the same trajectory.

Self-check: Is one standard error a 95% confidence interval?

No. It is an estimated scale of uncertainty for the mean under assumptions. A confidence interval needs an appropriate multiplier and distributional method; small samples commonly require different treatment from a large-sample normal approximation. Neither interval alone establishes practical importance.

Where this model stops: A standard error is not a confidence interval or a proof of causality.

A research question: Which conclusions remain stable under rewiring, parameter sweeps and changed task distributions?

Record evidence in your mastery worksheet →

THE NEXT LAYER

Chapter depth map.

This introduction provides a first model. The following chapters are outlines for deeper future editions; their full treatments have not yet been published.

Architecture and learning

22.1 Structure as an inductive bias · Outline
  1. 22.1.1 Connectome-inspired architectures and matched controls
  2. 22.1.2 Circuit motifs versus generic sparsity
  3. 22.1.3 Training data requirements and sample efficiency
  4. 22.1.4 Specialized circuits emerging through learning
  5. 22.1.5 Transformers combined with structural priors
22.2 Timing and adaptation · Outline
  1. 22.2.1 Local biological learning rules at scale
  2. 22.2.2 Neuromodulators and missing receptor information
  3. 22.2.3 Architecture versus learned dynamics
  4. 22.2.4 Robustness to unknown delays and synaptic strengths
  5. 22.2.5 Compare rate and temporal representations

Embodied and efficient intelligence

22.3 Physical hypotheses · Outline
  1. 22.3.1 World models communicating with reflex SNNs
  2. 22.3.2 Always-on neuromorphic robots
  3. 22.3.3 Body/environment contributions to behavior
  4. 22.3.4 Whole-system energy versus kernel efficiency
  5. 22.3.5 Cases where simpler controllers are sufficient
22.4 A falsifiable proposal · Outline
  1. 22.4.1 Primary outcome and effect-size target
  2. 22.4.2 Baseline and ablation matrix
  3. 22.4.3 Compute and data budget
  4. 22.4.4 Replication and sensitivity analysis
  5. 22.4.5 Negative results, stopping criteria and open questions

Read with the original sources.

These readings support the concepts and deeper investigation. The worked numbers and illustrations above are teaching examples.

Official hardware research resource

Intel — neuromorphic computing research ↗

Study event processing, memory and mapping constraints. Do not assume public hardware access or transfer platform-specific energy claims to a new task.

Complete source register →

Where next?