activity
20172020
most citedf-GANs in an Information Geometric Nutshell

9 citations · 14 across the 2 of their papers we have counts for

collaborators

6 papers

cs.LG20205 cited

Generalised Lipschitz Regularisation Equals Distributional Robustness

Zac Cranko, Zhan Shi, Xinhua Zhang +2

The problem of adversarial examples has highlighted the need for a theory of regularisation that is general enough to apply to exotic function classes, such as universal approximat…

stat.ML2018

Lipschitz Networks and Distributional Robustness

Zac Cranko, Simon Kornblith, Zhan Shi +1

Robust risk minimisation has several advantages: it has been studied with regards to improving the generalisation properties of models and robustness to adversarial perturbation. W…

stat.ML2018

Integral Privacy for Sampling

Hisham Husain, Zac Cranko, Richard Nock

Differential privacy is a leading protection setting, focused by design on individual privacy. Many applications, in medical / pharmaceutical domains or social networks, rather pos…

cs.LG2018

Monge blunts Bayes: Hardness Results for Adversarial Training

Zac Cranko, Aditya Krishna Menon, Richard Nock +3

The last few years have seen a staggering number of empirical studies of the robustness of neural networks in a model of adversarial perturbations of their inputs. Most rely on an…

cs.LG2018

Boosted Density Estimation Remastered

Zac Cranko, Richard Nock

There has recently been a steady increase in the number iterative approaches to density estimation. However, an accompanying burst of formal convergence guarantees has not followed…

cs.LG20179 cited

f-GANs in an Information Geometric Nutshell

Richard Nock, Zac Cranko, Aditya Krishna Menon +2

Nowozin \textit{et al} showed last year how to extend the GAN \textit{principle} to all -divergences. The approach is elegant but falls short of a full description of the superv…