mlsanityData to 14 Oct 2026

Beyond Efficiency: Molecular Data Pruning for Enhanced Generalization

arXiv 2409.01081 ↗First posted 2 Sep 2024cs.LG cs.AI q-bio.BMcited by 9

Not on the map. Why?

Abstract (arXiv)

With the emergence of various molecular tasks and massive datasets, how to perform efficient training has become an urgent yet under-explored issue in the area. Data pruning (DP), as an oft-stated approach to saving training burdens, filters out less influential samples to form a coreset for training. However, the increasing reliance on pretrained models for molecular tasks renders traditional in-domain DP methods incompatible. Therefore, we propose a Molecular data Pruning framework for enhanced Generalization (MolPeg), which focuses on the source-free data pruning scenario, where data pruning is applied with pretrained models. By maintaining two models with different updating paces during training, we introduce a novel scoring function to measure the informativeness of samples based on the loss discrepancy. As a plug-and-play framework, MolPeg realizes the perception of both source and target domain and consistently outperforms existing DP methods across four downstream tasks. Remarkably, it can surpass the performance obtained from full-dataset training, even when pruning up to 60-70% of the data on HIV and PCBA dataset. Our work suggests that the discovery of effective data-pruning metrics could provide a viable path to both enhanced efficiency and superior generalization in transfer learning.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 54 of its 76 references that are in the map. First posted on arXiv 2 Sep 2024.

Builds on

54 of 76 references.

References · 54

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2024The Llama 3 Herd of Modelscited by 14,715
  3. 2020Scaling Laws for Neural Language Modelscited by 6,586
  4. 2018How Powerful are Graph Neural Networks?cited by 4,393
  5. 2017Neural Message Passing for Quantum Chemistrycited by 3,487
  6. 2022Emergent Abilities of Large Language Modelscited by 2,512
  7. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
  8. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  9. 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
  10. 2020Graph Contrastive Learning with Augmentationscited by 1,208
  11. 2019Strategies for Pre-training Graph Neural Networkscited by 971
  12. 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
38 more
  1. 2017SchNet: A continuous-filter convolutional neural network for modeling quantum interactionscited by 571
  2. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
  3. 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 528
  4. 2022GraphMAE: Self-Supervised Masked Graph Autoencoderscited by 448
  5. 2021Equivariant message passing for the prediction of tensorial properties and molecular spectracited by 441
  6. 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 339
  7. 2023Data Selection for Language Models via Importance Resamplingcited by 329
  8. 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 274
  9. 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 226
  10. 2021ChemRL-GEM: Geometry Enhanced Molecular Representation Learning for Property Predictioncited by 204
  11. 2020Coresets via Bilevel Optimization for Continual Learning and Streamingcited by 192
  12. 2018Adversarial Active Learning for Deep Networks: a Margin Based Approachcited by 158
  13. 2021Active Learning by Acquiring Contrastive Examplescited by 156
  14. 2022DeepCore: A Comprehensive Library for Coreset Selection in Deep Learningcited by 147
  15. 2022GOOD: A Graph Out-of-Distribution Benchmarkcited by 141
  16. 2020Contextual Diversity for Active Learningcited by 139
  17. 2022Dataset Pruning: Reducing Training Data by Examining Generalization Influencecited by 133
  18. 2023InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruningcited by 90
  19. 2023A Survey of Graph Meets Large Language Model: Progress and Future Directionscited by 85
  20. 2024ZeroG: Investigating Cross-dataset Zero-shot Transferability in Graphscited by 85
  21. 2021SIMILAR: Submodular Information Measures Based Active Learning In Realistic Scenarioscited by 84
  22. 2016Coresets for Scalable Bayesian Logistic Regressioncited by 79
  23. 2021RETRIEVE: Coreset Selection for Efficient and Robust Semi-Supervised Learningcited by 74
  24. 2022Molecular Geometry Pretraining with SE(3)-Invariant Denoising Distance Matchingcited by 68
  25. 2017Automated Scalable Bayesian Inference via Hilbert Coresetscited by 55
  26. 2023MolFM: A Multimodal Molecular Foundation Modelcited by 50
  27. 2022Unified 2D and 3D Pre-Training of Molecular Representationscited by 45
  28. 2021Accelerating Deep Learning with Dynamic Data Pruningcited by 43
  29. 2019Small-GAN: Speeding Up GAN Training Using Core-setscited by 41
  30. 2023Towards Foundational Models for Molecular Learning on Large-Scale Multi-Task Datasetscited by 39
  31. 2024Text-Guided Molecule Generation with Diffusion Language Modelcited by 31
  32. 2022Bidirectional Generation of Structure and Properties Through a Single Molecular Foundation Modelcited by 25
  33. 2023Uncovering Neural Scaling Laws in Molecular Representation Learningcited by 23
  34. 2024Rethinking Graph Masked Autoencoders through Alignment and Uniformitycited by 22
  35. 2024textttMiniMol: A Parameter-Efficient Foundation Model for Molecular Learningcited by 20
  36. 2021SVP-CF: Selection via Proxy for Collaborative Filtering Datacited by 14
  37. 2023Better with Less: A Data-Active Perspective on Pre-Training Graph Neural Networkscited by 14
  38. 2022MolE: a molecular foundation model for drug discoverycited by 12

50 most cited of 54 All 54 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 5; 2026: 3.

9 papers.