Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Preprint . 2026
License: CC BY
Data sources: ZENODO
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Preprint . 2026
License: CC BY
Data sources: ZENODO
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Preprint . 2026
License: CC BY
Data sources: ZENODO
ZENODO
Preprint . 2026
License: CC BY
Data sources: Datacite
ZENODO
Preprint . 2026
License: CC BY
Data sources: Datacite
ZENODO
Preprint . 2026
License: CC BY
Data sources: Datacite
ZENODO
Preprint . 2026
License: CC BY
Data sources: Datacite
versions View all 4 versions
addClaim

Hard-Gating Collapse Dynamics: Selection Hardness as the Organizing Parameter for Robust Sparse Routing

Authors: Saka, Hakan;

Hard-Gating Collapse Dynamics: Selection Hardness as the Organizing Parameter for Robust Sparse Routing

Abstract

Hard discrete selection — gating that retains exactly k of n features and suppresses the rest — produces abrupt collapse in task performance as noise increases. This collapse is architecturally invariant: it appears across implementations within the hard-gating class G_hard and is absent in soft attention. We identify selection hardness H_s(G) := H(F_1 | G(F_1)) as the dominant organizing quantity for this collapse behavior: higher H_s corresponds to more discrete, information-destroying gating, and predicts earlier, sharper collapse. F1.1, a minimal extension of hard selection that adds a safety margin of m redundant features, modulates H_s(G_m) without exiting the hard-gating class. Under matched computational budgets (both using 8 effective features), F1.1 outperforms sparsified soft attention (acc=0.755 vs 0.679), establishing a Pareto-superior robustness-compute trade-off. A Saturation Lemma (companion theoretical work) formally predicts that performance differences vanish at extreme noise, explaining the compressed effect size without invalidating the mechanism. Exploratory experiments under high-redundancy regimes show compression of architectural differences, consistent with the regime-dependent interpretation. Together these results establish selection hardness as the dominant organizing quantity for resource-efficient hard-gating architectures within the studied regime. Companion Papers: **Saka, H. (2026a).** Toward a Reframing of the Hard Problem of Consciousness: Subjective Reality, Feeling, andthe Origins of the Conceptual World. Version 7.19. PhilPapers. https://philpapers.org/rec/SAKTAR **Saka, H. (2026b).** Organizational Phenomenology: Artificial F1 and the Geometry of Coherent Agency. Zenodo. https://doi.org/10.5281/zenodo.20555024 **Saka, H. (2026c-Theory).** Artificial F1: Full Computational Model — Selection Hardness, Non-Scalarizability, and Phase Transition in Bounded Evaluative Architectures. https://doi.org/10.5281/zenodo.20524004 Keywords: sparse gating, hard selection, selection hardness, gating collapse,mixture of experts, inductive bias, noise robustness,compute efficiency, phase transition, representation constitution

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average