mlsanityData to 7 Oct 2026

Towards a Data-Parameter Correspondence for LLMs: A Preliminary Discussion

arXiv 2604.17384 ↗First posted 19 Apr 2026cs.LGcited by 0

On the map: LLM safety and security → Machine unlearning

Abstract (arXiv)

Large language model optimization has historically bifurcated into isolated data-centric and model-centric paradigms: the former manipulates involved samples through selection, augmentation, or poisoning, while the latter tunes model weights via masking, quantization, or low-rank adaptation. This paper establishes a unified data-parameter correspondence revealing these seemingly disparate operations as dual manifestations of the same geometric structure on the statistical manifold M. Grounded in the Fisher-Rao metric gij(θ) and Legendre duality between natural (θ) and expectation (η) parameters, we identify three fundamental correspondences spanning the model lifecycle: 1. Geometric correspondence: data pruning and parameter sparsification equivalently reduce manifold volume via dual coordinate constraints; 2. Low-rank correspondence: in-context learning (ICL) and LoRA adaptation explore identical subspaces on the Grassmannian G(r,d), with k-shot samples geometrically equivalent to rank-r updates; 3. Security-privacy correspondence: adversarial attacks exhibit cooperative amplification between data poisoning and parameter backdoors, whereas protective mechanisms follow cascading attenuation where data compression multiplicatively enhances parameter privacy. Extending from training through post-training compression to inference, this framework provides mathematical formalization for cross-community methodology transfer, demonstrating that cooperative optimization integrating data and parameter modalities may outperform isolated approaches across efficiency, robustness, and privacy dimensions.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 59 of its 82 references that are in the map. First posted on arXiv 19 Apr 2026.

Builds on

59 of 82 references.

References · 59

  1. 2017Attention Is All You Needcited by 59,932
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  4. 2022Classifier-Free Diffusion Guidancecited by 5,717
  5. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  6. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  7. 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,222
  8. 2016Membership Inference Attacks against Machine Learning Modelscited by 2,221
  9. 2019Transformer-XL: Attentive Language Models Beyond a Fixed-Length Contextcited by 1,830
  10. 2022Rethinking the Role of Demonstrations: What Makes In-Context Learning Work?cited by 1,413
  11. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
  12. 2020Energy-based Out-of-distribution Detectioncited by 1,296
38 more
  1. 2022Editing Models with Task Arithmeticcited by 1,076
  2. 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
  3. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 780
  4. 2022Transformers learn in-context by gradient descentcited by 714
  5. 2022Automatic Chain of Thought Prompting in Large Language Modelscited by 684
  6. 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 679
  7. 2022What learning algorithm is in-context learning? Investigations with linear modelscited by 671
  8. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  9. 2023Baseline Defenses for Adversarial Attacks Against Aligned Language Modelscited by 608
  10. 2019Gradient based sample selection for online continual learningcited by 568
  11. 2021Fast Model Editing at Scalecited by 491
  12. 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 460
  13. 2014New insights and perspectives on the natural gradient methodcited by 435
  14. 2023Scalable Extraction of Training Data from (Production) Language Modelscited by 415
  15. 2023DoReMi: Optimizing Data Mixtures Speeds Up Language Model Pretrainingcited by 385
  16. 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 337
  17. 2021Self-Diagnosis and Self-Debiasing: A Proposal for Reducing Corpus-Based Bias in NLPcited by 336
  18. 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 285
  19. 2018Subsampled R'enyi Differential Privacy and Analytical Moments Accountantcited by 234
  20. 2026Self-Distillation Enables Continual Learningcited by 212
  21. 2023Efficient Large Language Models: A Surveycited by 183
  22. 2024Security and Privacy Challenges of Large Language Models: A Surveycited by 179
  23. 2024Data Mixing Laws: Optimizing Data Mixtures by Predicting Language Modeling Performancecited by 179
  24. 2023Model Breadcrumbs: Scaling Multi-Task Model Merging with Sparse Maskscited by 130
  25. 2016Robust Large Margin Deep Neural Networkscited by 117
  26. 2024A Survey on Data Selection for LLM Instruction Tuningcited by 76
  27. 2020Regularizing Deep Networks with Semantic Data Augmentationcited by 73
  28. 2025A Survey on Post-training of Large Language Modelscited by 53
  29. 2024Efficient Prompting Methods for Large Language Models: A Surveycited by 46
  30. 2024A Survey of Recent Backdoor Attacks and Defenses in Large Language Modelscited by 36
  31. 2024BlockPruner: Fine-grained Pruning for Large Language Modelscited by 35
  32. 2015Dropout as data augmentationcited by 27
  33. 2025Mix Data or Merge Models? Balancing the Helpfulness, Honesty, and Harmlessness of Large Language Model via Model Mergingcited by 23
  34. 2025Efficient Attention Mechanisms for Large Language Models: A Surveycited by 21
  35. 2025Pay Attention to Attention Distribution: A New Local Lipschitz Bound for Transformerscited by 10
  36. 2025Influence Functions for Efficient Data Selection in Reasoningcited by 10
  37. 2026MergeMix: Optimizing Mid-Training Data Mixtures via Learnable Model Mergingcited by 7
  38. 2025LowRA: Accurate and Efficient LoRA Fine-Tuning of LLMs under 2 Bitscited by 6

50 most cited of 59 All 59 (JSON)

Built on by

Not cited yet.