no code implementations • NeurIPS 2018 • Simon Lyddon, Stephen Walker, Chris C. Holmes
Bayesian learning is built on an assumption that the model space contains a true reflection of the data generating mechanism.
1 code implementation • 11 May 2018 • Tammo Rukat, Chris C. Holmes, Christopher Yau
Boolean tensor decomposition approximates data of multi-way binary relationships as product of interpretable low-rank binary factors, following the rules of Boolean algebra.
no code implementations • 2 Mar 2017 • Pedro M. Esperança, Louis J. M. Aslett, Chris C. Holmes
Information that is stored in an encrypted format is, by definition, usually not amenable to statistical analysis or machine learning methods.
no code implementations • ICML 2017 • Tammo Rukat, Chris C. Holmes, Michalis K. Titsias, Christopher Yau
Boolean matrix factorisation aims to decompose a binary data matrix into an approximate Boolean product of two low rank, binary matrices: one containing meaningful patterns, the other quantifying how the observations can be expressed as a combination of these patterns.
no code implementations • 27 Aug 2015 • Louis J. M. Aslett, Pedro M. Esperança, Chris C. Holmes
We present two new statistical machine learning methods designed to learn on fully homomorphic encrypted (FHE) data.
no code implementations • 26 Aug 2015 • Louis J. M. Aslett, Pedro M. Esperança, Chris C. Holmes
Recent advances in cryptography promise to enable secure statistical computation on encrypted data, whereby a limited set of operations can be carried out without the need to first decrypt.