Newest papers

Cola2: Co-Adaptive Hierarchical Language Modeling with Continuous Semantic Compression and Balanced Discrete Generation

Hongcan Guo, Yian Zhao, Feng Wang, Shen Nie, Guoqiang Wei, Yan Zeng, Hengshuang Zhao · 2026 · arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.31305 · cited by 0 works (OpenAlex) · open-access PDF

French

La génération de langue hiérarchique potentielle sépare la modélisation sémantique continue de la réalisation discrète du texte, mais son efficacité dépend de ce que comprime l'espace latent et de la façon dont le générateur discret l'utilise. Nous proposons Cola2, un cadre qui étudie conjointement la compression sémantique continue, l'équilibre entre la reconstruction et la génération, et la co-adaptation discrète continue. Cola2 segmente dynamiquement le texte dans les espaces sémantiques, contrôle le taux de compression par des commentaires négatifs sans perte auxiliaires et combine la reconstruction et la supervision de la génération pour apprendre les représentations latentes compactes et prédictives. Un décodeur de diffusion masqué à cause de bloc est formé

Machine translation (Meta M2M100); the English original follows.

Abstract

Hierarchical language generation separates continuous semantic modeling from discrete text realization, but its effectiveness depends on what the latent space compresses and how the discrete generator uses it. We propose Cola2, a framework that jointly studies continuous semantic compression, the balance between reconstruction and generation, and continuous-discrete co-adaptation. Cola2 dynamically segments text into semantic spans, controls the compression rate through auxiliary-loss-free negative feedback, and combines reconstruction and generation supervision to learn compact, predictive latent representations. A block-causal masked diffusion decoder is trained with clean, noisy, and dropped latent conditions, while classifier-free guidance adjusts the balance between semantic reconstruction and autonomous generation. Token-prediction gradients update the encoder through the latents, whereas Flow Matching prior learning is decoupled from representation learning by stop-gradient. During inference, generated text is re-encoded under a fixed span layout to keep the latent history consistent with the actual text context. Experiments on five downstream tasks with about 210 billion training tokens validate the core designs and show competitive, unsaturated scaling. With 346.03 billion source tokens, an unconverged checkpoint reaches a 60.10 average across eight tasks and surpasses Llama-3-8B on HellaSwag and StoryCloze despite its reported pretraining budget being over 43 times larger. These results demonstrate the potential of continuous-latent hierarchical language generation.

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Topics: Computer science, Language model, Artificial intelligence, Generator (circuit theory), Natural language processing, Encoder

Is this paper real? This page was built from OpenAlex and arXiv records, not generated. Software can verify any reference in one call: GET https://store.agentexchange.work/gw/papers/verify?title=...&year=... (0.003 USD), fetch this record as JSON with /gw/papers/paper?id=2610.31305, or list what it cites with /gw/papers/references?id=.... Pay per call in USDC (x402) or with a 19 USD card key for 1,000 calls. Catalogue · llms.txt

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange