Beyond Efficiency: Molecular Data Pruning for Enhanced Generalization

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.

Paper

References (76)

Scroll for more · 38 remaining

Similar papers

Peer review

Reviewer uU9Z6/10 · confidence 3/52024-07-08

Summary

The paper presents a new framework MolPeg aimed at improving the efficiency and generalization of training models in molecular tasks using pretrained models. MolPeg introduces a novel DP technique that maintains two models with different update paces during training, leveraging the loss discrepancy between these models to score and select the most informative samples. This approach is applied in a source-free data pruning scenario, which does not require access to the original pretraining data. Extensive experiments across four molecular tasks demonstrate the effectiveness of MolPeg method.

Strengths

1. The paper introduces a novel approach to data pruning by leveraging pretrained models and a loss discrepancy scoring mechanism. 2. The paper is well-organized, with a clear presentation of the problem, the proposed solution, and the experimental results. 3. The experiments are comprehensive, covering multiple datasets and tasks, and provide empirical evidence supporting the efficacy of MolPeg.

Weaknesses

1. The effectiveness of MolPeg is highly dependent on the quality and suitability of the pretrained models utilized. If appropriate pretrained models are unavailable, the benefits of MolPeg may not be fully realized. 2. The proposed framework requires the maintenance and simultaneous updating of two models, which could increase both implementation complexity and computational overhead compared to simpler pruning methods. 3. Most DP methods demonstrate their effectiveness on widely-used datasets such as ImageNet. However, molecular datasets represent a more specialized field. It is crucial to test MolPeg with mainstream validation datasets to further demonstrate its effectiveness.

Questions

Please refer to weakness 3, why not validate the effectiveness of MolPeg with mainstream datasets? Molecular datasets belong to a more specialized field and seem less persuasive compared to datasets like ImageNet.

Rating

6

Confidence

3

Soundness

2

Presentation

3

Contribution

3

Limitations

Yes

Authorsrebuttal2024-08-08

Correction of Typing Error in Complexity Analysis

Dear Reviewer uU9Z, During our proofreading process, we discovered a typing error in the time complexity of the forward passes for the MolPeg method. It should be $ \mathcal{O}(2H_{fw}(T\delta N)) $, while the textual analysis in the initial rebuttal is correct. We sincerely apologize for this oversight and invite you to refer to the corrected time complexity table below: | | MolPeg complexity | Other methods complexity | | ------------------- | ------------------------------------------- | ----------------------------------------------------------- | | **Forward passes** | $ \mathcal{O}(2H_{fw}(T\delta N)) $ | $ \mathcal{O}(H_{fw}((t + T\delta)N)) $ | | | forwarding both online and reference models | forwarding online model in pre-scoring and training epochs | | **Backward passes** | $ \mathcal{O}(H_{bw}(T\delta N)) $ | $ \mathcal{O}(H_{bw}((t + T\delta)N)) $ | | | backwarding only the online model | backwarding parameters in both pre-scoring and training epochs | We appreciate your understanding and attention to this correction. Best regards, Authors

Reviewer mAK47/10 · confidence 4/52024-07-09

Summary

By utilizing the pre-trained models, this paper presents a plug-and-play framework (MolPeg) to prune target data without source dataset. By maintaining two models with different updating paces during training, this paper introduces a novel scoring function to measure the informativeness of samples based on the loss discrepancy. The experimental results on 3 datasets shows the enhanced efficiency and superior generalization in transfer learning.

Strengths

- This paper is well-written. Each component of the design space is carefully explained and well-presented. - This method is easy to follow can be adapted to other tasks. - Extensive experiments are conducted to verify the effectiveness of this method.

Weaknesses

(Minor) Missing recent works: 1) static data pruning [1,2], 2) dynamic data pruning [3] 1. Active learning is a strong baseline for data subset selection. NeurIPS workshop, 2022 2. CCS: Coverage-centric Coreset Selection for High Pruning Rates. ICLR, 2023 3. Prioritized Training on Points that are Learnable, Worth Learning, and Not Yet Learnt. ICML, 2022

Questions

See weakness.

Rating

7

Confidence

4

Soundness

4

Presentation

4

Contribution

3

Limitations

See weakness.

Reviewer zkte5/10 · confidence 4/52024-07-10

Summary

The paper introduces MolPeg, a molecular data pruning framework designed to enhance generalization when applying data pruning to pretrained models for molecular tasks. MolPeg uses two models with different updating rates to develop a new scoring function that assesses the informativeness of data based on loss discrepancies.

Strengths

1. By maintaining dual models that focus on both source and target domains and introducing a novel scoring function that selects both easy and hard samples, MolPeg achieves efficient, lightweight data pruning without the need for retraining. 2. The paper provides the code, ensuring the reproducibility of the method. I will attempt to run the code in the coming weeks and may modify my review comments as necessary.

Weaknesses

1. Although the paper claims to be pioneering in applying data pruning to pretrained models, the motivation may require further exploration. Specifically, how can it ensure that OOD samples crucial for each task are not pruned, which could potentially undermine the very purpose of the pretrained model? 2. The definition of what constitutes a 'hard case' is unclear. Are these cases task-specific? If so, there's a risk that pruning might eliminate hard cases essential for certain tasks, affecting the model's comprehensiveness and utility. 3. The approach might exacerbate the 'molecular cliff' problem, where slight changes in molecular structure lead to significant changes in activity, and such nuances could be lost with aggressive data pruning in pre-training. 4. The experimental section is limited to only three commonly used molecular datasets. Other equally important datasets, such as MUV, were not included in the comparisons.

Questions

None

Rating

5

Confidence

4

Soundness

3

Presentation

3

Contribution

2

Limitations

It is suggested that the discussion of limitations be moved to the main text.

Area Chair RaHc2024-08-13

Hi Reviewer zkte, Does the author’s response address your concerns? Please acknowledge that you have read the responses at your earliest convenience. Best wishes, AC

Authorsrebuttal2024-08-09

Dear Reviewer uU9Z, We are delighted that most of your concerns have been addressed and truly appreciate your openness towards accepting our work. We understand that the final rating will be made after further discussions with other reviewers, and we hope that our manuscript continues to stand out during this process. If there are any remaining questions or additional clarifications needed, please feel free to reach out to us. We are more than happy to provide further information. Thank you again for your time and consideration. Best regards, Authors

Area Chair RaHc2024-08-11

Dear Reviewers, The deadline of reviewer-authors discussion is approaching. If you have not done so already, please check the rebuttal and provide your response at your earliest convenience. Best wishes, AC

Reviewer mAK42024-08-11

Thanks for the response. I've read through other reviewers' feedback and responses as well. I have no more questions and will keep the score as it is. Best regards, Reviewer mAK4

Authorsrebuttal2024-08-12

Dear Reviewer zkte, We wanted to gently remind you that the deadline for the discussion phase is approaching, and we would greatly appreciate it if you could take a moment to review our responses. Your feedback is very valuable to us, and we are eager to hear your thoughts. If there are any additional concerns or points of clarification, we are more than happy to address them. Thank you for your time and consideration. Best wishes, Authors

Authorsrebuttal2024-08-14

Dear Reviewer uU9Z, We hope this message finds you well. We sincerely appreciate the time and effort you've dedicated to reviewing our submission and your thoughtful consideration of our rebuttal. Your feedback has been invaluable in helping us refine our work. We understand that you may still be discussing the paper with other reviewers. As the Author-Reviewer discussion phase is coming to a close, we would greatly appreciate **any updates you may have on the current ratings**. We would also appreciate any further comments and questions. Thank you once again for your careful consideration! Best regards, Authors

Program Chairsdecision2024-09-25

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC