Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

3978116155 · Jun 202019922001200920172026
48 results for imperceptible changes

New method makes neural networks more resilient to location-optimized adversarial patches.

problem Neural networks' vulnerability to adversarial patches that are visible but still effective.
method Developed a practical approach to optimize patch locations and applied adversarial training.
result Significantly improved robustness against adversarial patches on CIFAR10 and GTSRB.

Localized uncertainty attacks target uncertain regions to create imperceptible adversarial examples.

problem Adversarial examples that are imperceptible to humans and strong under deterministic classifiers.
method Localized uncertainty attacks by perturbing uncertain regions, using predictive uncertainty or surrogate models.
result Localized uncertainty attacks produce strong adversarial examples that retain input similarity.

Security of machine learning models is a concern as they may face adversarial attacks for unwarranted advantageous decisions. While research on the topic has mainly been focusing on the image domain, numerous industrial applications, in particular in finance, rely on standard tabular data. In this paper, we discuss the…

2019-11-08abs ↗pdf ↗

Fawkes protects images from unauthorized facial recognition models.

problem Unauthorized training of facial recognition models poses privacy risks.
method Fawkes adds imperceptible pixel-level changes (cloaks) to images before release.
result Fawkes can protect images from misidentification by 95% and 80% even when clean images are leaked.

Paper proposes privacy-preserving learning for images, making them imperceptible to humans but recognizable by machines.

problem Conflict between developing AI systems and protecting sensitive training data.
method Encryption strategies (random shuffling and sub-patch mixing) followed by minimal adaptation to vision transformer.
result Achieves comparable accuracy to competitive methods while ensuring human-imperceptibility of encrypted images.

New bounds on AE success probability in GP models.

problem Limiting the success of adversarial examples in probabilistic models.
method Investigated upper bounds on AE success probability using Gaussian Processes.
result Proved a new upper bound of AE success probability dependent on perturbation norm, kernel function, and training dataset distance.

DPI quantifies phase differences in 1D and multidimensional signals using Riesz transform.

problem Quantifying phase differences in signals of varying dimensions.
method Riesz transform framework for harmonic analysis.
result DPI detects hypersynchronization and subtle changes in images and artworks.

Deep-learning based classification algorithms have been shown to be susceptible to adversarial attacks: minor changes to the input of classifiers can dramatically change their outputs, while being imperceptible to humans. In this paper, we present a simple hypothesis about a feature compression property of artificial i…

2019-05-25abs ↗pdf ↗

Develops new methods to create imperceptible image changes that fool classifiers.

problem Improving the robustness of image classifiers by creating subtle changes undetectable to humans.
method Two methods: Edge-Aware and Color-Aware, designed to reduce detectability of image perturbations.
result Demonstrated that the new methods effectively cause misclassification and are computationally efficient.

New approach makes adversarial examples less suspicious without changing perceptual salience.

problem Robustness of deep neural networks to unsuspicious adversarial examples.
method Splitting images into foreground and background, allowing larger perturbations in background while maintaining low cognitive salience.
result Dual-perturbation attacks are effective against classifiers robust to conventional attacks and adversarial training yields more robust classifiers.

Recent advances show that deep neural networks are not robust to deliberately crafted adversarial examples which many are generated by adding human imperceptible perturbation to clear input. Consider l2l_2 norms attacks, Project Gradient Descent (PGD) and the Carlini and Wagner (C\&W) attacks are the two main methods, …

2019-06-07abs ↗pdf ↗

Designing models that are robust to small adversarial perturbations of their inputs has proven remarkably difficult. In this work we show that the reverse problem---making models more vulnerable---is surprisingly easy. After presenting some proofs of concept on MNIST, we introduce a generic tilting attack that injects …

2018-06-19abs ↗pdf ↗

Adversarial weight perturbations can inject backdoors into trained neural models.

problem Security risk of using publicly available trained models due to backdoors.
method Extended adversarial perturbations to model weights, using a composite loss and projected gradient descent.
result Adversarial weight perturbations can be successfully injected with very small changes, exposing security risks across various tasks.

Machine learning and deep learning in particular has advanced tremendously on perceptual tasks in recent years. However, it remains vulnerable against adversarial perturbations of the input that have been crafted specifically to fool the system while being quasi-imperceptible to a human. In this work, we propose to aug…

2017-02-14abs ↗pdf ↗

Proposes a new method to measure classifier robustness.

problem Measuring robustness of classifiers is crucial but challenging.
method Weighting sample importance based on difficulty and using logistic regression as a theoretical case study.
result The proposed score is independent of sample choice and measures robustness effectively.

Study improves image classifier robustness to random p-norm corruptions.

problem Improving robustness of image classifiers to real-world imperceptible corruptions.
method Training and testing with random p-norm corruptions, evaluating robustness against different p-norms.
result Training with a combination of p-norm corruptions significantly improves robustness.

Develops a framework for assessing adversarial robustness in deep learning models.

problem Adversarial examples can falsely flip deep learning models' predictions with imperceptible perturbations.
method Defines adversarial robustness as a locally adaptive measure and develops a data-augmentation framework.
result Proves that the adaptive data-augmentation maintains consistency of 1-nearest neighbor classification under deterministic labels.

TensorShield defends images from adversarial attacks using tensor decomposition.

problem Adversarial attacks on images can fool deep neural networks.
method Tensor decomposition to find low-rank approximations of images, reducing high-frequency perturbations.
result TensorShield outperforms existing methods like SLQ by 14% against FGSM attacks.

Ideally, what confuses neural network should be confusing to humans. However, recent experiments have shown that small, imperceptible perturbations can change the network prediction. To address this gap in perception, we propose a novel approach for learning robust classifier. Our main idea is: adversarial examples for…

2018-10-30abs ↗pdf ↗

Simple attack bypasses state-of-the-art DNN watermarking.

problem Protecting DNN models from watermark removal attacks.
method Combining imperceptible pattern embedding and spatial-level transformations for a simple yet effective watermark removal.
result Our attack bypasses state-of-the-art watermarking solutions with high success rates.

Adversarial examples are augmented data points generated by imperceptible perturbation of input samples. They have recently drawn much attention with the machine learning and data mining community. Being difficult to distinguish from real examples, such adversarial examples could change the prediction of many of the be…

2015-11-19abs ↗pdf ↗

Debona improves neural network verification by faster and tighter bounds.

problem Proving adversarial robustness of neural networks is computationally hard.
method Decouples upper and lower bounds computation, re-implements Neurify.
result 94% reduction in runtime for proving robustness of max-pooling layers.

Adversarial attacks aim to confound machine learning systems, while remaining virtually imperceptible to humans. Attacks on image classification systems are typically gauged in terms of pp-norm distortions in the pixel feature space. We perform a behavioral study, demonstrating that the pixel pp-norm for any $0\le p …

2019-06-06abs ↗pdf ↗

Machine learning methods in general and Deep Neural Networks in particular have shown to be vulnerable to adversarial perturbations. So far this phenomenon has mainly been studied in the context of whole-image classification. In this contribution, we analyse how adversarial perturbations can affect the task of semantic…

2017-03-03abs ↗pdf ↗

Study on adversarial training's impact on deep neural reinforcement learning policies.

problem Vulnerability of deep neural reinforcement learning policies to imperceptible adversarial perturbations.
method Two parallel approaches: Fourier spectrum analysis and feature sensitivity measurement.
result Adversarially trained policies are more sensitive to low frequency perturbations.

In this paper, we propose a game theoretical adversarial intervention detection mechanism for reliable smart road signs. A future trend in intelligent transportation systems is ``smart road signs" that incorporate smart codes (e.g., visible at infrared) on their surface to provide more detailed information to smart veh…

2019-01-30abs ↗pdf ↗

SEP uses checkpoints to protect data from training good models.

problem Protecting data from competitors training high-performance models.
method Forming perturbed examples using model checkpoints' gradients to ensure they are always unrecognized.
result SEP significantly reduces model accuracy when trained on perturbed data, demonstrating its effectiveness.

In this work, we demonstrate the existence of universal adversarial audio perturbations that cause mis-transcription of audio signals by automatic speech recognition (ASR) systems. We propose an algorithm to find a single quasi-imperceptible perturbation, which when added to any arbitrary speech signal, will most likel…

2019-05-09abs ↗pdf ↗