How to Inverting the Leverage Score Distribution?
Zhihang Li, Zhao Song, Weixin Wang, Junze Yin, Zheng Yu

TL;DR
This paper introduces the problem of inverting leverage score distributions to recover model parameters, providing theoretical analysis and algorithms with guarantees for solving this non-convex optimization problem.
Contribution
It formulates the leverage score inversion as a non-convex optimization problem and develops algorithms with convergence guarantees, advancing understanding of leverage score applications.
Findings
Hessian matrix is positive definite and Lipschitz
First-order and second-order algorithms are proposed
Global convergence rates are established for the algorithms
Abstract
Leverage score is a fundamental problem in machine learning and theoretical computer science. It has extensive applications in regression analysis, randomized algorithms, and neural network inversion. Despite leverage scores are widely used as a tool, in this paper, we study a novel problem, namely the inverting leverage score problem. We analyze to invert the leverage score distributions back to recover model parameters. Specifically, given a leverage score , the matrix , and the vector , we analyze the non-convex optimization problem of finding to minimize , where , and $s(x) : = Ax - b \in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Sparse and Compressive Sensing Techniques · Privacy-Preserving Technologies in Data
