arXiv Machine Learning By Taebong Kim, Youngsik Hong, Minsik Kim, Sunyoung Choi, Jaewon Jang, Minseo Kim

Placement Is Free, Composition Is Not: The Latin Square as a Provably-Balanced Construction for Heterogeneous Sequence-Mixer Stacks

Read the original on arXiv Machine Learning →

The paper introduces Aether‑7B‑5Attn, a 6.59B‑parameter mixture‑of‑experts Transformer that arranges seven distinct sequence‑mixing mechanisms in a 7×7 Latin square across 49 layers, ensuring each mechanism appears exactly once per row and column. Experiments with a 4×4 Latin‑square proxy and larger 1.514B‑parameter models show that balanced heterogeneous composition across depth yields near‑optimal performance, while clustering mechanisms or using a homogeneous stack incurs measurable penalties. The authors provide detailed cost profiles, multilingual evaluations, a causal‑safety audit, and release all code and weights.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
6d ago

Layerwise Repacking: Variable-Length Hybrid-Attention Training without an Extra Redistribution Pass

The paper introduces Layerwise Repacking, a technique that eliminates an extra data redistribution step when training hybrid‑attention models with variable‑length sequences. By keeping full‑attention layers in wide sequence‑parallel groups (SP16/32) and repacking samples into node‑local sparse children (SP1/2/4/8) within the same all‑to‑all communication, the method preserves hidden‑state continuity and avoids costly inter‑node transfers. Experiments on a 1F3S hybrid‑attention model show that repacking alone cuts end‑to‑end training time by ~6 % and boosts FLOP utilization, with an improved solver further reducing time by ~7.6 % and increasing utilization by ~4.8 %.

By Jiahao Zhang, Junwei Feng, Dongliang Huang, Xiaoling Zhou, Yiqiao Liao, Chengru Song
arXiv Computation and Language
Sep 25

Baseline Shape Decides the Verdict: A Controlled Re-Examination of Ternary Language Models at 60K Parameters

The study re‑examines a reported advantage of a routed ternary (1.58‑bit) language model over a full‑precision transformer at 60K parameters. By running controlled experiments with multiple seeds and a fixed training recipe, the authors find that the apparent benefit largely stems from the choice of baseline model shape rather than the ternary architecture itself. While the routed model does outperform other shapes at a larger 130M‑byte budget, its advantage diminishes when a plain gated diagonal‑SSM block is used, and the ternary penalty varies with architecture and quantization details.

By Gautam Veldanda