- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
DIVE estimates per-sample influence at the batch level with a Hessian-free inner product and flips the gradient sign of negatively influential samples, so that “detrimental” samples contribute constructively instead of being removed. The method is evaluated on noisy-label image benchmarks and Gemma-3-12B LoRA fine-tuning.
Critical strengths
-
Interesting reframing. Turning detrimental samples into beneficial gradient contributions is conceptually appealing and differs from the usual remove/downweight paradigm.
-
Simple core operation. Once influence signs are available, sign-flipping negative samples is easy to describe and does not modify raw data.
Critical weaknesses
-
Novelty and positioning are not sufficiently established. The idea is close to Negative Learning, Gradient Reversal, and noisy-label methods that exploit or reweight noisy samples. The paper distinguishes DIVE by saying it needs no prior noise labels or loss thresholds, but this distinction needs sharper mechanistic and empirical argument. The claim of being “the first to transform detrimental samples into beneficial contributions” is too broad. Strong noisy-label baselines (Co-teaching, DivideMix, ELR, SOP, JoCoR, etc.) are missing, so the comparison does not establish SOTA-level contribution.
-
Theoretical/mechanistic justification for sign flipping is weak. Eq. (3) flips negative-influence gradients, but a positive inner product with a validation/reference gradient does not guarantee descent on validation loss in a non-convex model. The observed instability at very frequent editing (k=1) suggests the operation can amplify noise. The paper needs a decomposition or bound relating the DIVE update to the validation gradient, and analysis of when flipping helps versus destabilizes optimization.
-
Influence estimation is coarse, and sign reliability is not validated. Eq. (2) is a Hessian-free approximation, and experiments score only the last layer/head or LoRA adapters. The key assumption—that coarse influence preserves the polarity of samples—is not quantitatively verified. The “detrimental sample verification” is somewhat circular: improved performance after correction may reflect regularization/noise injection rather than correct identification. Needed: agreement between estimated and leave-one-out influence signs, correlation with true noise labels, composition of flipped samples (mislabeled vs. hard-clean), and sign stability across scoring layers.
-
Practical integration and efficiency are not convincingly demonstrated. The method is implemented in JAX because it natively supports sample-level gradients; PyTorch by default provides batch-level gradients, and prior work resorts to approximations such as ghost influence or layer-wise estimation. The paper claims seamless integration into standard optimization, but provides no PyTorch implementation or benchmark. “Lightweight” is supported only on image benchmarks (Table 2, ~1.09× vanilla) with last-layer scoring; there is no LLM runtime, memory, or throughput measurement. For Gemma-3-12B LoRA fine-tuning, per-sample LoRA gradients and periodic editing may add nontrivial overhead. The efficiency claim should be restricted accordingly.
-
Experiments are not sufficiently thorough.
Questions for authors
see weakness
8 comments
Response to Reviewer igAq [2/5]
Theoretical Justification. DIVE determines whether a sample is beneficial or detrimental based on its gradient alignment with a reference signal, which can be either the validation gradient or the mini-batch mean gradient (self-influence). Given this signal, we can formulate data intervention as a constrained optimization problem: for each sample gradient , we seek to maximize , subject to . The optimal solution is for nonzero alignment. Thus, gradient reversal emerges as the optimal intervention within this constrained weighting formulation, maximizing alignment with the reference direction while preserving the original gradient magnitude. In contrast, sample removal sets , discarding the sample's potential contribution.
From an intuitive perspective, whether using a validation gradient or the mini-batch mean gradient (self-influence), DIVE establishes a reference direction for optimization. Samples whose gradients align with this direction contribute positively, whereas those pointing in the opposite direction are considered detrimental. Rather than discarding these detrimental samples, DIVE reverses their gradients to align with the reference direction, thereby transforming otherwise detrimental contributions into beneficial ones. This provides an intuitive explanation for why gradient reversal can be more effective than sample removal.
Effect of Gradient Editing Frequency. We would like to clarify that the performance degradation observed at in Figure 1E should not necessarily be attributed to noise amplification. DIVE performs gradient editing based on the current reference direction, which constitutes a local, greedy intervention. Although each reversal improves the alignment of the edited gradient with the current reference direction, such local improvements do not guarantee globally optimal optimization dynamics.
Interestingly, our additional experiments extending DIVE to other application scenarios reveal a new observation regarding gradient editing frequency. In our original experiments with relatively small classification networks, applying gradient reversal at every mini-batch () can be overly aggressive, and a more moderate frequency () achieves better performance, as shown in Figure 1E. In contrast, in our extensions to mathematical reasoning with GRPO, safety-oriented preference optimization with DPO, and instruction following with larger language models, DIVE consistently improves performance using (see Extension to Other Applications below).
These findings suggest that the appropriate intervention frequency may depend on model scale and training setting. While smaller networks may be more sensitive to frequent gradient reversal, larger language models appear capable of accommodating interventions at every mini-batch. Thus, is not inherently detrimental, and the optimal editing frequency is likely to be setting-dependent. A more systematic investigation of this relationship is an interesting direction for future work.
Influence Estimation. We would like to clarify that our primary contribution lies in data intervention rather than data valuation. Specifically, DIVE aims to transform detrimental samples into beneficial contributions through gradient reversal, and we investigate this intervention strategy in the setting of dynamic data valuation. We do not claim novelty in influence estimation itself.
We acknowledge that last-layer gradient-based influence estimation is a coarse-grained approximation of full-parameter influence. However, in dynamic data valuation, computational cost is a major bottleneck, as per-sample gradients must be repeatedly estimated throughout training. This creates an inherent trade-off between estimation fidelity and computational efficiency, making approximations practically necessary for large-scale models. Following prior literature on efficient influence estimation, we adopt last-layer gradients as a computationally tractable alternative, accepting a potential loss in estimation fidelity in exchange for substantially reduced computational cost. Importantly, our scoring-layer ablation in Figure 1F demonstrates that this approximation remains effective for DIVE's intervention strategy, even when influence estimation is restricted to the final layer.
Response to Reviewer igAq [3/5]
Dynamic Nature of Detrimental Samples. We would like to emphasize that, in dynamic data valuation, whether a sample is beneficial or detrimental is not a universal or intrinsic property of the sample, but depends on the current model state and training stage. As discussed in prior data valuation literature, once a beneficial sample contributes to a parameter update, its information may be partially absorbed by the model, potentially changing its subsequent influence. The same reasoning applies to detrimental samples: a sample identified as detrimental at one stage may no longer be detrimental at another. Importantly, even a sample with a ground-truth noisy label is not necessarily detrimental throughout training. Therefore, noisy-label status should not be treated as a fixed ground-truth indicator of dynamic sample influence, and a static correlation between the two would not fully capture the phenomenon studied here.
Detrimental samples are defined by their negative impact on model performance. DIVE dynamically estimates their influence and reverses the gradients of samples identified as detrimental. To evaluate this intervention, DIVE_r serves as a direct baseline, using the same influence estimation but removing detrimental contributions instead of reversing them. As shown in Tables 1 and 3, DIVE consistently outperforms DIVE_r across all six benchmarks, with average improvements of 0.81 and 0.86 percentage points, respectively. These results provide empirical evidence that gradient reversal is more effective than simply discarding dynamically identified detrimental contributions.
Practical Integration with PyTorch. Although our experiments are implemented in JAX, DIVE is not restricted to this framework. We acknowledge that obtaining full per-sample gradients in PyTorch can be computationally expensive, as standard training pipelines typically operate on batch-aggregated gradients.
However, DIVE adopts last-layer gradient approximation for influence estimation, which can be efficiently implemented in PyTorch using the chain rule. Specifically, per-sample gradients of the final linear layer can be constructed from its input activations and the corresponding output gradients, without explicitly computing full-model per-sample gradients. This approach is also adopted by prior PyTorch-based data valuation methods, such as GHOST and LAI. Once the influence scores are obtained, DIVE only requires applying the corresponding gradient signs before aggregation and the optimizer update. Therefore, the practical integration of DIVE into PyTorch does not require a fundamentally different training framework.
Computational Efficiency of the Proposed Intervention. We would like to emphasize an important distinction between the computational cost of dynamic data valuation and that of our proposed data intervention. Our contribution is not to improve the efficiency of influence estimation, but to transform detrimental samples into beneficial contributions within the existing dynamic data valuation framework. Once influence scores are available, this transformation only requires reversing the signs of the corresponding sample gradients before aggregation, introducing negligible additional computational overhead compared with conventional influence-based sample removal. Therefore, the computational bottleneck discussed above primarily arises from dynamic influence estimation itself, rather than from the proposed gradient reversal strategy.
Regarding the scalability of dynamic data valuation, the main computational challenge lies in efficiently obtaining per-sample gradients. Although developing more scalable influence estimators is not the focus of this work, we have considered this issue from a practical perspective. Following prior work on efficient gradient approximation, we adopt last-layer gradients for influence estimation. Our scoring-layer ablation in Figure 1F further shows that DIVE maintains strong performance using only the final layer. For LLM fine-tuning, we similarly restrict influence estimation to the trainable LoRA adapters.
Response to Reviewer igAq [1/5]
We sincerely thank the reviewer for the careful evaluation of our manuscript and for the valuable and constructive feedback. We appreciate the opportunity to clarify our contributions and address the concerns raised. Below, we provide detailed point-by-point responses, together with additional analyses and experimental results.
Novelty. Data valuation and data intervention are two fundamental components of data-centric learning. We do not claim methodological novelty in data valuation, as we adopt the existing Inner Product (IP) estimator, a simplified variant of TracIn. Instead, our contribution lies in the data intervention component, where we transform detrimental samples into beneficial contributions through gradient reversal. Unlike conventional approaches that discard or downweight detrimental samples, DIVE leverages these otherwise underutilized samples through a simple yet effective gradient reversal operation. Specifically, rather than modifying the raw data, DIVE reverses the gradient directions of detrimental samples during optimization, turning their negative influence into a positive contribution to learning. This shifts the focus from merely identifying and filtering detrimental samples to actively utilizing them to improve learning.
Compatibility with Existing Noisy-Label Learning Methods. Following the reviewer's suggestion, we further evaluate DIVE alongside established noisy-label learning methods, including ELR, SOP, Co-teaching, JoCoR, and DivideMix. Among these methods, we integrate DIVE with ELR, SOP, Co-teaching, and JoCoR to investigate whether gradient reversal can complement existing training strategies, while DivideMix is included as an independent baseline.
Importantly, DIVE is a complementary data intervention strategy rather than a method specifically designed for noisy-label classification. As shown in the table below, incorporating DIVE improves the average accuracy of ELR, SOP, Co-teaching, and JoCoR by 0.44, 0.23, 0.34, and 0.38 percentage points, respectively. All four improvements are statistically significant under paired two-sided t-tests across 24 dataset–seed pairs, with p=0.0007, p=0.0030, p=0.0004, and p=0.0008, respectively. These results support the compatibility of DIVE with multiple existing noisy-label learning methods.
Table: Test accuracy (%) on noisy-label classification benchmarks. Results are reported as mean ± standard deviation over four seeds. ** indicates a statistically significant improvement over the corresponding base method (paired two-sided t-test, p<0.01, n=24).
We agree with the reviewer that DIVE is not inherently limited to noisy-label classification tasks. Our original evaluation follows the established data-centric learning literature, where classification is a widely adopted benchmark setting. We introduce label noise to create scenarios in which detrimental samples are more likely to arise, thereby facilitating the evaluation of data valuation and intervention methods. Nevertheless, DIVE is applicable beyond this setting. Following the reviewer's suggestion, we have further extended our evaluation to diverse scenarios and included additional baselines (See the last point).