Week 05 · lesson

Lab: Measure Latent Reconstruction Loss

Mission

Run the local Latent Reconstruction Lab. Compare a two-bit bottleneck with a one-bit bottleneck, inspect every reconstruction, and export a bounded evidence record.

Guided start

  1. Run the two-bit bottleneck.
  2. Trace pattern B: input 1101 → code 01 → reconstruction 1101 → error 0.
  3. Switch only the bottleneck to one bit.
  4. Trace B again: 1101 → code 0 → reconstruction 1001 → error 1.
  5. State what changed and what stayed fixed.

Procedure

  1. Preserve all four two-bit rows and total error.
  2. Predict which rows will collide with one-bit codes.
  3. Run one-bit mode and preserve all rows and total error.
  4. Identify each collision and exact changed bit.
  5. Inspect every available decoder output.
  6. Preserve your first “generated output” claim, then correct it.
  7. Complete Observation, Measurement, Decision, and Limitation.
  8. Export the record and confirm it names ai-for-beginners-latent-reconstruction-lab.

Success criteria

  • one full encode/decode trace is reproducible;
  • both modes include four exact errors and totals;
  • collision is distinguished from implementation failure;
  • decoder output is not called novel, realistic, or correct without evidence;
  • the limitation rejects training, unfamiliar-data, and GAN-performance claims.

Use only supplied patterns. The deterministic browser Lab trains no model, uploads no data, and contacts no service.

Robotnix Lab · contract v1

Latent Reconstruction Lab

Compare two deterministic bottlenecks, inspect reconstruction error, and bound claims about decoded outputs.

Help and boundaries

A deterministic browser simulation uses four supplied binary patterns and contacts no model or service.

No personal data, private prompts, or API keys. This Lab makes no hidden remote writes and does not persist your work after the page session.

No result trains or deploys a model, identifies a person, or authorizes action.

Lab draft is active for this page session only.

Objectives

  • Trace input through latent code to reconstruction.
  • Measure information loss when inputs share one code.
  • Separate decoder output from novelty or realism claims.

Procedure

Workbench

Compress, reconstruct, and inspect what was lost.

Select a bottleneck and run. The same four supplied patterns and deterministic rules are used every time.

Boundary: This simulation does not train an autoencoder or GAN, evaluate image quality, establish originality, or contact a model service.

Text and static fallback

Every input, code, reconstruction, error, output, and boundary appears in accessible tables.

Two-bit codes yield zero error. One-bit codes give B and D one error each, total two.

Evidence record

Record only the evidence requested. Do not enter names, personal information, private prompts, or credentials. This draft stays in memory only unless you explicitly export it.

Success criteria

  • One complete encode-decode trace is preserved.
  • Both bottlenecks include exact errors.
  • The correction separates output from novelty or realism.
  • The limitation rejects training and general-performance claims.

Complete every procedure step and required evidence field before export.

Vocabulary lab

Flip the idea, not just the card

Explain the term before you reveal the back. Then compare your explanation with the definition, example, and warning.

1 / 5
Read all terms without animation
bottleneck
A constrained intermediate representation with less capacity than the input. Example: One bit provides only two possible codes. Do not confuse it with: Smaller is not automatically better.
collision
Two distinct inputs receiving the same intermediate code. Example: A and B both map to code zero in one-bit mode. Do not confuse it with: A collision may follow the declared capacity rather than a software bug.
Hamming error
The number of positions that differ between equal-length binary strings. Example: 1101 versus 1001 has error one. Do not confuse it with: It does not measure image realism or semantic quality.
decoder output
The reconstruction or candidate produced from a latent code. Example: Code zero returns 1001 in one-bit mode. Do not confuse it with: Produced does not mean novel, true, or safe.
Latent Reconstruction Record
Evidence preserving codes, reconstructions, errors, conclusions, and limits. Example: The Lab's exported JSON. Do not confuse it with: It is not evidence from a trained autoencoder or GAN.