- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies estimation and inference for the linear SVM when binary labels are privatized through randomized response. It combines loss correction with convolution smoothing, develops asymptotic inference for a local estimator, and characterizes optimal binary response probabilities under pure and approximate LabelDP for a specified variance criterion. Simulations and a real-data application compare the proposed method with naive private and nonprivate SVM baselines.
Critical strengths
- The paper addresses parameter inference under label privacy, extending the evaluation of private SVMs beyond prediction accuracy. Its corrected and smoothed formulation connects estimation of the clean-label SVM target with an explicit covariance estimator, providing a useful framework for understanding how label randomization affects parameter uncertainty.
- The variance decomposition separates ordinary sampling variability from the additional variability introduced by randomized response, making the statistical cost of label privacy explicit. The characterization of optimal binary RR mechanisms under the chosen trace criterion provides interpretable and tractable guidance for mechanism design.
Critical weaknesses
- The asymptotic guarantees do not sufficiently connect to the actual estimated quantities used in practice. They focus on the local minima within the neighborhood of the unknown target, while the actual implementation of optimization starts from biased RRSVM estimation and does not guarantee to reach the solution. The paper also acknowledges the serious lack of interval coverage in the Gaussian experiments, but does not investigate whether the coverage improves with the increase in sample size, nor does it diagnose the optimization error and variance estimation error. This limits the evidence for the actual reliability of the proposed confidence intervals. 2.The actual mechanism selection procedure has not been proven to constitute a complete privacy inference process. The paper does not explain how the privacy-protected samples of each candidate mechanism are obtained, so it is impossible to determine whether the loss correction matches the actual randomization mechanism and how privacy is calculated across candidate mechanisms. Additionally, the trace of the minimum score covariance is usually not equivalent to the trace of the parameter covariance, which also includes the Hessian factor. These gaps limit the actual effectiveness and inference interpretation of the claimed optimal mechanism.
Questions for authors
- What guarantees the actual optimizer implementation to reach the local solutions analyzed in Theorem 1-3? Can the author report the changes in coverage with the increase in sample size and provide optimization diagnostics as well as sensitivity analyses of initialization and bandwidth to explain the observed coverage deficiency? 2.How are the privacy-protected labels used by the three candidate mechanisms generated? Please explain the complete selection and training protocol, its privacy accounting, and why the covariance estimates used for comparing candidate mechanisms remain valid under this protocol. 3.Why does the mechanism selection criterion omit the Hessian factor in the sandwich covariance of the estimator? Will minimizing the trace of the complete parameter covariance change the selection between approximate LabelDP mechanisms?