Publication

Controlling the Complexity and Lipschitz Constant improves Polynomial Nets

Related publications (32)

About
Privacy
Disclaimer

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Controlling the Complexity and Lipschitz Constant improves Polynomial Nets

Graph Chatbot

Chat with Graph Search

Stable parameterization of continuous and piecewise-linear functions

Robust Training and Verification of Deep Neural Networks

Estimating and Improving the Robustness of Attributions in Text

Benign Overfitting in Deep Neural Networks under Lazy Training

Adversarial Training Should Be Cast As a Non-Zero-Sum Game

Rethinking data augmentation for adversarial robustness

BLACK-BOX ATTACKS ON IMAGE ACTIVITY PREDICTION AND ITS NATURAL LANGUAGE EXPLANATIONS

Predicting in Uncertain Environments: Methods for Robust Machine Learning

Towards Verifiable, Generalizable and Efficient Robust Deep Neural Networks.

Adversarial training with informed data selection