Showing cs.CLShow all
2 papers · 1 filter
cs.CL2026
Language Models Without a Trainable Input Embedding Table: Learning from Fixed Minimal Binary Token Codes
A. Bochkov
We study whether a decoder-only language model requires an independently trainable input vector for every token. For a vocabulary of size , an injective fixed-length binary iden…
cs.CL2025
Emergent Semantics Beyond Token Embeddings: Transformer LMs with Frozen Visual Unicode Representations
A. Bochkov
Understanding the locus of semantic representation in large language models (LLMs) is crucial for interpretability and architectural innovation. The dominant paradigm posits that t…