Competitive learning
Learning Paradigms AIMech:CompetitiveLearning DRAFT
An unsupervised learning paradigm in which units or modules compete to represent presented input patterns and adapt their representations according to that competition. Winner-only adaptation and posterior-weighted soft adaptation are distinct realizations; the paradigm does not prescribe one universal update law or network architecture.
Identity Notes & Concept Scope
This source-scoped learning paradigm keeps normalized hard-winner adaptation and Gaussian posterior-weighted soft adaptation distinct. It is not one universal architecture, k-means, a self-organizing map, PBIL search, or exact-cache incremental EM. Fresh postmerge collection on 15 October 2026 at base a80a4e53097977b397421562fb1169aa1426dc8b inspected 757 maintained and 442 pinned AIO identities, including 4,789 identity-field occurrences and 3,661 normalized values. Four fixed-string, word-boundary searches included ignored and hidden files in the original checkout and three discovery/recovery checkouts: 8,131, 7,634, 18,826 and 22,178 occurrences, grouped into 3,163 exact contents. Candidate identities had no collision; the four PSO self-matches were explicitly retained for enrichment. Root read 159 decoded candidate contexts (including a separately retained two-context key/value projection correction), all 30 normalized match fields and relevant frontier fields/selected full owner objects. Supporting agents assessed the disjoint candidate and two contextual partitions; full raw-content reconstruction is separate from semantic assessment and is not a claim that root read all raw containers. Existing unrelated definitions, rendered mirrors, historical report/review contexts and incidental substrings do not establish equivalence. The frontier has 909 main and 393 nested objects; only owners 243, 258, 260 and 261 change. This is bounded to the inspected pin, inventories and contexts, not all AI literature or saturation. Owner 258 retains its PBIL motivation and Nowlan/Yuille discovery context. The accepted Rumelhart–Zipser and Nowlan primary descriptions support the broader paradigm, while owner 423 and the original thesis, decayed-statistics, online-mixture and other variant leads remain unchanged and unresolved.
Claims & Grounded Evidence
5 Claims
Mechanism
#competition-and-allocation
The inspected hard realization organizes units into inhibitory clusters: each cluster selects the unit with the largest input, sets that winner active and the other units inactive, and adapts only the winner. Nowlan contrasts a hard assignment with a soft realization in which normalized component responses share responsibility for a presented input. Hard exclusivity and soft sharing are alternative ways to allocate adaptation, not requirements that every competitive learner satisfy simultaneously.
Mechanism
#normalized-binary-winner-update
For the reprint’s binary input x with n=sum_i x_i>0, each winning unit redistributes a fraction g of its unit-total input weight equally over active input lines. In vector form its update is w_new=(1-g)w+g*x/n; losing units keep their weights. With nonnegative w summing to one and 0<=g<=1, this update preserves nonnegativity and unit total. These conditions describe the selected normalized-weight realization, not all hard competitive learning.
Scope
#categorical-features-and-layering
A winner-take-all cluster with M units supplies an M-valued categorical response to an input. The reprint’s construction can combine responses from multiple clusters and use a layer’s active-unit pattern as the input to a higher competitive layer. This makes learned competitive features available for hierarchical classification, without requiring a deep architecture or guaranteeing uniquely meaningful features, balanced use of units or successful separation of every input distribution.
Mechanism
#gaussian-soft-responsibilities
In Nowlan’s equal-prior, common-variance spherical Gaussian example, each unit represents a center mu_j and computes a component response phi_j(x). Soft competition uses r_j(x)=phi_j(x)/sum_i phi_i(x), so all positive-response components can contribute to adaptation. The corresponding hard approximation selects the largest component response; under those equal-prior and common-variance assumptions this is a nearest-center assignment. The normalized responsibilities refer to this mixture model, not to a universal soft-competition formula.
Mechanism
#responsibility-weighted-center-fit
For the fixed positive-variance Gaussian mean problem, the soft stationary relation is mu_j=sum_k r_j(x_k)*x_k / sum_k r_j(x_k), when the denominator is positive. The hard counterpart averages only the assigned cases. Nowlan describes iterative adaptations of these relations for radial-basis centers and then fits a separate supervised output layer for classification. Because responsibilities depend on current parameters, the stationary relation alone specifies neither a unique online update schedule nor a solved global maximum-likelihood estimate.
⚠️ Curated Limitations & Negative Results
- The normalized binary-input rule requires a nonempty input, a declared winner or tie convention, initialized unit-total weights and an appropriate gain. Zero input leaves x/n undefined; gains outside [0,1] need not preserve the simplex, and endpoint gains do not preserve strict positivity in general. Input normalization, gain schedules and competition rules are realization-specific, not fixed for the entire paradigm.
- The inspected reprint contains a scaling discrepancy in its equilibrium discussion. Its zero-expected-drift equation on PDF p. 21 / printed p. 168 implies, for positive learning gain, constant active count n and positive winning probability, w_i=P(input i active | unit wins)/n. The next page prints n times that conditional probability. The preceding equation and unit-total constraint support division by n; this is a discrepancy in the inspected 1986 reprint, not an asserted author erratum or a claim about uninspected 1985 journal bytes.
- Unit-total nonnegative weights have fixed L1 norm, not fixed Euclidean norm. The reprint qualifies its geometric analogy, and maximum weighted input is not universally equivalent to nearest Euclidean center under that constraint. Winner-only adaptation can leave units unused; neither equal occupancy, distinct semantic features nor a unique stable partition follows in general. Zero expected weight drift also does not itself prove convergence of continually updated random weights.
- The soft weighted-mean condition assumes a valid mixture and positive variance and total responsibility. It is a fixed-point or stationary relation because its responsibilities depend on the means. Computing responsibilities under old parameters and maximizing a fixed-responsibility surrogate can give an EM mean step; an arbitrary online gradient step, cumulative average or decayed statistic update is not automatically that procedure. No global maximum, monotone likelihood for arbitrary finite steps or unique online schedule is established here.
- Nowlan’s Equation 1 prints a prefactor 1/(K*sigma_j) with covariance sigma_j^2 I. A normalized d-dimensional spherical Gaussian requires a factor proportional to sigma_j^(-d); the printed form needs a dimension/variance-dependent interpretation of K outside one dimension. A common fixed factor cancels in the equal-prior, common-variance responsibilities used here, so this caveat does not invalidate that restricted comparison. Maximizing log likelihood calls for ascent, or descent of its negative, despite the source’s “gradient descent” wording; no general literal variance-update implementation is certified.
- The maximum component term in Nowlan’s Equation 4 is a hard approximation to the mixture sum, not generally an equal normalized density. Unequal priors or covariances change assignments and responsibilities. Hard centroid fitting, marginal-likelihood EM and annealed or stochastic competitive procedures therefore are not unconditional synonyms, and finite experimental comparisons do not establish universal superiority or convergence.
- This paradigm is not identical to Lloyd k-means, a self-organizing map, PBIL or exact-cache incremental EM. A self-organizing map additionally adapts a topological neighborhood; PBIL updates a search distribution using objective-selected candidates; exact-cache incremental EM has its own fixed-data replacement schedule. In Nowlan’s application a separately trained output layer uses class labels, so an unsupervised center-fitting component does not make the complete classifier unsupervised.
- Primary evidence uses the inspected 1986 Rumelhart–Zipser chapter reprint and official NIPS 1989 Nowlan proceedings PDF. The reprint identifies its 1985 journal origin, but journal-byte equality was not checked; reading used selected OCR and formula visuals, not the unread middle experiment pages. The official Nowlan year 1989 and historical citation year 1990 are bibliographic conventions, not two algorithms. Yuille’s 1994 note supplies contextual EM/annealing discussion only. The unavailable 1991 Nowlan thesis, author implementations and benchmark reproduction were not inspected in this research; general biological or semantic-feature guarantees are not inferred.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:UnsupervisedLearning
Unsupervised Learning
|
related_match | The inspected competitive representations are learned from unlabeled input patterns, which supports association with the pinned unsupervised-learning task. The local subject specifies competition-based adaptation, including distinct hard and soft realizations, rather than every unsupervised task or one universal algorithm. This is a qualified related mapping, not equivalence or an asserted upstream subclass relation. |
Evidence Sources & Primary Literature
2 Sources| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
rumelhart1986
|
David E. Rumelhart, David Zipser
|
primary paper
full_text
|
sha256:bf75484b9b24…
|
nowlan1989
|
Steven J. Nowlan
|
primary paper
full_text
|
sha256:3c4c0f289ac2…
|
Curation Provenance
Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-15T13:24:46Z
Updated: 2026-10-15T13:24:46Z
Source File:
data/curated/CompetitiveLearning.yaml