Cheap Checking for Cloud Computing: Statistical Analysis via Annotated Data Streams

Chris Hickey, Graham Cormode
Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics, PMLR 84:1318-1326, 2018.

Abstract

As the popularity of outsourced computation increases, questions of accuracy and trust between the client and the cloud computing services become ever more relevant. Our work aims to provide fast and practical methods to verify analysis of large data sets, where the client’s computation and memory costs are kept to a minimum. Our verification protocols are based on defining ’proofs’ which are easy to create and check. These add only a small overhead to reporting the result of the computation itself. We build up a series of protocols for elementary statistical methods, to create more complex protocols for Ordinary Least Squares, Principal Component Analysis and Linear Discriminant Analysis, and show them to be very efficient in practice.

Cite this Paper

BibTeX
@InProceedings{pmlr-v84-hickey18a, title = {Cheap Checking for Cloud Computing: Statistical Analysis via Annotated Data Streams}, author = {Hickey, Chris and Cormode, Graham}, booktitle = {Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics}, pages = {1318--1326}, year = {2018}, editor = {Storkey, Amos and Perez-Cruz, Fernando}, volume = {84}, series = {Proceedings of Machine Learning Research}, month = {09--11 Apr}, publisher = {PMLR}, pdf = {http://proceedings.mlr.press/v84/hickey18a/hickey18a.pdf}, url = {https://proceedings.mlr.press/v84/hickey18a.html}, abstract = {As the popularity of outsourced computation increases, questions of accuracy and trust between the client and the cloud computing services become ever more relevant. Our work aims to provide fast and practical methods to verify analysis of large data sets, where the client’s computation and memory costs are kept to a minimum. Our verification protocols are based on defining ’proofs’ which are easy to create and check. These add only a small overhead to reporting the result of the computation itself. We build up a series of protocols for elementary statistical methods, to create more complex protocols for Ordinary Least Squares, Principal Component Analysis and Linear Discriminant Analysis, and show them to be very efficient in practice. } }
Endnote
%0 Conference Paper %T Cheap Checking for Cloud Computing: Statistical Analysis via Annotated Data Streams %A Chris Hickey %A Graham Cormode %B Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics %C Proceedings of Machine Learning Research %D 2018 %E Amos Storkey %E Fernando Perez-Cruz %F pmlr-v84-hickey18a %I PMLR %P 1318--1326 %U https://proceedings.mlr.press/v84/hickey18a.html %V 84 %X As the popularity of outsourced computation increases, questions of accuracy and trust between the client and the cloud computing services become ever more relevant. Our work aims to provide fast and practical methods to verify analysis of large data sets, where the client’s computation and memory costs are kept to a minimum. Our verification protocols are based on defining ’proofs’ which are easy to create and check. These add only a small overhead to reporting the result of the computation itself. We build up a series of protocols for elementary statistical methods, to create more complex protocols for Ordinary Least Squares, Principal Component Analysis and Linear Discriminant Analysis, and show them to be very efficient in practice.
APA
Hickey, C. & Cormode, G.. (2018). Cheap Checking for Cloud Computing: Statistical Analysis via Annotated Data Streams. Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics, in Proceedings of Machine Learning Research 84:1318-1326 Available from https://proceedings.mlr.press/v84/hickey18a.html.

Related Material