AIMech AI

Swapout

Algorithms AIMech:Swapout DRAFT
A stochastic neural-network training and inference procedure that forms elementwise Bernoulli-selected sums of already computed compatible tensors, trains the resulting network family with shared parameters, and predicts using either local mean selectors or an average of sampled network predictions.
Identity Notes & Concept Scope This record denotes the original 2016 stochastic combination procedure over already computed compatible tensors, with shared training and explicit inference choices. It remains distinct from whole-branch stochastic depth, recurrent Zoneout, complementary continuous Shake-Shake and shared-switch ShakeDrop. SkipForward is a constrained comparator, not a forced alias or automatic extra record. Reuse owner 227; its old Zoneout URL remains historical discovery context. The wrongly linked PTN supplement is excluded from defining evidence. Current creation assessment uses the actual merged round 336 base d76936e4e77768d08b0cdd7f505ed34c9f50a5f0 with 745 native and 442 pinned AIO records. All 1,187 identity/hash rows were compared to retained research snapshots with no unexpected change. Four ignored/hidden-inclusive searches returned 191, 190, 526 and 575 occurrences; root read all 26 distinct matching contents, including 18 newly encountered context strings. Normalized ID/name/alias/scoped-synonym probes had no collision. The full 908-main and 393-nested frontier was queried and relevant current owners read. These are bounded current identity findings, not global completeness or exhaustion.

Claims & Grounded Evidence

6 Claims
Mechanism #compatible-stochastic-path-sums
Let F_i be compatible tensors whose values have already been computed in the network, and let Theta_i be Bernoulli selector tensors with configured probabilities theta_i. The general construction forms Y=sum_i Theta_i elementwise-times F_i. Each selector tensor has independently and identically distributed entries. The contributions can include the block input or outputs of earlier layers; they need not all be functions of one common block input. The surrounding computation remains a directed acyclic network.
Mechanism #unitwise-four-choice-specialization
The studied two-contribution specialization is Y=Theta_1 elementwise-times X + Theta_2 elementwise-times F(X). With independent selectors, each unit can report zero, its input component, its transformed component, or their sum, according to the two binary outcomes. These are four selector patterns, not a guarantee of four distinct numerical values. The unitwise choices can differ within a block, unlike one shared scalar that drops or retains its whole residual transformation.
Mechanism #shared-parameter-stochastic-training
Training samples members of the stochastic network family while retaining shared learned parameters across those members. The sampled selectors change which computed contributions reach each unit; this does not require training a separate parameter set for every possible architecture. The original experiments optimize these shared models using stochastic gradient descent. This description does not establish a general stability or convergence guarantee for the resulting optimization.
Mechanism #depth-dependent-selector-configuration
The Bernoulli probabilities can be configured separately for the identity and transformed contributions and for different blocks. The source compares constant choices with Linear(a,b), meaning linear interpolation of the probabilities from a in the first block to b in the last block. This schedule varies across network depth, not over elapsed training iterations. The reported probability choices are experimental configurations rather than a universally optimal setting.
Mechanism #deterministic-and-stochastic-inference
The paper specifies two inference options for a trained shared-parameter family: replace the selectors by their expectations within each local computation, or sample several network members and average their predictions. The first option is deterministic; the second averages stochastic forward predictions using the same learned parameters. Replacing local coefficients by their means does not generally yield the expected prediction of the full nonlinear network. The number of sampled predictions is a configured approximation choice.
Scope #coupled-special-cases-and-skipforward
The comparison procedures use distinct selector constraints. Dropout on the residual sum uses one selector on X+F(X). Layer Dropout retains X and uses a single Bernoulli scalar shared across the transformed block. SkipForward instead uses complementary unitwise selectors, Theta on X and one-minus-Theta on F(X), choosing between those contributions rather than allowing their sum or jointly dropping them. These restricted comparisons do not make the full named procedures exact aliases of the general Swapout construction.

⚠️ Curated Limitations & Negative Results

Artificial Intelligence Ontology (AIO) Grounding

Mapped AIO Classes
AIO Target Class Mapping Relation Mapping Rationale
AIO:TrainingStrategy
TrainingStrategy
related_match Swapout changes stochastic neural-network training and its corresponding inference convention. This is a qualified procedure-to-training association. The pinned target uses a broad preprocessing description and learning-task examples, which do not justify identity or subclass membership. The general compatible-tensor construction is not restricted to the residual architecture used in the principal experiments.

Evidence Sources & Primary Literature

1 Source
Source ID Publication / Document Type / Access Reference & Checksum
singh2016
Saurabh Singh, Derek Hoiem, David Forsyth
primary paper
full_text
sha256:8de0db45edbe…

Curation Provenance

Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-15T09:02:41Z
Updated: 2026-10-15T09:02:41Z
Source File: data/curated/Swapout.yaml