paper-with-me

Papers

Emergence of Frontier Superposition: Möbius attractor and Cascade Supervision

2026-05-12 · Hongyu Gu, Jingwen Fu arxiv

Superposition allows Transformers to reason in depth, carrying an entire reasoning frontier in parallel through a bounded-depth forward pass instead of unrolling serial chain-of-thought tokens. While Zhu et al. (2025) hand-crafted an equal-weight breadth-first frontier in a single residual stream for graph reachability, it remained open whether gradient descent could ever find this target amidst permutation-symmetric saddles. We close this gap on Reachability-by-Superposition over Erdős-Rényi graphs by isolating architectural and supervisional contributions. Architecturally, we identify a Möbius attractor: under $S_n$-symmetry in the tree regime, layerwise dynamics reduce to a 1D Möbius map whose zero set is a codimension-one manifold of global optima containing the equal-weight superposition state. On the supervision side, we identify Cascade Supervision: a loss class whose backward pass simultaneously delivers (A) selectivity bootstrap, (B) gradient persistence across depth, and (C) per-step discrimination (e.g., \mathcal{L}_{sup} and \mathcal{L}_{node}). End-to-end supervision fails condition (B) and is provably insufficient: internal gradients at layer c decay as (np)^{-(D-c-2)/2} in the graph fan-out and stall before the manifold is reached. Our thesis: Möbius attractor + Cascade Supervision = emergence of superposition reasoning. The parameter-free decay law predicts a final-step cosine of 0.35 vs. 0.71 (end-to-end vs. cascade) at depth D=3; experiments confirm 0.37 vs. 0.69, matching within 0.02 at every step.

📄 PDF Abstract BibTeX arXiv:2605.18820

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

On the Emergence of Cooperation in the Repeated Prisoner's Dilemma

2022-11-24 · Maximilian Schaefer

Using simulations between pairs of $\epsilon$-greedy q-learners with one-period memory, this article demonstrates that the potential function of the stochastic replicator dynamics (Foster and Young, 1990) allows it to pr…

Encoder-Decoder Based Attractors for End-to-End Neural Diarization

2021-06-20 · Shota Horiguchi, Yusuke Fujita, Shinji Watanabe, Yawen Xue 외

This paper investigates an end-to-end neural diarization (EEND) method for an unknown number of speakers. In contrast to the conventional cascaded approach to speaker diarization, EEND methods are better in terms of spea…

Decoderspeaker-diarizationSpeaker Diarization

Front-to-Attractors: Modifying the Front-to-Front Heuristic in Bidirectional Search

2026-06-05 · Alvin Zou, Muhammad Suhail Saleem, Maxim Likhachev arxiv

Heuristics play a central role in the performance of bidirectional search algorithms, which commonly rely on two main classes. Front-to-end (F2E) heuristics estimate the distance from a state s to the target of the searc…

Superposition unifies power-law training dynamics

2026-02-01 · Zixin Jessie Chen, Hao Chen, Yizhou Liu, Jeff Gore arxiv

We investigate the role of feature superposition in the emergence of power-law training dynamics using a teacher-student framework. We first derive an analytic theory for training without superposition, establishing that…

Random Features Hopfield Networks generalize retrieval to previously unseen examples

2024-07-08 · Silvio Kalaj, Clarissa Lauditi, Gabriele Perugini, Carlo Lucibello 외

It has been recently shown that a learning transition happens when a Hopfield Network stores examples generated as superpositions of random features, where new attractors corresponding to such features appear in the mode…

Retrieval