132 hasil
Menampilkan 1–20 · 3,57 detik · RSS
European Journal of Applied Mathematics
Scopus
ISSN 0956-7925 · Cambridge University Press · 132 artikel di indeks
-
Artikel Jurnal Teks lengkap
Adversarial consistency and the uniqueness of the adversarial bayes classifier
Minimizing an adversarial surrogate risk is a common technique for learning robust classifiers. Prior work showed that convex surrogate losses are not statistically consistent in the adversarial context – or in other words, a minimizing sequence of the adversarial surrogate risk will not…
Juga tersedia di: DOAJ
-
Artikel Jurnal Teks lengkap
On the existence of solutions to adversarial training in multiclass classification
Adversarial training is a min-max optimization problem that is designed to construct robust classifiers against adversarial perturbations of data. We study three models of adversarial training in the multiclass agnostic-classifier setting. We prove the existence of Borel measurable robust…
Juga tersedia di: DOAJ
-
Artikel Jurnal Teks lengkap
Do stable neural networks exist for classification problems? – A new view on stability in AI
In deep learning (DL), the instability phenomenon is widespread and well documented, and the most commonly used measure of stability is the Lipschitz constant. While a small Lipchitz constant is traditionally viewed as guarantying stability, it does not capture the instability phenomenon in DL for…
Juga tersedia di: DOAJ
-
Artikel Jurnal Teks lengkap
Numerical solution of a PDE arising from prediction with expert advice
This work investigates the online machine learning problem of prediction with expert advice in an adversarial setting through numerical analysis of, and experiments with, a related partial differential equation. The problem is a repeated two-person game involving decision-making at each step…
Juga tersedia di: DOAJ
-
Artikel Jurnal Teks lengkap
Adversarial flows: A gradient flow characterization of adversarial attacks
A popular method to perform adversarial attacks on neural 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 we also show convergence of the discretization to…
Juga tersedia di: DOAJ
-
Artikel Jurnal
Uniform convergence of adversarially robust classifiers
In recent years, there has been significant interest in the effect of different types of adversarial perturbations in data classification problems. Many of these models incorporate the adversarial power, which is an important parameter with an associated trade-off between accuracy and robustness…
-
Artikel Jurnal
Instability in deep learning – when algorithms cannot compute uncertainty quantifications for neural networks
In deep learning, interval neural networks are used to quantify the uncertainty of a pre-trained neural network. Suppose we are given a computational problem $P$ and a pre-trained neural network $\Phi _P$ that aims to solve $P$ . An interval neural network is then a pair of neural networks…
-
Artikel Jurnal
The mathematics of adversarial attacks in AI – why deep learning is unstable despite the existence of stable neural networks
The unprecedented success of deep learning (DL) makes it unchallenged when it comes to classification problems. However, it is well established that the current DL methodology produces universally unstable neural networks (NNs). The instability problem has caused a substantial research effort –…
-
Artikel Jurnal
How to beat a Bayesian adversary
Deep neural networks and other modern machine learning models are often susceptible to adversarial attacks. Indeed, an adversary may often be able to change a model’s prediction through a small, directed perturbation of the model’s input – an issue in safety-critical applications. Adversarially…
-
Artikel Jurnal
NLP verification: towards a general methodology for certifying robustness
Machine learning has exhibited substantial success in the field of natural language processing (NLP). For example, large language models have empirically proven to be capable of producing text of high complexity and cohesion. However, at the same time, they are prone to inaccuracies and…
-
Artikel Jurnal
Mean field limits of co-evolutionary signed heterogeneous networks
Many science phenomena are modelled as interacting particle systems (IPS) coupled on static networks. In reality, network connections are far more dynamic. Connections among individuals receive feedback from nearby individuals and make changes to better adapt to the world. Hence, it is reasonable…
-
Artikel Jurnal
Homogenisation of Wasserstein gradient flows
We prove the convergence of a Wasserstein gradient flow of a free energy in inhomogeneous media. Both the energy and media can depend on the spatial variable in a fast oscillatory manner. In particular, we show that the gradient-flow structure is preserved in the limit, which is expressed in terms…
-
Artikel Jurnal
Network-based kinetic models: Emergence of a statistical description of the graph topology
In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific classes of interactions a statistical description of the graph…