Searcharxiv⌕ Search

arXiv subjects

David J. Miller

Publications and source records attributed to David J. Miller.

At least 37 records · Page 2Linked to original sources

Robust and Active Learning for Deep Neural Network Regression

We describe a gradient-based method to discover local error maximizers of a deep neural network (DNN) used for regression, assuming the availability of an "oracle" capable of providing real-valued supervision (a regression target) for samples. For example, the oracle could be a numerical solver which, operationally, is much slower than the DNN. Given a discovered set of local error maximizers, the DNN is either fine-tuned or retrained in the manner of active learning.

cs.LG↗

A Backdoor Attack against 3D Point Cloud Classifiers

Vulnerability of 3D point cloud (PC) classifiers has become a grave concern due to the popularity of 3D sensors in safety-critical applications. Existing adversarial attacks against 3D PC classifiers are all test-time evasion (TTE) attacks that aim to induce test-time misclassifications using knowledge of the classifier. But since the victim classifier is usually not accessible to the attacker, the threat is largely diminished in practice, as PC TTEs typically have poor transferability. Here, we propose the first backdoor attack (BA) against PC classifiers. Originally proposed for images, BAs poison the victim classifier's training set so that the classifier learns to decide to the attacker's target class whenever the attacker's backdoor pattern is present in a given input sample. Significantly, BAs do not require knowledge of the victim classifier. Different from image BAs, we propose to insert a cluster of points into a PC as a robust backdoor pattern customized for 3D PCs. Such clusters are also consistent with a physical attack (i.e., with a captured object in a scene). We optimize the cluster's location using an independently trained surrogate classifier and choose the cluster's local geometry to evade possible PC preprocessing and PC anomaly detectors (ADs). Experimentally, our BA achieves a uniformly high success rate (> 87%) and shows evasiveness against state-of-the-art PC ADs.

cs.CR↗

L-RED: Efficient Post-Training Detection of Imperceptible Backdoor Attacks without Access to the Training Set

Backdoor attacks (BAs) are an emerging form of adversarial attack typically against deep neural network image classifiers. The attacker aims to have the classifier learn to classify to a target class when test images from one or more source classes contain a backdoor pattern, while maintaining high accuracy on all clean test images. Reverse-Engineering-based Defenses (REDs) against BAs do not require access to the training set but only to an independent clean dataset. Unfortunately, most existing REDs rely on an unrealistic assumption that all classes except the target class are source classes of the attack. REDs that do not rely on this assumption often require a large set of clean images and heavy computation. In this paper, we propose a Lagrangian-based RED (L-RED) that does not require knowledge of the number of source classes (or whether an attack is present). Our defense requires very few clean images to effectively detect BAs and is computationally efficient. Notably, we detect 56 out of 60 BAs using only two clean images per class in our experiments on CIFAR-10.

cs.CV↗

Reverse Engineering Imperceptible Backdoor Attacks on Deep Neural Networks for Detection and Training Set Cleansing

Backdoor data poisoning is an emerging form of adversarial attack usually against deep neural network image classifiers. The attacker poisons the training set with a relatively small set of images from one (or several) source class(es), embedded with a backdoor pattern and labeled to a target class. For a successful attack, during operation, the trained classifier will: 1) misclassify a test image from the source class(es) to the target class whenever the same backdoor pattern is present; 2) maintain a high classification accuracy for backdoor-free test images. In this paper, we make a break-through in defending backdoor attacks with imperceptible backdoor patterns (e.g. watermarks) before/during the training phase. This is a challenging problem because it is a priori unknown which subset (if any) of the training set has been poisoned. We propose an optimization-based reverse-engineering defense, that jointly: 1) detects whether the training set is poisoned; 2) if so, identifies the target class and the training images with the backdoor pattern embedded; and 3) additionally, reversely engineers an estimate of the backdoor pattern used by the attacker. In benchmark experiments on CIFAR-10, for a large variety of attacks, our defense achieves a new state-of-the-art by reducing the attack success rate to no more than 4.9% after removing detected suspicious training images.

cs.LG↗

Detection of Backdoors in Trained Classifiers Without Access to the Training Set

Recently, a special type of data poisoning (DP) attack targeting Deep Neural Network (DNN) classifiers, known as a backdoor, was proposed. These attacks do not seek to degrade classification accuracy, but rather to have the classifier learn to classify to a target class whenever the backdoor pattern is present in a test example. Launching backdoor attacks does not require knowledge of the classifier or its training process - it only needs the ability to poison the training set with (a sufficient number of) exemplars containing a sufficiently strong backdoor pattern (labeled with the target class). Here we address post-training detection of backdoor attacks in DNN image classifiers, seldom considered in existing works, wherein the defender does not have access to the poisoned training set, but only to the trained classifier itself, as well as to clean examples from the classification domain. This is an important scenario because a trained classifier may be the basis of e.g. a phone app that will be shared with many users. Detecting backdoors post-training may thus reveal a widespread attack. We propose a purely unsupervised anomaly detection (AD) defense against imperceptible backdoor attacks that: i) detects whether the trained DNN has been backdoor-attacked; ii) infers the source and target classes involved in a detected attack; iii) we even demonstrate it is possible to accurately estimate the backdoor pattern. We test our AD approach, in comparison with alternative defenses, for several backdoor patterns, data sets, and attack settings and demonstrate its favorability. Our defense essentially requires setting a single hyperparameter (the detection threshold), which can e.g. be chosen to fix the system's false positive rate.

cs.LG↗

The Weinberg Angle and 5D RGE effects in a SO(11) GUT theory

The Weinberg angle is an important parameter in Grand Unified Theories (GUT) as its size is crucially influenced by the assumption of unification. In scenarios with different steps of symmetry breaking, in particular in models that involve gauge-Higgs unification, the connection of the ultraviolet theory and the TeV scale-relevant, effective Standard Model description is an important test of the models' validity. In this work, we consider a 6D gauge-Higgs unification GUT scenario and explore the TeV scale-GUT relation using a detailed RGE analysis in the 4D and 5D regimes of the theory, including constraints from LHC measurements. We show that such can be consistent with unification in the light of current constraints, while the Weinberg angle likely translates into concrete conditions on the fermion sector in the higher dimensional setup.

hep-ph↗

Revealing Perceptible Backdoors, without the Training Set, via the Maximum Achievable Misclassification Fraction Statistic

Recently, a backdoor data poisoning attack was proposed, which adds mislabeled examples to the training set, with an embedded backdoor pattern, aiming to have the classifier learn to classify to a target class whenever the backdoor pattern is present in a test sample. Here, we address post-training detection of innocuous perceptible backdoors in DNN image classifiers, wherein the defender does not have access to the poisoned training set, but only to the trained classifier, as well as unpoisoned examples. This problem is challenging because without the poisoned training set, we have no hint about the actual backdoor pattern used during training. This post-training scenario is also of great import because in many practical contexts the DNN user did not train the DNN and does not have access to the training data. We identify two important properties of perceptible backdoor patterns - spatial invariance and robustness - based upon which we propose a novel detector using the maximum achievable misclassification fraction (MAMF) statistic. We detect whether the trained DNN has been backdoor-attacked and infer the source and target classes. Our detector outperforms other existing detectors and, coupled with an imperceptible backdoor detector, helps achieve post-training detection of all evasive backdoors.

cs.LG↗

Phenomenology of GUT-inspired gauge-Higgs unification

We perform a detailed investigation of a Grand Unified Theory (GUT)-inspired theory of gauge-Higgs unification. Scanning the model's parameter space with adapted numerical techniques, we contrast the scenario's low energy limit with existing SM and collider search constraints. We discuss potential modifications of di-Higgs phenomenology at hadron colliders as sensitive probes of the gauge-like character of the Higgs self-interactions and find that for phenomenologically viable parameter choices modifications of the order of 20\% compared to the SM cross section can be expected. While these modifications are challenging to observe at the LHC, a future 100 TeV hadron collider might be able to constrain the scenario through more precise di-Higgs measurements. We point out alternative signatures that can be employed to constrain this model in the near future.

hep-ph↗

Non-volatile rewritable frequency tuning of a nanoelectromechanical resonator using photoinduced doping

Tuning the frequency of a resonant element is of vital importance in both the macroscopic world, such as when tuning a musical instrument, as well as at the nanoscale. In particular, precisely controlling the resonance frequency of isolated nanoelectromechanical resonators (NEMS) has enabled innovations such as tunable mechanical filtering and mixing as well as commercial technologies such as robust timing oscillators. Much like their electronic device counterparts, the potential of NEMS grows when they are built up into large-scale arrays. Such arrays have enabled neutral-particle mass spectroscopy and have been proposed for ultralow-power alternatives to traditional analog electronics as well as nanomechanical information technologies like memory, logic, and computing. A fundamental challenge to these applications is to precisely tune the vibrational frequency and coupling of all resonators in the array, since traditional tuning methods, like patterned electrostatic gating or dielectric tuning, become intractable when devices are densely packed. Here, we demonstrate a persistent, rewritable, scalable, and high-speed frequency tuning method for graphene-based NEMS. Our method uses a focused laser and two shared electrical contacts to photodope individual resonators by simultaneously applying optical and electrostatic fields. After the fields are removed, the trapped charge created by this process persists and applies a local electrostatic tension to the resonators, tuning their frequencies. By providing a facile means to locally address the strain of a NEMS resonator, this approach lays the groundwork for fully programmable large-scale NEMS lattices and networks.

cond-mat.mes-hall↗

Adversarial Learning in Statistical Classification: A Comprehensive Review of Defenses Against Attacks

There is great potential for damage from adversarial learning (AL) attacks on machine-learning based systems. In this paper, we provide a contemporary survey of AL, focused particularly on defenses against attacks on statistical classifiers. After introducing relevant terminology and the goals and range of possible knowledge of both attackers and defenders, we survey recent work on test-time evasion (TTE), data poisoning (DP), and reverse engineering (RE) attacks and particularly defenses against same. In so doing, we distinguish robust classification from anomaly detection (AD), unsupervised from supervised, and statistical hypothesis-based defenses from ones that do not have an explicit null (no attack) hypothesis; we identify the hyperparameters a particular method requires, its computational complexity, as well as the performance measures on which it was evaluated and the obtained quality. We then dig deeper, providing novel insights that challenge conventional AL wisdom and that target unresolved issues, including: 1) robust classification versus AD as a defense strategy; 2) the belief that attack success increases with attack strength, which ignores susceptibility to AD; 3) small perturbations for test-time evasion attacks: a fallacy or a requirement?; 4) validity of the universal assumption that a TTE attacker knows the ground-truth class for the example to be attacked; 5) black, grey, or white box attacks as the standard for defense evaluation; 6) susceptibility of query-based RE to an AD defense. We also discuss attacks on the privacy of training data. We then present benchmark comparisons of several defenses against TTE, RE, and backdoor DP attacks on images. The paper concludes with a discussion of future work.

cs.LG↗

Proposal for the validation of Monte Carlo implementations of the standard model effective field theory

We propose a procedure to cross-validate Monte Carlo implementations of the standard model effective field theory. It is based on the numerical comparison of squared amplitudes computed at specific phase-space and parameter points in pairs of implementations. Interactions are fully linearised in the effective field theory expansion. The squares of linear effective field theory amplitudes and their interference with standard-model contributions are compared separately. Such pairwise comparisons are primarily performed at tree level and a possible extension to the one-loop level is also briefly considered. We list the current standard model effective field theory implementations and the comparisons performed to date.

hep-ph↗

A Mixture Model Based Defense for Data Poisoning Attacks Against Naive Bayes Spam Filters

Naive Bayes spam filters are highly susceptible to data poisoning attacks. Here, known spam sources/blacklisted IPs exploit the fact that their received emails will be treated as (ground truth) labeled spam examples, and used for classifier training (or re-training). The attacking source thus generates emails that will skew the spam model, potentially resulting in great degradation in classifier accuracy. Such attacks are successful mainly because of the poor representation power of the naive Bayes (NB) model, with only a single (component) density to represent spam (plus a possible attack). We propose a defense based on the use of a mixture of NB models. We demonstrate that the learned mixture almost completely isolates the attack in a second NB component, with the original spam component essentially unchanged by the attack. Our approach addresses both the scenario where the classifier is being re-trained in light of new data and, significantly, the more challenging scenario where the attack is embedded in the original spam training set. Even for weak attack strengths, BIC-based model order selection chooses a two-component solution, which invokes the mixture-based defense. Promising results are presented on the TREC 2005 spam corpus.

cs.CR↗

When Not to Classify: Detection of Reverse Engineering Attacks on DNN Image Classifiers

This paper addresses detection of a reverse engineering (RE) attack targeting a deep neural network (DNN) image classifier; by querying, RE's aim is to discover the classifier's decision rule. RE can enable test-time evasion attacks, which require knowledge of the classifier. Recently, we proposed a quite effective approach (ADA) to detect test-time evasion attacks. In this paper, we extend ADA to detect RE attacks (ADA-RE). We demonstrate our method is successful in detecting "stealthy" RE attacks before they learn enough to launch effective test-time evasion attacks.

cs.CV↗

Constraining top quark effective theory in the LHC Run II era

We perform an up-to-date global fit of top quark effective theory to experimental data from the Tevatron, and from LHC Runs I and II. Experimental data includes total cross-sections up to 13 TeV, as well as differential distributions, for both single top and pair production. We also include the top quark width, charge asymmetries, and polarisation information from top decay products. We present bounds on the coefficients of dimension six operators, and examine the interplay between inclusive and differential measurements, and Tevatron / LHC data. All results are currently in good agreement with the Standard Model.

hep-ph↗

When Not to Classify: Anomaly Detection of Attacks (ADA) on DNN Classifiers at Test Time

A significant threat to the recent, wide deployment of machine learning-based systems, including deep neural networks (DNNs), is adversarial learning attacks. We analyze possible test-time evasion-attack mechanisms and show that, in some important cases, when the image has been attacked, correctly classifying it has no utility: i) when the image to be attacked is (even arbitrarily) selected from the attacker's cache; ii) when the sole recipient of the classifier's decision is the attacker. Moreover, in some application domains and scenarios it is highly actionable to detect the attack irrespective of correctly classifying in the face of it (with classification still performed if no attack is detected). We hypothesize that, even if human-imperceptible, adversarial perturbations are machine-detectable. We propose a purely unsupervised anomaly detector (AD) that, unlike previous works: i) models the joint density of a deep layer using highly suitable null hypothesis density models (matched in particular to the non- negative support for RELU layers); ii) exploits multiple DNN layers; iii) leverages a "source" and "destination" class concept, source class uncertainty, the class confusion matrix, and DNN weight information in constructing a novel decision statistic grounded in the Kullback-Leibler divergence. Tested on MNIST and CIFAR-10 image databases under three prominent attack strategies, our approach outperforms previous detection methods, achieving strong ROC AUC detection accuracy on two attacks and better accuracy than recently reported for a variety of methods on the strongest (CW) attack. We also evaluate a fully white box attack on our system. Finally, we evaluate other important performance measures, such as classification accuracy, versus detection rate and attack strength.

cs.LG↗

High scale boundary conditions with an additional complex singlet

We investigate Planck scale boundary conditions on Higgs quartic interactions and their $β$-functions in the SM augmented by an additional complex scalar. We use renormalisation group running at two-loops, and include both theoretical and experimental constraints. We find that the boundary condition $λ=β_λ=0$ at the Planck scale is compatible with the current Higgs and top mass measurements, but requires additional scalars lighter than about $600\,$GeV.

hep-ph↗

Adversarial Learning: A Critical Review and Active Learning Study

This papers consists of two parts. The first is a critical review of prior art on adversarial learning, identifying some significant limitations of previous works. The second part is an experimental study considering adversarial active learning and an investigation of the efficacy of a mixed sample selection strategy for combating an adversary who attempts to disrupt the classifier learning.

cs.CR↗