Publication

Logit Pairing Methods Can Fool Gradient-Based Attacks

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.

Logit Pairing Methods Can Fool Gradient-Based Attacks

Graph Chatbot

Chat with Graph Search

Revisiting Character-level Adversarial Attacks for Language Models

Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning

Fast Adversarial Training With Adaptive Step Size

Bayes-optimal Learning of Deep Random Networks of Extensive-width

Adversarial vulnerability bounds for Gaussian process classification

Block-Sparse Adversarial Attack To Fool Transformer-Based Text Classifiers

Towards Verifiable, Generalizable and Efficient Robust Deep Neural Networks.

Robustness and invariance properties of image classifiers

Robust Binary Models by Pruning Randomly-initialized Networks