mlsanityData to 7 Oct 2026

DOTResize: Reducing LLM Width via Discrete Optimal Transport-based Neuron Merging

arXiv 2507.04517 ↗First posted 6 Jul 2025cs.LG cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

Structured pruning methods designed for Large Language Models (LLMs) generally focus on identifying and removing the least important components to optimize model size. However, in this work, we question this prevalent approach by instead exploring how to recombine information from structures designated for pruning back into the reduced model. We specifically focus on neuron width reduction, and frame this problem as a Discrete Optimal Transport problem, and propose DOTResize, a novel Transformer compression method that uses optimal transport theory to transform and compress model width. To ensure applicability within the Transformer architecture, we motivate and incorporate necessary entropic regularization and matrix factorization techniques into the transportation maps produced by our method. Unlike pruning-based approaches which discard neurons based on importance measures, DOTResize re-projects the entire neuron width, allowing the retention and redistribution of useful signal across the reduced layer. Empirical results show that compared to simple or state-of-the-art neuron width-pruning techniques, DOTResize serves as a useful add-on to pruning, while achieving measurable reductions in real-world computational cost.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 30 of its 38 references that are in the map. First posted on arXiv 6 Jul 2025.

Builds on

30 of 38 references.

References · 30

  1. 2017Attention Is All You Needcited by 59,932
  2. 2024The Llama 3 Herd of Modelscited by 14,192
  3. 2024Qwen2.5 Technical Reportcited by 4,713
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  5. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  6. 2016Pointer Sentinel Mixture Modelscited by 2,992
  7. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  8. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  9. 2020GLU Variants Improve Transformercited by 1,724
  10. 2019Root Mean Square Layer Normalizationcited by 1,425
  11. 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,311
  12. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
18 more
  1. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
  2. 2024Phi-4 Technical Reportcited by 675
  3. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
  4. 2024QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMscited by 598
  5. 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 460
  6. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
  7. 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 317
  8. 2024Model Merging in LLMs, MLLMs, and Beyond: Methods, Theories, Applications and Opportunitiescited by 247
  9. 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 219
  10. 2019Model Fusion via Optimal Transportcited by 217
  11. 2023ZipIt! Merging Models from Different Tasks without Trainingcited by 178
  12. 2015Data-free parameter pruning for Deep Neural Networkscited by 112
  13. 2022Re-basin via implicit Sinkhorn differentiationcited by 61
  14. 2023Transformer Fusion with Optimal Transportcited by 35
  15. 2024DISP-LLM: Dimension-Independent Structural Pruning for Large Language Modelscited by 24
  16. 2024Merging Text Transformer Models from Different Initializationscited by 16
  17. 2024Towards Meta-Pruning via Optimal Transportcited by 8
  18. 2023Diffused Redundancy in Pre-trained Representationscited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.