paper-with-me

Papers

Matrix Sketching for Secure Collaborative Machine Learning

2019-09-24 · Mengjiao Zhang, Shusen Wang

Collaborative learning allows participants to jointly train a model without data sharing. To update the model parameters, the central server broadcasts model parameters to the clients, and the clients send updating directions such as gradients to the server. While data do not leave a client device, the communicated gradients and parameters will leak a client's privacy. Attacks that infer clients' privacy from gradients and parameters have been developed by prior work. Simple defenses such as dropout and differential privacy either fail to defend the attacks or seriously hurt test accuracy. We propose a practical defense which we call Double-Blind Collaborative Learning (DBCL). The high-level idea is to apply random matrix sketching to the parameters (aka weights) and re-generate random sketching after each iteration. DBCL prevents clients from conducting gradient-based privacy inferences which are the most effective attacks. DBCL works because from the attacker's perspective, sketching is effectively random noise that outweighs the signal. Notably, DBCL does not much increase computation and communication costs and does not hurt test accuracy at all.

📄 PDF Abstract BibTeX arXiv:1909.11201

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine Learning

Methods 이 논문이 사용한 방법론

Dropout Dropout is a regularization technique for neural networks that drops a unit (along with connections) at training time with a specified probability $p$ (a common value is…

Similar Papers 제목 키워드 기반

Iterative Sketching for Secure Coded Regression

2023-08-08 · Neophytos Charalambides, Hessam Mahdavifar, Mert Pilanci, Alfred O. Hero III

Linear regression is a fundamental and primitive problem in supervised machine learning, with applications ranging from epidemiology to finance. In this work, we propose methods for speeding up distributed linear regress…

Distributed ComputingEpidemiologyregression

Effective and Sparse Count-Sketch via k-means clustering

2020-11-24 · YuHan Wang, Zijian Lei, Liang Lan

Count-sketch is a popular matrix sketching algorithm that can produce a sketch of an input data matrix X in O(nnz(X))time where nnz(X) denotes the number of non-zero entries in X. The sketched matrix will be much smaller…

BIG-bench Machine LearningClustering

Optimal Matrix Sketching over Sliding Windows

2024-05-13 · Hanyan Yin, Dongxie Wen, Jiajun Li, Zhewei Wei 외

Matrix sketching, aimed at approximating a matrix $\boldsymbol{A} \in \mathbb{R}^{N\times d}$ consisting of vector streams of length $N$ with a smaller sketching matrix $\boldsymbol{B} \in \mathbb{R}^{\ell\times d}, \ell…

Localized sketching for matrix multiplication and ridge regression

2020-03-20 · Rakshith S Srinivasa, Mark A. Davenport, Justin Romberg

We consider sketched approximate matrix multiplication and ridge regression in the novel setting of localized sketching, where at any given point, only part of the data matrix is available. This corresponds to a block di…

regression

Fast Generalized Matrix Regression with Applications in Machine Learning

2019-12-27 · Haishan Ye, Shusen Wang, Zhihua Zhang, Tong Zhang

Fast matrix algorithms have become the fundamental tools of machine learning in big data era. The generalized matrix regression problem is widely used in the matrix approximation such as CUR decomposition, kernel matrix …

BIG-bench Machine Learningregression