Scaling shared model governance via model splitting
Miljan Martic, Jan Leike, Andrew Trask, Matteo Hessel and, Shane Legg, Pushmeet Kohli

TL;DR
This paper proposes a scalable method for shared governance of deep learning models by splitting them among multiple parties, and empirically investigates the security of this approach through the model completion problem.
Contribution
It introduces the model splitting technique for shared model governance and empirically analyzes its security and difficulty in various learning settings.
Findings
Model completion is harder in reinforcement learning than supervised learning.
The hardness of model completion depends more on parameter type and location than on the number of missing parameters.
Model splitting could be feasible for shared governance when training is very expensive.
Abstract
Currently the only techniques for sharing governance of a deep learning model are homomorphic encryption and secure multiparty computation. Unfortunately, neither of these techniques is applicable to the training of large neural networks due to their large computational and communication overheads. As a scalable technique for shared model governance, we propose splitting deep learning model between multiple parties. This paper empirically investigates the security guarantee of this technique, which is introduced as the problem of model completion: Given the entire training data set or an environment simulator, and a subset of the parameters of a trained deep learning model, how much training is required to recover the model's original performance? We define a metric for evaluating the hardness of the model completion problem and study it empirically in both supervised learning on…
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
TopicsAdversarial Robustness in Machine Learning · Privacy-Preserving Technologies in Data · Stochastic Gradient Optimization Techniques
