activity
20172022
most citedMonge blunts Bayes: Hardness Results for Adversarial Training

10 citations · 41 across the 9 of their papers we have counts for

collaborators

9 papers

cs.LG2022

The Geometry and Calculus of Losses

Robert C. Williamson, Zac Cranko

Statistical decision problems lie at the heart of statistical machine learning. The simplest problems are binary and multiclass classification and class probability estimation. Cen…

cs.LG2022★ 5 cited

Information Processing Equalities and the Information-Risk Bridge

Robert C. Williamson, Zac Cranko

We introduce two new classes of measures of information for statistical experiments which generalise and subsume -divergences, integral probability metrics, -dista…

cs.LG2020★ 5 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…

cs.LG2019

Proper-Composite Loss Functions in Arbitrary Dimensions

Zac Cranko, Robert C. Williamson, Richard Nock

The study of a machine learning problem is in many ways is difficult to separate from the study of the loss function being used. One avenue of inquiry has been to look at these los…

stat.ML2018★ 6 cited

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★ 1 cited

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★ 10 cited

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★ 5 cited

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.LG2017★ 9 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…