Author of the publication

Monge blunts Bayes: Hardness Results for Adversarial Training.

, , , , , and . ICML, volume 97 of Proceedings of Machine Learning Research, page 1406-1415. PMLR, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Instance Pruning as an Information Preserving Problem., and . ICML, page 855-862. Morgan Kaufmann, (2000)Negative Robust Learning Results from Horn Claus Programs., , and . ICML, page 258-265. Morgan Kaufmann, (1996)A Robust Boosting Algorithm., and . ECML, volume 2430 of Lecture Notes in Computer Science, page 319-330. Springer, (2002)Fast $(1+ε)$-approximation of the Löwner extremal matrices of high-dimensional symmetric matrices., and . CoRR, (2016)On Rényi and Tsallis entropies and divergences for exponential families, and . (2011)cite arxiv:1105.3259Comment: 7 pages.The Bregman Chord Divergence., and . GSI, volume 11712 of Lecture Notes in Computer Science, page 299-308. Springer, (2019)Inducing Interpretable Voting Classifiers without Trading Accuracy for Simplicity: Theoretical Results, Approximation Algorithms. CoRR, (2011)Oracles and Assistants: Machine Learning Applied to Network Supervision., and . Canadian AI, volume 1418 of Lecture Notes in Computer Science, page 86-98. Springer, (1998)Identifying and Eliminating Irrelevant Instances Using Information Theory., and . AI, volume 1822 of Lecture Notes in Computer Science, page 90-101. Springer, (2000)Generalised Lipschitz Regularisation Equals Distributional Robustness., , , , and . CoRR, (2020)