Inverting the Leverage Score Gradient: An Efficient Approximate Newton Method

Leverage scores have become essential in statistics and machine learning, aiding regression analysis, randomized matrix computations, and various other tasks. This paper delves into the inverse problem, aiming to recover the intrinsic model parameters given the leverage scores gradient. This endeavor not only enriches the theoretical understanding of models trained with leverage score techniques but also has substantial implications for data privacy and adversarial security. We specifically scrutinize the inversion of the leverage score gradient, denoted as g(x). An innovative iterative algorithm is introduced for the approximate resolution of the regularized least squares problem stated as minx ∈ ℝd 0.5 |g(x) - c|22 + 0.5|diag(w)Ax|22. Our algorithm employs subsampled leverage score distributions to compute an approximate Hessian in each iteration, under standard assumptions, considerably mitigating the time complexity. Given that a total of T = log(| x0 - x^* |2/ ε) iterations are required, the cost per iteration is optimized to the order of O( (nnz(A) + dω ) · poly(log(n/δ)), where nnz(A) denotes the number of non-zero entries of A.