Deep neural networks (DNNs) have been widely used in the fields such as natural language processing, computer vision and image recognition. But several studies have been shown that deep neural networks can be easily fooled by artificial examples with some perturbations, which are widely known as adversarial examples. A…
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,695 papers · 148 categories
Trend · papers per month
48 results for “examples”
Generates positive examples from noisy data streams.
problem Learning from noisy example streams in hypothesis classes.
method Extending results from previous studies to account for noise.
result Conditions for noisily generatable binary hypothesis classes.
We construct new examples of self-similar solutions and translating solitons for Lagrangian mean curvature flow by extending the method of Joyce, Lee and Tsui. Those examples include examples in which the Lagrangian angle is arbitrarily small as the examples of Joyce, Lee and Tsui.
With rapid progress and significant successes in a wide spectrum of applications, deep learning is being applied in many safety-critical environments. However, deep neural networks have been recently found vulnerable to well-designed input samples, called adversarial examples. Adversarial examples are imperceptible to …
Model forgets examples; this research predicts which ones to replay.
problem Language models forget examples during updates, leading to errors.
method Train forecasting models to predict which examples will be forgotten.
result Forecasting models can reduce forgetting of upstream pretraining examples.
Cincer cleans both new and past data by identifying and relabeling suspicious and counter-examples.
problem Sequential learning under label noise, especially in applications with human supervision.
method Cincer uses example-based explanations to identify and relabel suspicious and counter-examples, leveraging Fisher information matrix approximation.
result Cincer achieves better data and models by clarifying the model's suspicions, especially with FIM approximation.
Gödel's sentence is an adversarial example but unsolvable.
problem The existence and unsolvability of adversarial examples.
method Analysis of non-isomorphic natural explanations and computability theory.
result Gödel's sentence is an adversarial example that cannot be solved.
Deep learning frameworks leverage GPUs to perform massively-parallel computations over batches of many training examples efficiently. However, for certain tasks, one may be interested in performing per-example computations, for instance using per-example gradients to evaluate a quantity of interest unique to each examp…
It has been shown that adversaries can craft example inputs to neural networks which are similar to legitimate inputs but have been created to purposely cause the neural network to misclassify the input. These adversarial examples are crafted, for example, by calculating gradients of a carefully defined loss function w…
Proposes BATer for improved adversarial example detection.
problem Detecting adversarial examples in neural networks.
method Introduces a Bayesian adversarial example detector (BATer) using random components in a Bayesian neural network.
result BATer outperforms state-of-the-art detectors in adversarial example detection.
We consider learning problems where the training set consists of two types of examples: private and public. The goal is to design a learning algorithm that satisfies differential privacy only with respect to the private examples. This setting interpolates between private learning (where all examples are private) and cl…
Detecting adversarial examples currently stands as one of the biggest challenges in the field of deep learning. Adversarial attacks, which produce adversarial examples, increase the prediction likelihood of a target class for a particular data point. During this process, the adversarial example can be further optimized…
Catastrophic forgetting of connectionist neural networks is caused by the global sharing of parameters among all training examples. In this study, we analyze parameter sharing under the conditional computation framework where the parameters of a neural network are conditioned on each input example. At one extreme, if e…
Deep neural networks (DNNs) have transformed several artificial intelligence research areas including computer vision, speech recognition, and natural language processing. However, recent studies demonstrated that DNNs are vulnerable to adversarial manipulations at testing time. Specifically, suppose we have a testing …
RelatIF selects more intuitive training examples for explaining model predictions.
problem Influence functions identify outliers as explanatory examples, leading to poor explanations.
method RelatIF separates global and local influence, optimizing for local relative to global effects.
result Examples selected by RelatIF are more intuitive than those from influence functions.
On variational bivectorsmath.DG
New examples of variational bivectors found that are not Poissonian.
problem Identifying variational bivectors that are not Poissonian.
method Constructing examples of variational bivectors.
result Found examples of variational bivectors that are not Poissonian.
We give examples of certain kind of minimal orbits of Hermann actions and discuss whether each of the examples is austere.
Recent studies show that widely used deep neural networks (DNNs) are vulnerable to carefully crafted adversarial examples. Many advanced algorithms have been proposed to generate adversarial examples by leveraging the distance for penalizing perturbations. Researchers have explored different defense met…
Algorithm learns from both labeled and arbitrary test examples, giving guarantees for bounded VC dimension classes.
problem Learning from arbitrary test examples, not just perturbations.
method Selective transductive learning algorithm that outputs abstaining predictions.
result Nontrivial guarantees for bounded VC dimension classes with arbitrary train and test distributions.
When learning a new concept, not all training examples may prove equally useful for training: some may have higher or lower training value than others. The goal of this paper is to bring to the attention of the vision community the following considerations: (1) some examples are better than others for training detector…
StrokeCoder uses Transformers to generate images from single examples.
problem Creating diverse images from a single example.
method Transformer Neural Network learns from a single path-based example to generate a set of images.
result The model can generate a large set of deviated images that still represent the original image's style and concept.
The paper analyzes how forgetting in LLMs is linked to simple task-upstream example associations.
problem Forgetting of upstream knowledge in fine-tuned LLMs.
method Empirical analysis of forgotten examples in upstream examples after new tasks, using low-rank matrix approximation.
result Forgetting can be predicted efficiently using matrix completion over empirical associations.
Despite the great success achieved in machine learning (ML), adversarial examples have caused concerns with regards to its trustworthiness: A small perturbation of an input results in an arbitrary failure of an otherwise seemingly well-trained ML model. While studies are being conducted to discover the intrinsic proper…
New examples of manifolds with positive scalar curvature and infinitely many poles.
problem Constructing manifolds with positive scalar curvature and understanding their limits.
method Extending previous examples to create new sequences of manifolds.
result Found new examples of manifolds with infinitely many poles and positive scalar curvature.
Paper generates natural adversarial examples for hyperspectral data.
problem Creating adversarial examples for black-box models.
method Modified Wasserstein GAN reweights true data distribution.
result Successfully generates adversarial hyperspectral signatures.
This study explores how examples influence ICL in LLMs.
problem Understanding how examples impact in-context learning in large language models.
method Theoretical study with a probabilistic model extending from Gaussian mixture model.
result The impact of pre-training knowledge and examples on ICL prediction accuracy.
In many classification problems unlabelled data is abundant and a subset can be chosen for labelling. This defines the context of active learning (AL), where methods systematically select that subset, to improve a classifier by retraining. Given a classification problem, and a classifier trained on a small number of la…
ManiGen generates adversarial examples without classifier knowledge.
problem Vulnerability of neural network classifiers to adversarial examples.
method Generates adversarial examples by searching along the manifold.
result Adversarial examples generated by ManiGen are as successful as state-of-the-art generators.
Lazy vs hasty: linearization in deep networks impacts learning schedule based on example difficultycs.LG
Deep networks prioritize easier examples over harder ones, leading to faster training.
problem Understanding how deep networks prioritize examples of varying difficulty.
method Investigated the effect of linear vs non-linear learning modes on example difficulty.
result Non-linear dynamics tend to sequentialize the learning of examples of increasing difficulty.
Detects adversarial examples using autoencoders at hidden layers.
problem Identifying adversarial examples in deep neural networks.
method Trains autoencoders on intermediate layers to detect deviations from true data.
result Outperforms state-of-the-art methods in both supervised and unsupervised settings.
Algorithm predicts with optimal loss by abstaining from uncertain test examples.
problem Predicting with training data not matching test data.
method Transductive abstention algorithm using labeled and unlabeled test examples.
result Optimal prediction loss guarantees with additional term for abstaining cost.
Method trains deep models to explain predictions with fewer examples.
problem Difficulty in humans understanding deep model predictions.
method Simultaneously trains prediction and explanation models with sparse regularization.
result Improves faithfulness of explanations with fewer examples while maintaining predictive performance.
In recent years, the electrocardiogram (ECG) has seen a large diffusion in both medical and commercial applications, fueled by the rise of single-lead versions. Single-lead ECG can be embedded in medical devices and wearable products such as the injectable Medtronic Linq monitor, the iRhythm Ziopatch wearable monitor, …
We study the problem of reducing the amount of labeled training data required to train supervised classification models. We approach it by leveraging Active Learning, through sequential selection of examples which benefit the model most. Selecting examples one by one is not practical for the amount of training examples…
We propose a method to generate audio adversarial examples that can attack a state-of-the-art speech recognition model in the physical world. Previous work assumes that generated adversarial examples are directly fed to the recognition model, and is not able to perform such a physical attack because of reverberation an…
State-of-art deep neural networks (DNN) are vulnerable to attacks by adversarial examples: a carefully designed small perturbation to the input, that is imperceptible to human, can mislead DNN. To understand the root cause of adversarial examples, we quantify the probability of adversarial example existence for linear …
Adversarial examples are inputs to machine learning models designed by an adversary to cause an incorrect output. So far, adversarial examples have been studied most extensively in the image domain. In this domain, adversarial examples can be constructed by imperceptibly modifying images to cause misclassification, and…
New examples show some convex-cocompact subgroups are separable.
problem Whether all convex-cocompact subgroups are separable.
method Using Manning-Mj-Sageev construction, examples of separable subgroups of arbitrary finite rank are given.
result Examples of separable convex-cocompact subgroups of arbitrary finite rank exist.
Many machine learning algorithms are based on the assumption that training examples are drawn independently. However, this assumption does not hold anymore when learning from a networked sample where two or more training examples may share common features. We propose an efficient weighting method for learning from netw…
Finding examples of tangentially degenerate submanifolds (submanifolds with degenerate Gauss mappings) in an Euclidean space that are noncylindrical and without singularities is an important problem of differential geometry. The first example of such a hypersurface was constructed by Sacksteder in 1960. In 1995 W…
Tiny benchmarks reduce LLM evaluation costs by using fewer examples.
problem Expensive evaluation of LLMs with tens of thousands of examples.
method Developed evaluation tools and tiny versions of popular benchmarks.
result Accurately estimate LLM performance with just 100 curated examples.
We give examples of endperiodic automorphisms.
Auckly gave two examples of irreducible integer homology spheres (one toroidal and one hyperbolic) which are not surgery on a knot in the three-sphere. Using Heegaard Floer homology, the authors and Karakurt provided infinitely many small Seifert fibered examples. In this note, we extend those results to give infinitel…
TEAM generates more powerful adversarial examples for DNNs.
problem Vulnerability of DNNs to imperceptible adversarial examples.
method TEAM uses Taylor expansion and Lagrangian multiplier method to craft adversarial examples.
result TEAM generates adversarial examples with 100% attack success rate using smaller perturbations.
Neural networks are vulnerable to adversarial examples, malicious inputs crafted to fool trained models. Adversarial examples often exhibit black-box transfer, meaning that adversarial examples for one model can fool another model. However, adversarial examples are typically overfit to exploit the particular architectu…
A gap in a paper of Rubinstein-Scharlemann is explored: new examples are found of closed orientable 3-manifolds with possibly multiple genus 2 Heegaard splittings. Properties common to all the examples in the original paper are not universally shared by the new examples: some of the new examples have Hempel distance 3,…
In this short note we highlight some of the differences between cube diagrams and grid diagrams. We also list examples of small cube diagrams for all knots up to 7 crossings and give some examples of links.
In this paper, we give some examples of area minimizing surfaces to clarify some well-known features of these surfaces in more general settings. The first example is about Meeks-Yau's result on embeddedness of solution to the Plateau problem. We construct an example of a simple closed curve in R^3 which lies in the bou…