Publications associées à Recherche dichotomique

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Square Attack: a query-efficient black-box adversarial attack via random search

Nicolas Henri Bernard Flammarion, Maksym Andriushchenko, Francesco Croce

We propose the Square Attack, a new score-based black-box

l_2

and

l_\infty

adversarial attack that does not rely on local gradient information and thus is not affected by gradient masking. The Square Attack is based on a randomized search scheme where ...

2020

Recherche dichotomique

Graph Chatbot

Chattez avec Graph Search

An Analysis of Super-Net Heuristics in Weight-Sharing NAS

Relatively robust decisions

Sequential metric dimension for random graphs

Metric dimension of critical Galton–Watson trees and linear preferential attachment trees

Landmark Regularization: Ranking Guided Super-Net Training in Neural Architecture Search

From Boolean functions to quantum circuits: A scalable quantum compilation flow in C++

An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity

Scalable and Efficient Comparison-based Search without Features

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

Square Attack: a query-efficient black-box adversarial attack via random search

Sequential metric dimension for random graphs

Relatively robust decisions

Scalable and Efficient Comparison-based Search without Features

Metric dimension of critical Galton–Watson trees and linear preferential attachment trees

An Analysis of Super-Net Heuristics in Weight-Sharing NAS

Landmark Regularization: Ranking Guided Super-Net Training in Neural Architecture Search

From Boolean functions to quantum circuits: A scalable quantum compilation flow in C++

Square Attack: a query-efficient black-box adversarial attack via random search

An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem