Pith. sign in

REVIEW 24 cited by

Representation Degeneration Problem in Training Natural Language Generation Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1907.12009 v1 pith:34ZZCEDE submitted 2019-07-28 cs.CL

Representation Degeneration Problem in Training Natural Language Generation Models

classification cs.CL
keywords problemlanguagerepresentationtrainingdegenerationgenerationnaturalembeddings
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We study an interesting problem in training neural network-based models for natural language generation tasks, which we call the \emph{representation degeneration problem}. We observe that when training a model for natural language generation tasks through likelihood maximization with the weight tying trick, especially with big training datasets, most of the learnt word embeddings tend to degenerate and be distributed into a narrow cone, which largely limits the representation power of word embeddings. We analyze the conditions and causes of this problem and propose a novel regularization method to address it. Experiments on language modeling and machine translation show that our method can largely mitigate the representation degeneration problem and achieve better performance than baseline algorithms.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 24 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. STRABLE: Benchmarking Tabular Machine Learning with Strings

    cs.LG 2026-05 unverdicted novelty 8.0

    A new corpus of 108 mixed string-numeric tables shows that advanced tabular learners with basic string embeddings perform well on most real-world data, while large LLM encoders help on free-text heavy tables.

  2. Channel Location Constrains the Auditability of Subliminal Learning

    cs.LG 2026-06 unverdicted novelty 7.0

    Auditability of subliminal learning is constrained by channel location, with initialization-dependent body channels allowing pre-training screens while vocabulary geometry and conditional body channels evade them.

  3. How Does Attention Help? Insights from Random Matrices on Signal Recovery from Sequence Models

    stat.ML 2026-05 conditional novelty 7.0

    Attention pooling produces a free-multiplicative-convolution bulk spectrum and two phase transitions for signal recovery; optimal weights are the top eigenvector of the positional correlation matrix R.

  4. LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale

    cs.LG 2022-08 conditional novelty 7.0

    LLM.int8() performs 8-bit inference for transformers up to 175B parameters with no accuracy loss by combining vector-wise quantization for most features with 16-bit mixed-precision handling of systematic outlier dimensions.

  5. SpecFormer: Mitigating Embedding and Attention Collapse via Spectral-Aware Transformer for Recommendation

    cs.IR 2026-07 conditional novelty 6.0

    A spectral-softening Transformer that flattens embedding singular values reduces attention collapse and improves CTR prediction accuracy in recommender systems.

  6. Reliability Scaling Laws for Quantized Large Language Models

    cs.LG 2026-07 conditional novelty 6.0

    Reliability of quantized LLMs peaks nonlinearly at 4-bit precision under fixed total model bits, while accuracy scales monotonically, and quantization can improve robustness to natural perturbations.

  7. Decoupled Residual Quantization for Robust Semantic IDs in Recommendation

    cs.IR 2026-06 unverdicted novelty 6.0

    Presents a diagnostic framework for semantic ID tokenizer failures using overlap and capacity metrics and proposes DRQ to separate geometry from distribution matching.

  8. NITP: Next Implicit Token Prediction for LLM Pre-training

    cs.CL 2026-05 conditional novelty 6.0

    NITP augments next-token prediction with cosine alignment to stop-gradient shallow-layer features of the next token, improving geometry and downstream scores at ~2% extra training FLOPs.

  9. NITP: Next Implicit Token Prediction for LLM Pre-training

    cs.CL 2026-05 unverdicted novelty 6.0

    NITP augments standard next-token prediction with implicit semantic prediction in representation space using shallow-layer self-supervision, reporting consistent downstream gains on 0.5B-9B models including 5.7% on MM...

  10. Layer-wise Representation Dynamics: An Empirical Investigation Across Embedders and Base LLMs

    cs.LG 2026-05 unverdicted novelty 6.0

    LRD framework with Frenet, NRS, and GFMI metrics shows layer-wise structure in 31 models provides usable signal for model selection and pruning on MTEB tasks.

  11. Geometric Decoupling: Diagnosing the Structural Instability of Latent

    cs.CV 2026-04 unverdicted novelty 6.0

    Latent diffusion models exhibit geometric decoupling where curvature in out-of-distribution generation is misallocated to unstable semantic boundaries instead of image details, identifying geometric hotspots as the st...

  12. Towards Faster Language Model Inference Using Mixture-of-Experts Flow Matching

    cs.AI 2026-04 unverdicted novelty 6.0

    Mixture-of-experts flow matching enables non-autoregressive language models to achieve autoregressive-level quality in three sampling steps, delivering up to 1000x faster inference than diffusion models.

  13. Geometry-Aware Localized Watermarking for Copyright Protection in Embedding-as-a-Service

    cs.CR 2026-04 unverdicted novelty 6.0

    GeoMark decouples local watermark triggering from centralized ownership attribution using geometry-separated anchors and adaptive neighborhoods to improve robustness against paraphrasing, dimension changes, and cluste...

  14. Revisiting Anisotropy in Language Transformers: The Geometry of Learning Dynamics

    cs.CL 2026-04 unverdicted novelty 6.0

    Anisotropy in language transformers arises because training amplifies tangent directions, with activation-based low-rank proxies capturing unusually large gradient energy and anisotropy share compared to controls.

  15. Maximizing Local Entropy Where It Matters: Prefix-Aware Localized LLM Unlearning

    cs.CL 2026-01 conditional novelty 6.0

    PALU improves LLM unlearning by restricting entropy maximization to sensitive prefixes and top-k logits, achieving better forgetting with less utility loss.

  16. Maximizing Local Entropy Where It Matters: Prefix-Aware Localized LLM Unlearning

    cs.CL 2026-01 conditional novelty 6.0

    PALU shows that unlearning only needs local intervention—the first few tokens of the sensitive span and the top-k logits—not full-sequence, full-vocabulary suppression.

  17. Scaling Point-in-Time Language Models

    cs.CL 2026-04 conditional novelty 5.5

    Scaling point-in-time decoder-only LMs to 4B parameters on 1T chronologically filtered FineWeb tokens largely closes the quality gap to unrestricted open models while preserving temporal validity.

  18. How to deal with machine learning bias in economic history

    econ.GN 2026-06 unverdicted novelty 5.0

    The paper guides ML use in economic history, identifies systematic prediction bias that distorts coefficients, and shows debiasing via small expert-labeled samples can correct it while preserving scale.

  19. NITP: Next Implicit Token Prediction for LLM Pre-training

    cs.CL 2026-05 unverdicted novelty 5.0

    NITP adds dense supervision from shallow model layers to predict implicit next-token semantics, yielding consistent downstream gains on 0.5B-9B models with ~2% extra training FLOPs.

  20. HyperLens: Quantifying Cognitive Effort in LLMs with Fine-grained Confidence Trajectory

    cs.AI 2026-05 unverdicted novelty 5.0

    HyperLens reveals that deeper transformer layers magnify small confidence changes into fine-grained trajectories, allowing quantification of cognitive effort where complex tasks demand more and standard SFT can reduce it.

  21. Scaling Point-in-Time Language Models

    cs.CL 2026-04 conditional novelty 5.0

    Scaling point-in-time LLMs to 4B parameters and 1T temporally filtered tokens narrows the gap to unrestricted models to about 8–11 average points and yields positive out-of-sample Sharpe ratios from news embeddings.

  22. Smarter, Better, Faster, Longer: A Modern Bidirectional Encoder for Fast, Memory Efficient, and Long Context Finetuning and Inference

    cs.CL 2024-12 unverdicted novelty 5.0

    ModernBERT is a new bidirectional encoder model achieving SOTA performance on diverse classification and retrieval benchmarks while offering superior speed and memory efficiency for long-context inference.

  23. Learning to Prompt: Improving Student Engagement with Adaptive LLM-based High-School Tutoring

    cs.AI 2026-06 unverdicted novelty 4.0

    An adaptive prompt router trained in simulation and deployed with high-school students improves exercise conversion to 28.1% and cuts conversation length by about 3 turns compared with static baselines.

  24. Elucidating Representation Degradation Problem in Diffusion Model Training

    cs.LG 2026-05 unverdicted novelty 4.0

    Diffusion models suffer representation degradation at high noise due to recoverability mismatch; ERD mitigates this by dynamic optimization reallocation, accelerating convergence across backbones.