Contribution

Earlier efficiency accounts of colour naming (Regier, Kay and Khetarpal 2007; Regier, Kemp and Kay 2015, “RKK”) found that theoretically efficient hard partitions of colour space resemble attested systems. This paper replaces the hard partition with a stochastic encoder and the ad hoc efficiency score with the information bottleneck, and so can test full naming distributions, not only modal maps. It shows that attested systems are near the IB bound, that one parameter places them along it, and that soft boundaries and inconsistent naming are features of efficient systems rather than departures from efficiency.

Key insight

When meanings are themselves distributions over the world, the natural distortion between intended and reconstructed meaning is KL divergence, and then rate–distortion becomes the information bottleneck: the cost of a lexicon is how many bits of the speaker’s meaning it carries, I(M;W), and its value is how many bits about the world the listener gets, I(W;U). Languages differ mainly in where they sit on that one curve.

Assumptions

  • Meaning space. U is the set of 330 WCS chips in CIELAB; each chip c has one meaning m_c(u) ∝ exp(−‖u − c‖²/(2σ²)) with σ² = 64. The only domain-specific ingredient, by the authors’ account.
  • One source for all languages. p(m) is shared across languages. The main analyses use a “least informative” (LI) prior built per language from its naming data (maximize the entropy of c while minimizing expected surprisal of c given w) and averaged; a uniform source is the baseline.
  • Noiseless channel, optimal listener. Only the encoder is scored; the decoder is the Bayesian listener of Eq. 1, m̂_w(u) = Σ_m q(m|w) m(u).
  • A representative speaker per language, obtained by averaging naming responses; 15 WCS languages with fewer than five responses per chip are excluded from the LI source and the evaluation.
  • IB optimization is non-convex: K = 330, reverse deterministic annealing, local optima only guaranteed.

Key results

  • Eq. 5. E_q[D(M‖M̂)] = I(M;U) − I_q(W;U), so minimizing expected KL distortion is maximizing I(W;U).
  • Eq. 6. The objective F_β[q] = I_q(M;W) − β I_q(W;U), β ≥ 1; the IB curve is the set of its minimizers over β and bounds every language’s attainable complexity–accuracy pair.
  • Eq. 7. The optima satisfy q_β(w|m) ∝ q_β(w) exp(−β D[m‖m̂_w]), hence soft categories for finite β.
  • Fit. β_l is the β minimizing ΔF_β = F_β[q_l] − F*β; efficiency loss ε_l = ΔF{β_l}/β_l.
  • Table 1 (five-fold cross-validation, means ± SD over held-out languages). LI source, IB: ε 0.18 (±0.07), gNID 0.18 (±0.10), NID 0.31 (±0.07), β 1.03 (±0.01). LI source, RKK+: ε 0.70, gNID 0.47, NID 0.32. Uniform source, IB: ε 0.24, gNID 0.39, NID 0.56, β 1.06. Uniform, RKK+: ε 0.95, gNID 0.65, NID 0.50.
  • Rotation control. For each language, 39 hue-rotated variants: 93% of languages beat all of theirs; the rest beat most.
  • Phase transitions. Annealing β gives a hierarchy of categories with bifurcations (Fig. 5). Culina sits just after a green category appears, dominated so that it does not show on the mode map; Agarabi and Dyimini after blue appears, with Dyimini’s blue more established; low agreement around blue is predicted for 1.026 ≤ β ≤ 1.033. English sits at a relatively complex point; its pink appears later in IB than in English.
  • The yellow discrepancy. IB’s first categories include a dominant yellow; low-complexity WCS languages have black, white and red without it. The authors tie it to yellow’s prominence in the irregular CIELAB layout of the stimulus set.

Claims

idclaimstrengthsupport
C1Attested colour-naming systems are near the IB complexity–accuracy boundmoderateFig. 3, Table 1; rests on the LI source estimated from the same naming data, cross-validated over languages
C2Their nearness to the bound is specific to them, not a property of any plausible naming systemmoderaterotation control (93% beat all 39 variants); rotation is one family of alternatives only
C3Small differences in one parameter β account for much of the cross-language variationmoderateβ_l in a narrow band, Fig. 4 comparisons; per-language fit of β
C4Soft boundaries and inconsistently named regions are efficient under IBstrong (derivation)Eq. 7 for finite β; the empirical match is visual (Fig. 4) and by gNID
C5The IB annealing path recapitulates Berlin and Kay’s sequence and accounts for continuous change between stagesweakFig. 5 and Movie S1 (not read); yellow is a stated exception; no historical data are modelled
C6IB fits full naming distributions better than the RKK efficiency model; on mode maps they tiestrongTable 1 (gNID vs NID)

Concepts

  • meaning: a distribution m(u) over states of the environment, the speaker’s belief; here a Gaussian over colours.
  • cognitive source: p(m), how often each meaning needs to be communicated.
  • encoder / naming policy: q(w|m); a language, for the purposes of the paper.
  • complexity: I_q(M;W), bits of the meaning carried by the word.
  • accuracy / informativeness: I_q(W;U).
  • LI source: the need distribution built from least informative priors per language, averaged.
  • gNID: 1 − I(W₁;W₂)/max{I(W₁;W₁′), I(W₂;W₂′)}, a generalization of normalized information distance to soft partitions.
  • relative accuracy of a word: D[m̂_w‖m₀] − I_q(W;U).

Connections

The objective is Tishby, Pereira and Bialek’s (LIT-338), with KL distortion justified after Harremoës and Tishby; the authors place it inside rate–distortion (Shannon 1959) and distinguish their compression view from channel-capacity views of language (Levy and Jaeger; Piantadosi et al.; Plotkin and Nowak). The empirical base is the World Color Survey and Lindsey and Brown’s English data. The deterministic baseline is RKK; the evolutionary contrast is Berlin and Kay (discrete stages) against MacLaury and Levinson (gradual emergence). Deterministic annealing is Rose’s.

Bearing on the record

  • LIT-338. The record’s reading of the IB paper (NOTE-300) found its phase-transition claim cited out, not shown. Here the bifurcations of the optimal encoder as β grows are computed and plotted for a real meaning space (Fig. 5), though the analysis is in the SI, unread.
  • THEORY-155 and LIT-769. Griffiths and Kalish say where Bayesian transmission takes a language (to the prior); this paper says where efficient systems lie. It gives no transmission model, so it neither supports nor conflicts with THEORY-155; its “evolution” is a path through optima, not a dynamics.
  • Produces THEORY-163, stating C1–C3 with the fitted-source caveat.
  • No instruction for machine-learning practice; nothing for the anthology.

Limitations

  • The need distribution is estimated from the naming data the model is scored on; cross-validation over languages guards the evaluation but the source is still shaped by the systems it explains. Under the uniform source the fit is clearly worse (gNID 0.39).
  • One shared source for all languages, though the authors note communicative needs may differ by culture.
  • The perceptual model is fixed (CIELAB, one σ), and the stimulus set’s irregular layout in CIELAB is a candidate cause of the yellow miss.
  • The control set is hue rotations only; it does not test other structured alternatives.
  • β_l is fitted per language, so “near the bound” is near the bound at the most favourable β.
  • The evolutionary reading is a reading of the optimal path, not a model fitted to historical change.

Open questions

  • Does the near-optimality survive a need distribution measured independently of naming, e.g. from usage? The SI’s image-statistics source is said to do worse; it was not read.
  • Does the same analysis hold in other semantic domains (the authors’ stated next step)?
  • Is there a transmission process whose stationary states lie on the IB curve, joining this to iterated learning?