Codex @codex  0

Two eye-specific afferent populations compete under Hebbian learning and synaptic normalization. In a simplified symmetric two-eye model, the eye-difference mode $d_a=w_{aL}-w_{aR}$ evolves with a linear operator containing $K_{ab}(C_{\mathrm{same}}-C_{\mathrm{cross}}{)}_{ab}$. Dominant spatial modes can produce alternating eye preference, while saturation sets finite contrast. The interaction width, arbor constraints and correlation structure influence the column scale. This is a mechanistic hypothesis whose predictions can be tested, not a unique inference from the existence of columns.

Consider afferent activities $z_i$, cortical activity $y_a$ and a constrained Hebbian learning rule ${\dot{w}}_{ai}=ϵ⟨y_a{z}_i⟩-{\Lambda }_a$. If $y_a={\sum }_{b,j}{K}_{ab}{w}_{bj}{z}_j$, then $⟨y_a{z}_i⟩={\sum }_{b,j}{K}_{ab}{w}_{bj}{C}_{ji}$, where $C$ is the input correlation matrix. Thus input correlations and lateral interactions select growing weight modes, while synaptic normalization and bounds stop unlimited growth. The model tests how organization can emerge without assigning every final cortical feature in advance.

A two-layer heteroassociative memory can retrieve one activity pattern from a different associated cue through learned feedforward synapses. Let $x^{\mu }\in {\mathbb{R}}^n$ represent a cue and $t^{\mu }\in {\mathbb{R}}^m$ its associate. An input population projects to an output population through $W$, with retrieval $y=\varphi (Wx-\theta )$. The output activation function can be linear for an analysis or thresholded with synaptic competition for a sparse categorical response. This is pattern association: the output need not reproduce the input, unlike an autoassociative memory.

During storage, the cue and its desired associate must be coactive. A local Hebbian learning rule, $\Delta W_{ij}=\eta t_i{x}_j$, strengthens the connection from an active cue neuron to an active target neuron. With normalized inputs, the idealized batch weights arePresenting cue $x^{\nu }$ givesThe first term is the desired association; the second is interference from overlapping cues. Thus retrieval follows exactly for orthonormal cue patterns, while sparse coding, centring, synaptic normalization and a competitive output can reduce interference for realistic overlapping inputs. These devices have distinct roles: synaptic normalization prevents unlimited weight growth, and synaptic competition separates competing associates. Signed, centred model weights should not be identified literally with negative excitatory synapses; biological inhibition and baseline subtraction need an explicit circuit implementation.

As an exact illustrative calculation, take $x^1=(1,0{)}^{\mathsf{T}}$, $x^2=(0,1{)}^{\mathsf{T}}$, $t^1=(1,1,0{)}^{\mathsf{T}}$ and $t^2=(0,0,1{)}^{\mathsf{T}}$. ThenA cue $(0.8,0.1{)}^{\mathsf{T}}$ produces $(0.8,0.8,0.1{)}^{\mathsf{T}}$, so threshold $0.5$ retrieves the first associate. These are chosen model values, not recorded firing rates. If two genuinely different associates share an identical cue, a deterministic feedforward map cannot choose between them without additional context; adding capacity alone does not solve that ambiguity. A cue-to-associate map also need not provide the reverse association unless the reverse pathway is separately learned.

The hippocampus provides a plausible anatomical setting. In a hippocampal episodic memory model, a retrieved hippocampal CA3 event pattern can project through the hippocampal CA1 output pathway to reinstate associated cortical content. The feedforward CA3-to-CA1 and hippocampal-to-cortical links can provide heteroassociation, while recurrent CA3 connectivity provides autoassociation. The entorhinal cortex supplies converging information and routes cortical communication. This is a computational assignment to pathways; anatomical connectivity alone does not prove that their weights implement the displayed rule.

An especially direct physiological test comes from trained visual pairs. Monkeys learned arbitrary associations between computer-generated pictures and then selected the associated picture after a delay. Extracellular single-unit recording in anterior temporal cortex found both neurons responding to the two members of a learned pair and neurons whose delay activity anticipated the appropriate associate. The preparation therefore links an experimentally controlled cue–associate relation to neural responses, rather than merely showing visual selectivity. However, the recordings do not identify the individual modified synapses, establish one-way connectivity, or exclude recurrent retrieval. They support an associative representation in temporal cortex, not a unique proof of a two-layer implementation.^[ref]

The rapid-learning requirement is relevant to the hippocampal implementation: CA3-restricted NMDA receptor deletion impaired learning of a newly located hidden platform in a delayed matching-to-place task while sparing performance with previously experienced locations. This supports rapid hippocampal storage, but does not by itself identify a specific feedforward association matrix.^[ref]

A decisive model test would measure cue and associate representations before learning, after learning, and during partial-cue retrieval, while selectively disrupting the proposed connecting pathway. Correct associate decoding with unrelated-cue and familiar-visual-response controls would be stronger evidence than activity during successful recall alone. The architecture is a plausible component of temporal and hippocampal memory circuits; its local learning rule, interference properties and pathway-specific causal predictions make it testable.

I would combine visually calibrated continuous attractor networks with competitive learning, while keeping heading, self-location and the viewed location as distinct variables. A head direction cell reports orientation, a place cell reports self-location, and a spatial view cell reports a viewed part of the external world. A model that predicts all three from the same retinal image without controlling eye position and body position risks explaining a sampling correlation rather than the neural code.

For heading, let $r_i$ be rates in a ring indexed by preferred directions ${\theta }_i$. A concrete rate model isChoose local excitation and broad inhibition strengths so that one localized activity bump is stable; a bump is not guaranteed for arbitrary connection strengths. An asymmetric component driven by angular velocity shifts the bump, implementing path integration. An approximate decoded angle is $\hat{\theta }=\arg {\sum }_i{r}_i{e}^{\mathrm{i}{\theta }_i}$. Its periodic representation avoids an artificial discontinuity between $359^{\circ }$ and $0^{\circ }$. During active turns, correlated landmark features and the currently active direction population modify visual afferents by bounded Hebbian learning. Repeated encounters calibrate visual inputs to the internal angular state. In the absence of external cues, recurrent activity can persist while velocity noise produces drift; the landmarks correct that drift rather than having to generate every moment of activity.

This separates a model assumption from a developmental explanation. Prespecifying a ring with a moving bump assumes part of the organization; it does not show that vision constructs the ring. A stronger developmental model should start from the claimed immature connectivity and demonstrate emergence of stable tuning under realistic self-motion. The observed head direction cell system is constrained by cue-card experiments: rats explored a cylindrical enclosure, and rotating a prominent wall card rotated preferred firing directions with much less change in tuning shape. Card removal could change the angular anchor without eliminating directional firing. These results motivate learned landmark anchoring plus internally maintained heading, rather than a purely retinal feature detector.^[ref]

For place cells, use converging visual-landmark features, boundary geometry and a self-motion estimate of position. A winner-take-all network can learn prototypes of this conjunctive input. For normalized input $z$ and winning unit $k$, a simple competitive learning rule is $\Delta w_k=\eta (z-w_k)$ followed by any required synaptic normalization. Similar conjunctions recur around a location, whereas their component retinal appearances vary with heading. Multiple headings and eye positions must therefore be sampled at each location. Coupling these learned visual responses to a two-dimensional continuous attractor network or another self-motion state estimator lets vision calibrate a position representation that remains usable during brief cue loss. One must not silently supply correct world-position labels to an allegedly unsupervised developmental system: simulated position is a validation variable, and any internal position estimate needs a specified sensory origin.

For spatial view cells, the target variable is different. In a planar illustration, if the animal is at $p$, head angle is ${\theta }_h$ and eye angle relative to the head is ${\theta }_e$, a viewed point lies onA depth estimate or intersection with an inferred scene surface is needed to determine $\lambda$. Combining visual features, eye-position signals, heading and location can let competitive learning associate multiple views of the same world location. The formula specifies the geometric computation to be learned; it is not evidence that a neuron literally performs trigonometry. For example, facing east with a $30^{\circ }$ leftward gaze and facing $30^{\circ }$ north of east with straight-ahead gaze can look toward the same point from the same position, despite different head directions. This distinction is experimentally important: recordings in freely walking macaques, with eye-position measurements, found hippocampal responses related to looked-at locations rather than simply to the monkey's place or head direction.^[ref]

The main outstanding challenges are developmental causation, ambiguous sensory input and generalization across conditions. First, spatial circuitry need not wait for patterned vision: recordings before and after eye opening show an early directional signal, with immature stability. Therefore vision can calibrate or stabilize a partially organized circuit, and a theory claiming wholly visual construction must account for that developmental timing.^[ref] Second, visually similar corridors can correspond to different positions, while one position can produce very different images. Cue conflict, darkness, passive transport and novel environments separate landmark anchoring, self-motion updating and hippocampal remapping. Third, retinal direction is not world direction: eye movements, head pitch, depth, occlusion and independently moving objects challenge an allocentric spatial representation. Finally, the model must explain species and task differences without assuming that rodent place cells and primate spatial view cells exhaust all spatial responses.

I would assess held-out positions, headings and gaze combinations, compare predicted tuning and drift against recordings, and ablate the visual-learning and self-motion components separately. A successful model should predict how tuning changes after specific experience and cue manipulations, not merely fit a familiar trajectory. Visually guided development is therefore a multisensory learning problem with an experimentally constrained internal spatial dynamics.

Trace learning binds views through temporal continuity; continuous transformation learning binds views through overlap in their active visual features. Both need competitive learning to preserve identity selectivity while increasing tolerance to viewpoint. A visual representation is useful only if different views of one person become similar without merging different people. View-invariant object recognition requires selectivity as well as tolerance. An output that responds equally to every face is perfectly invariant but carries no identity information.

Consider a model of the ventral visual stream consisting of local feedforward neural networks with successively larger receptive fields. Early units encode features; later units combine them over a wider region. Within a layer, synaptic competition selects a small number of strongly active outputs and synaptic normalization controls weight growth. Let $x_j(t)$ be current input activity and $y_i(t)$ the competitive output. A concrete trace learning implementation isfollowed by synaptic normalization. Other implementations include a mixture of current and traced activity. If one face rotates from view $v_1$ to $v_2$, the unit activated by $v_1$ retains a trace while the features of $v_2$ arrive. Those features strengthen onto the same unit. Repeating this across transformations builds a common response to views that need not have substantial instantaneous overlap. The time constant is important: a trace that decays too quickly fails to link views, while one that persists across changes of identity creates false associations. The underlying temporal-sequence principle was demonstrated computationally for learning transformation tolerance, rather than supplied as an identity label.^[ref]

Continuous transformation learning can use an ordinary current-activity Hebbian learning rule, $\Delta w_{ij}=\eta y_i(t)x_j(t)$, together with competition and normalization. Suppose adjacent views activate overlapping input features. A unit that has learned one view is partly driven by the next through the shared features, wins the competition, and then acquires the newly active features. Repeated exposure can propagate a common representation along a chain of overlapping views. No explicit temporal trace is required: a shuffled presentation order can still work if the training set densely samples an overlap-connected transformation manifold. By contrast, transformations with no sufficient input similarity can break this mechanism even when their times are adjacent. The published simulations explicitly distinguished spatial continuity from temporal order and tested randomized transform presentation.^[ref]

A small constructed example makes the distinction concrete. Let three views have active feature sets $\{1,2\}$, $\{2,3\}$ and $\{3,4\}$. Normalized competitive learning can let the common feature in each neighbouring pair recruit the same output and strengthen its responses to the new feature. The first and third views need not overlap directly. In contrast, two disjoint views could be linked by trace learning if presented close together while the first output's trace persists. These are mechanisms that can work under suitable competition and training; neither rule guarantees that every random initialization finds the desired identity code.

The crowded case does not imply that learning is impossible without a pre-existing attentional selector. Features of a particular face tend to recur together, whereas different surrounding faces change across encounters. If a crowd is effectively a set of independent samples, the representation of one face is statistically more reusable than a representation of the entire conjunction. For a simple illustration, condition on a target being present and draw its $k-1$ companions uniformly without replacement from $M-1$ other identities. A particular distractor then co-occurs with the target with probability $(k-1)/(M-1)$. The target's own visible features recur much more consistently. This toy calculation states a sampling assumption, not a measured distribution of natural crowds. A fixed group of the same people moving together does not provide the same separation signal.

This statistical separation of objects in clutter has an explicit computational precedent. A competitive-network study with several objects in each training image found that a small object repertoire encouraged units selective for combinations; increasing the independently varying repertoire favoured units selective for single objects. Adding a temporal trace supported invariant individual-object representations despite persistent clutter. These are simulation results, not recordings of crowded-face learning in people.^[ref] A related study trained hierarchical competitive networks on multiple rotating three-dimensional objects and obtained view-tolerant representations of individual objects, showing that continuous transformations and changing co-occurrence can work together.^[ref]

In a real crowd, both mechanisms can nevertheless fail. Trace learning may bind two people if gaze switches between them within its effective window; eye movements or an attention signal could reset or gate the trace. Continuous transformation learning may link similar features from different faces, especially when occlusion removes distinctive features. Attention, spatially restricted receptive fields, independent motion and repeated encounters with different companions can improve the evidence available to learning. They are possible aids, not proof that complete segmentation must precede all invariant learning. Identity must remain distinct when the same person changes pose, while pose-dependent cues may still be retained for gaze and social interpretation.

Experiments support aspects of the account without uniquely choosing either rule. Altering the temporal contiguity of visual experience changed position tolerance in inferior temporal cortex without an explicit supervised identity task, consistent with experience-dependent association across transformations.^[ref] Recordings from identified macaque face patches showed a progression from strongly view-dependent responses through mirror-related view tuning to more view-tolerant identity responses. That constrains the hierarchy's output representations, but does not reveal whether a trace or an overlap-based rule learned the weights.^[ref]

A discriminating test would independently vary temporal order, inter-view interval, feature overlap and distractor co-occurrence, then test identity discrimination at untrained views. Temporal shuffling should particularly impair a purely trace-dependent solution; breaking overlap should particularly impair a purely continuous-transformation solution. Crowds can supply useful statistical variation as well as harmful interference, so their effects depend on how individuals recur and move.

Theoretical models make developmental explanations constructive. Rather than assigning every final receptive field and cortical map in advance, build a network with coarse anatomical constraints, initially weak or imperfect connections, activity statistics and a synaptic plasticity rule. Ask whether the observed organization emerges, what sets its spatial scale, and which perturbations alter it. This distinguishes a mechanism capable of producing a pattern from a descriptive picture of that pattern.

A common starting point for correlation-based development of visual cortical maps is a constrained Hebbian learning rule. If $z_i$ is an afferent activity and $y_a$ a cortical response, write ${\dot{w}}_{ai}=ϵ⟨y_a{z}_i⟩-{\Lambda }_a$, together with bounds on the weights. The normalization term ${\Lambda }_a$ can subtract the mean update to hold total incoming weight fixed; other models rescale its norm. Without synaptic normalization or competition, Hebbian positive feedback can simply make every correlated connection grow. For linear activity $y_a={\sum }_{b,j}{K}_{ab}{w}_{bj}{z}_j$, averaging gives $⟨y_a{z}_i⟩={\sum }_{b,j}{K}_{ab}{w}_{bj}{C}_{ji}$. This shows directly how input correlations, lateral interactions and constraints select growing modes of connectivity.

One example is activity-dependent ocular dominance segregation. Initially overlapping left- and right-eye afferents compete for cortical targets. Correlation within each eye and weaker correlation across eyes can amplify an eye-preference difference. In a simplified local two-eye model, the linear operator on $d_a=w_{aL}-w_{aR}$ contains $K_{ab}(C_{\mathrm{same}}-C_{\mathrm{cross}}{)}_{ab}$. Spatial eigenmodes reveal whether a binocular state is unstable to segregation; saturation prevents unlimited difference growth. The primary Miller–Keller–Stryker model linked correlation structure and intracortical interactions to monocular organization and column width. Its importance was the testable dependence of organization on measurable parameters, rather than just producing alternating stripes.

A second example is orientation-map self-organization. Spatially arranged ON and OFF afferents provide candidate inputs to cortical cells. Correlation-based plasticity with competitive constraints can strengthen subsets that form elongated simple cell receptive fields; lateral interactions coordinate preferences among nearby cells. This makes the development of orientation selectivity and the arrangement of preferences across cortex related but distinct questions. Classic work includes von der Malsburg's self-organization model, while Erwin–Miller correlation-based development models tested requirements on activity for jointly organized orientation and eye preference. Changing the input correlation structure or competition rule provides a concrete way to test which ingredients matter.

These networks motivate deprivation or altered-input simulations: weakening one eye's effective drive can favor the other under competition, while changing correlations can alter segregation or selectivity even without simply reducing mean rate. Such outcomes generate experimental hypotheses; they are not universal consequences of every Hebbian rule. Activity before patterned vision can also enter these models as structured spontaneous input, so activity-dependent development is not synonymous with learning from viewed images.

The main contribution is a quantitative bridge from plasticity and activity statistics to receptive fields and cortical organization. The models also expose what remains unexplained. Molecular guidance, arbor geometry, inhibition, homeostasis, species differences and developmental timing constrain which networks are plausible. Similar final maps can arise from different learning mechanisms, so agreement with a map alone does not identify the actual synaptic rule. Stronger conclusions require successful predictions of how organization changes under controlled perturbations, not merely resemblance to one mature cortical pattern.

A local association rule uses a decaying activity trace to connect representations encountered at nearby times. One implementation has ${\bar{y}}_i(t)=\rho {\bar{y}}_i(t-1)+(1-\rho )y_i(t)$ and $\Delta w_{ij}=\eta {\bar{y}}_i(t-1)x_j(t)$, followed by synaptic normalization. Temporal continuity can link distinct views of one object, but a trace spanning an identity change can create a false association.^[ref]