mlsanityData to 14 Oct 2026

CoCurve: Cross-Module Co-Pruning Curvature for Structured LLM Pruning

arXiv 2607.17568 ↗First posted 20 Jul 2026cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Resource-constrained deployment requires sustaining large language model (LLM) capabilities as models scale under fixed memory and computation budgets. Structured pruning advances this deployment frontier with smaller dense checkpoints, yet deciding what to prune remains bottlenecked by interactions among joint removals. We introduce Cross-Module Co-Pruning Curvature (CoCurve), which formulates structured pruning as set-dependent predictive risk over a unified inventory of attention heads and feed-forward groups. A co-pruning graph built from single-unit forward ablations assigns individual risk to nodes and reinforcement or cancellation to interaction edges, conditioning each decision on the units already removed. We evaluate 6 LLMs (3B--70B) and 3 vision--language models (VLMs) across 3 perplexity corpora, 12 language tasks, and 7 multimodal benchmarks. Across the five-model 20--40% grid and the 70B 10--50% sweep, CoCurve ranks first in 53/60 corpus comparisons (15/15 at 70B); matched-quality interpolation permits 2.2--6.6 more pruning points in 9/10 cases, while CoCurve leads all 6 VLM Avg7 blocks. After the same lightweight recovery, its retained structures remain strongest through 50% pruning, where the 8B checkpoint regains 10.8 Avg12 points; physical slicing delivers 1.58× dense prefill throughput with 41% lower peak memory. Mechanism analysis across 10 LLMs and 7 VLMs finds organized within- and cross-module edge structure; matched low-saliency, high-coupling removals degrade 19/20 capability groups by up to 23.7 points.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 16 of its 73 references that are in the map. First posted on arXiv 20 Jul 2026.

Builds on

16 of 73 references.

References · 16

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  4. 2025Qwen2.5-VL Technical Reportcited by 5,587
  5. 2024Qwen2.5 Technical Reportcited by 4,942
  6. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  7. 2024Qwen2-VL: Enhancing Vision-Language Model's Perception of the World at Any Resolutioncited by 4,234
  8. 2023Mistral 7Bcited by 3,164
  9. 2025Qwen3-VL Technical Reportcited by 2,793
  10. 2025InternVL3: Exploring Advanced Training and Test-Time Recipes for Open-Source Multimodal Modelscited by 1,834
  11. 2024Yi: Open Foundation Models by 01.AIcited by 719
  12. 2023The Hydra Effect: Emergent Self-repair in Language Model Computationscited by 156
4 more
  1. 2018Faster gaze prediction with dense networks and Fisher pruningcited by 94
  2. 2024Everybody Prune Now: Structured Pruning of LLMs with only Forward Passescited by 43
  3. 2026Conditional Co-Ablation: Recovering Self-Repair Backups in Transformer Circuitscited by 9
  4. 2026CodecSight: Leveraging Video Codec Signals for Efficient Streaming VLM Inferencecited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.