- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes a data value evaluation algorithm based on LDP, with the core idea being for the seller to locally evaluate the relationship between its own data and that of its neighbors. The paper further considers the semi-trusted scenario.
Critical strengths
A large amount of theoretical analysis
multidimensional experiments
Critical weaknesses
-
The solutions proposed in this paper are mostly permutations and combinations of existing solutions, and no essential differences from existing LDPs are observed.
-
The scenario assumptions in this article are relatively idealized or overly strict
-
limited experiments
Questions for authors
see w
7 comments
I have more concerns.
Thank you very much for the authors' clarification. I find the research problem addressed in this paper quite interesting. However, the current presentation still needs substantial improvement.
I would like to ask: How can data validation be performed in the absence of privacy constraints? What specific challenges arise when privacy protection is introduced? Are these challenges fundamentally different from those encountered in existing LDP settings?
Given the word limit for the rebuttal, please feel free to address these questions directly without any formalities. I am also quite familiar with LDP research, so a technically detailed and straightforward response would be appreciated.
You can do better.
Based on your current response, I am increasingly inclined to view this work as primarily an engineering-oriented contribution, with relatively limited algorithmic novelty. Nevertheless, I personally believe that well-executed engineering research also deserves acceptance.
We sincerely thank the reviewer for the valuable comments and positive assessment of our theoretical analysis and experimental evaluation. We appreciate the concerns regarding methodological novelty, theoretical assumptions, and experimental limitations. We have revised the paper to address these issues and provide point-by-point responses below.
W1:The proposed framework builds on TKNN-Shapley, histogram-based estimation, and established local differential privacy mechanisms. Although combining these components for provider-side valuation is potentially useful, the paper does not sufficiently distinguish its fundamental methodological contributions from existing techniques for private statistical estimation and privacy-preserving data valuation.
We agree that our work builds on established technical tools. Its novelty lies in the following three contributions.
A provider-side framework for private data valuation.. We develop a protocol in which each provider sends a single LDP report and locally estimates their record's value using aggregated information about the candidate pool, without accessing other providers' raw records or disclosing their own raw record before valuation.
A valuation-specific estimator. Because TKNN-Shapley depends nonlinearly on neighborhood counts, directly plugging in noisy counts can yield unstable valuation estimates. We address this issue through a tailored stabilization procedure, whose effectiveness is supported by our ablation studies.
Theoretical guarantees. We establish MSE upper bounds and matching minimax lower bounds. These results characterize how privacy and feature discretization affect valuation accuracy.
We therefore believe that our work makes a significant contribution to privacy-preserving data valuation.
W2: The analysis assumes independent and identically distributed candidate records, bounded feature densities, and a known positive lower bound on the feature density. These assumptions may be difficult to verify in practical data marketplaces, where candidate records can be heterogeneous, dependent, or highly imbalanced.
We acknowledge that our theoretical assumptions may be restrictive. We only consider an illustrative setting for deriving clean statistical guarantees, with possible adaption to broader settings. We clarify the scope as follows:
First, the LDP reporting protocol does not rely on the distributional assumptions used in our statistical analysis. Our upper-bound analysis assumes i.i.d. sampling and bounds on the feature densities, with the lower bounded density assumption alleviatable using Gyorfi and Kroll (2025). For the lower-bound analysis, we adopt assumptions such as i.i.d. and upper bounded feature density, which are also commonly used in nonprivate nonparametric estimation.
Second, these assumptions are primarily used for theoretical analysis and are common in nonparametric estimation (Ma and Yang, 2024; Gyorfi and Kroll, 2025). Under these conditions, we establish matching MSE upper and lower bounds.
W3:The paper is technically elaborate, but the experimental evaluation is relatively limited.
We apologize for the limitation and have substantially expanded our experiments. The expansion including real-data ablation studies, comparisons with direct plug-in, unstabilized, and local baselines, non-private TKNN-Shapley results, and additional statistical significance tests. We have also added experiments across different privacy settings and budgets, together with computational cost measurements. These additional results provide stronger empirical evidence for the effectiveness of our estimator, particularly the benefits of feasible count fitting, stabilization, and using private candidate-pool statistics. The detailed results are provided in Appendices D and E.
We sincerely thank the reviewer again for the valuable comments. We hope our responses have addressed your concerns and clarified our work. We would greatly appreciate it if consider raising our score.
Yuheng Ma and Hanfang Yang. Optimal locally private nonparametric classification with public data. Journal of Machine Learning Research, 25(167):1–62, 2024.
László Györfi and Martin Kroll. On rate optimal private regression under local differential privacy. Statistica Sinica, 35:613–627, 2025. doi: 10.5705/ss.202022.0186.