Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Weigand, Lukas"'
A popular method to perform adversarial attacks on neuronal networks is the so-called fast gradient sign method and its iterative variant. In this paper, we interpret this method as an explicit Euler discretization of a differential inclusion, where
Externí odkaz:
http://arxiv.org/abs/2406.05376
We analyze a recently proposed class of algorithms for the problem of sampling from probability distributions $\mu^\ast$ in $\mathbb{R}^d$ with a Lebesgue density of the form $\mu^\ast(x) \propto \exp(-f(Kx)-g(x))$, where $K$ is a linear operator and
Externí odkaz:
http://arxiv.org/abs/2405.18098