run record~/research/cliste/runsAll Cliste runs

Type a section name and press Enter. Use “help” for the list.

Figures: softened for dark viewingDisplay only; image files are unchanged.
← All Cliste runs

Cliste experiment

Where remembered composition loses accuracy

Execution: completedScientific verdict: Pattern substitution and bundle recovery both limited this comparison

The question

When a remembered image is rearranged, how much accuracy is lost by substituting learned patterns, and how much more is lost when those patterns must be recovered from a VSA bundle?

Why this experiment?

A nearby visual pattern is not necessarily the right replacement for a requested change. These comparisons test whether selection helps the resulting operation.

How it works

Supply two feature positions to exchange. Compare how candidate patterns are selected, then decode the edited bundle against an observer-only clean-feature exchange. This is a local feature operation, not a command to move a complete object.

Follow this part of the investigation: Similar parts are not necessarily the right parts for a change →
Implementation and comparison details

Each request identified a remembered image, a region and two feature positions to exchange. The comparison kept the encoder, decoder and 512-pattern bank fixed. It evaluated 64 requests from 16 previously unevaluated photographs, separately from 32 reused requests from eight previously tested photographs.

Four readouts made the differences observable: unchanged memory; an exact-feature exchange through the same decoder; patterns chosen from clean features; and patterns chosen from noisy features recovered from the bundle. Clean-feature selection is a privileged diagnostic. The bundle-selection worker could access retained vectors and structural requests, but not photographs or clean feature targets.

The exact-feature exchange defines the reference for the represented operation. All errors compare decoded regional pixels with that reference. No model was trained, no patterns were added and no confidence rule was fitted.

What happened

On the 64 previously unevaluated requests, clean-selected patterns reduced mean regional squared RGB error by 46.3% versus leaving memory unchanged: 0.000382 versus 0.000711. Bundle-selected patterns reduced it by 12.6%, to 0.000621. Removing selection noise therefore improved average fidelity, but the remaining pattern substitution still lost useful distinctions.

Clean selection improved 28 requests, worsened 19 and left 17 unchanged. Bundle selection improved 21, worsened 33 and left 10 unchanged. Neither met the predefined reliability benchmark. Eleven clean-selected edits and 21 bundle-selected edits at least doubled the error. Large absolute gains on some requests can coexist with large relative losses on smaller intended changes.

The paired comparison supported an additional error cost from bundle selection. The separate reused panel showed the same direction: 78.2% lower mean error with clean selection and 48.6% lower with bundle selection, but neither met its benchmark. Reused and previously unevaluated photographs were not pooled.

A later inspection found that 17 clean-selected requests mapped both feature positions to the same learned pattern, erasing the distinction needed for the exchange. Bundle recovery chose the clean features’ nearest pattern in only 38 of 128 constituent selections. These observations identify problems in both nearest-pattern substitution and recovery; they do not show that adding more patterns alone would solve them.

Independent numerical and preservation checks passed, including 576 pixel and edge measurements. Pixels outside the selected regional core, the retained state and the codec remained exact during readback. Automatic constituent substitution remains disabled.

Measurements
Measurements — values preserved from this run
Recorded fieldValue
Previously tested requests evaluated32
Prospective requests evaluated64

Results and visual artifacts

Open a figure for its input, comparison, and result. Click an image to enlarge it.

The first four figures cover 64 fixed requests from 16 previously unevaluated photographs (the prospective panel). The last three cover 32 reused requests from eight previously tested photographs (the exposed panel). B leaves memory unchanged; T exchanges the original clean features as a diagnostic reference; C selects learned patterns using those clean features; N selects from bundled memory. C and T require privileged information. Errors measure agreement with T, not an edited ground-truth photograph. The two panels are kept separate.

Previously unevaluated photographs: averages and individual outcomes
Previously unevaluated photographs: averages and individual outcomes
All fixed requests are included. B leaves memory unchanged; C selects learned patterns using privileged clean features; N selects from recovered bundle content. Errors compare each decoded regional core with T, the exact-feature exchange through the same decoder. The absolute average and per-request outcomes answer different questions. C is nearest in vector similarity, not guaranteed optimal in decoded quality. The two input panels are reported separately.
Previously unevaluated photographs: first supplied exchange
Previously unevaluated photographs: first supplied exchange
Fixed example: first source, first request. The boxed remembered region and feature-grid diagram show the supplied request. All readouts share the frozen decoder and retained content. C receives clean-feature information only for this diagnostic; N must select from the bundle without it. T is a privileged exact-feature reference for the represented operation, not an edited photograph.
Previously unevaluated photographs: gains and paired selection differences
Previously unevaluated photographs: gains and paired selection differences
Each point averages four fixed requests from one source. Top: error reduction relative to leaving memory unchanged. Bottom: bundle-selected minus clean-selected error, normalized by unchanged-memory error. Positive paired differences mean bundle selection is worse. Weak-control cases contribute zero; no-change requests remain in the paired contrast. The 95% interval resamples whole source photographs; it is marginal, not a simultaneous interval. This is a comparison of selection paths, not an additive causal error decomposition.
Previously unevaluated photographs: median selection contrast
Previously unevaluated photographs: median selection contrast
Nearest median paired selection penalty; ties use request order. The boxed remembered region and feature-grid diagram show the supplied request. All readouts share the frozen decoder and retained content. C receives clean-feature information only for this diagnostic; N must select from the bundle without it. T is a privileged exact-feature reference for the represented operation, not an edited photograph.
Previously tested photographs: averages and individual outcomes
Previously tested photographs: averages and individual outcomes
All fixed requests are included. B leaves memory unchanged; C selects learned patterns using privileged clean features; N selects from recovered bundle content. Errors compare each decoded regional core with T, the exact-feature exchange through the same decoder. The absolute average and per-request outcomes answer different questions. C is nearest in vector similarity, not guaranteed optimal in decoded quality. The two input panels are reported separately.
Previously tested photographs: gains and paired selection differences
Previously tested photographs: gains and paired selection differences
Each point averages four fixed requests from one source. Top: error reduction relative to leaving memory unchanged. Bottom: bundle-selected minus clean-selected error, normalized by unchanged-memory error. Positive paired differences mean bundle selection is worse. Weak-control cases contribute zero; no-change requests remain in the paired contrast. The 95% interval resamples whole source photographs; it is marginal, not a simultaneous interval. This is a comparison of selection paths, not an additive causal error decomposition.
Previously tested photographs: first request and median contrast
Previously tested photographs: first request and median contrast
Both fixed selection rules identify this same request: first source/first request, and nearest median paired selection penalty. It is displayed once; the original two rendered figures remain in the presentation receipt. The boxed remembered region and feature-grid diagram show the supplied request. All readouts share the frozen decoder and retained content. C receives clean-feature information only for this diagnostic; N must select from the bundle without it. T is a privileged exact-feature reference for the represented operation, not an edited photograph.

Limits and next question

These are supplied feature-position exchanges with overlapping pixel receptive fields. The exact-feature reference is not an edited ground-truth photograph or evidence of object movement. The learned bank contains patterns from five earlier photographs.

Clean selection receives information unavailable to the operative memory path. Its nearest-cosine pattern is not guaranteed to be the best decoded substitute. The conclusion applies to this bank and selection rule; it does not rule out other ways to compose VSA representations.

Four requests share each source photograph. Uncertainty was estimated by resampling whole photographs, and the recovery-penalty interval is wide. The comparison distinguishes selection paths without establishing an additive causal decomposition of every source of error.

Next question. Which distinctions needed for an operation survive pattern acquisition and nearest-pattern substitution? Keep clean-feature selection as a diagnostic control while investigating the vocabulary or its selection objective, then retest bundle recovery.

Inspect the evidence

Download the methods and measurements for this experiment. Large training and saved-state files are not included.