mlsanityData to 7 Oct 2026

POET-X: Memory-efficient LLM Training by Scaling Orthogonal Transformation

arXiv 2603.05500 ↗First posted 5 Mar 2026cs.LG cs.AI cs.CLcited by 3

Not on the map. Why?

Abstract (arXiv)

Efficient and stable training of large language models (LLMs) remains a core challenge in modern machine learning systems. To address this challenge, Reparameterized Orthogonal Equivalence Training (POET), a spectrum-preserving framework that optimizes each weight matrix through orthogonal equivalence transformation, has been proposed. Although POET provides strong training stability, its original implementation incurs high memory consumption and computational overhead due to intensive matrix multiplications. To overcome these limitations, we introduce POET-X, a scalable and memory-efficient variant that performs orthogonal equivalence transformations with significantly reduced computational cost. POET-X maintains the generalization and stability benefits of POET while achieving substantial improvements in throughput and memory efficiency. In our experiments, POET-X enables the pretraining of billion-parameter LLMs on a single Nvidia H100 GPU, and in contrast, standard optimizers such as AdamW run out of memory under the same settings.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 29 of its 38 references that are in the map. First posted on arXiv 5 Mar 2026.

Builds on

29 of 38 references.

References · 29

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  2. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
  3. 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 447
  4. 2025Muon is Scalable for LLM Trainingcited by 381
  5. 2023Controlling Text-to-Image Diffusion by Orthogonal Finetuningcited by 207
  6. 2023ReLoRA: High-Rank Training Through Low-Rank Updatescited by 200
  7. 2021Scatterbrain: Unifying Sparse and Low-rank Attention Approximationcited by 128
  8. 2023Parameter-Efficient Orthogonal Finetuning via Butterfly Factorizationcited by 112
  9. 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 100
  10. 2018Learning towards Minimum Hyperspherical Energycited by 75
  11. 2019Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizationscited by 73
  12. 2024APOLLO: SGD-like Memory, AdamW-level Performancecited by 50
17 more
  1. 2020Orthogonal Over-Parameterized Trainingcited by 44
  2. 2024SLTrain: a sparse plus low-rank approach for parameter and memory efficient pretrainingcited by 44
  3. 2024Fira: Can We Achieve Full-rank Training of LLMs Under Low-rank Constraint?cited by 39
  4. 2024Memory-Efficient LLM Training with Online Subspace Descentcited by 37
  5. 2024Q-GaLore: Quantized GaLore with INT4 Projection and Layer-Adaptive Low-Rank Gradientscited by 36
  6. 2021Learning with Hyperspherical Uniformitycited by 35
  7. 2025CoLA: Compute-Efficient Pre-Training of LLMs via Low-Rank Activationcited by 28
  8. 2026Controlled LLM Training on Spectral Spherecited by 28
  9. 2023SPDF: Sparse Pre-training and Dense Fine-tuning for Large Language Modelscited by 26
  10. 2024From Low Rank Gradient Subspace Stabilization to Low-Rank Weights: Observations, Theories, and Applicationscited by 24
  11. 2024VeLoRA: Memory Efficient Training using Rank-1 Sub-Token Projectionscited by 18
  12. 2024Training Neural Networks from Scratch with Parallel Low-Rank Adapterscited by 17
  13. 2025GaLore 2: Large-Scale LLM Pre-Training by Gradient Low-Rank Projectioncited by 13
  14. 2024Gradient Weight-normalized Low-rank Projection for Efficient LLM Trainingcited by 11
  15. 2024GaLore+: Boosting Low-Rank Adaptation for LLMs with Cross-Head Projectioncited by 8
  16. 2025Reparameterized LLM Training via Orthogonal Equivalence Transformationcited by 8
  17. 2025Orthogonal Finetuning Made Scalablecited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.