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.

169,051 papers · 148 categories

Trend · papers per month

3.7%7.4%11.1%14.8% · May 201919922001200920172026
48 results for adversarial activations

This paper analyzes output activation functions for adversarial losses.

problem Understanding which output activation functions form a well-behaved adversarial loss.
method Variational divergence minimization and a comparative framework for adversarial losses.
result There is no single winning combination of output activation functions and regularization approaches across all settings.

A new activation function k-WTA improves neural network defenses against adversarial attacks.

problem Improving neural network robustness against gradient-based adversarial attacks.
method Proposes k-Winners-Take-All activation function and analyzes its effectiveness.
result k-WTA activation significantly enhances neural network robustness against adversarial attacks.

New RL algorithm tackles adversarial RMAB with unknown transitions and bandit feedback.

problem Learning in episodic RMAB with unknown transition functions and adversarial rewards.
method Developed a novel RL algorithm with a biased reward estimator and an index policy.
result Achieved ildeO(HT) ilde{\mathcal{O}}(H\sqrt{T}) regret bound for adversarial RMAB.

Neural networks are known to be vulnerable to adversarial examples. Carefully chosen perturbations to real images, while imperceptible to humans, induce misclassification and threaten the reliability of deep learning systems in the wild. To guard against adversarial examples, we take inspiration from game theory and ca…

2018-03-05abs ↗pdf ↗

We propose a new active learning by query synthesis approach using Generative Adversarial Networks (GAN). Different from regular active learning, the resulting algorithm adaptively synthesizes training instances for querying to increase learning speed. We generate queries according to the uncertainty principle, but our…

2017-02-25abs ↗pdf ↗

SPLASH units improve deep neural network accuracy and adversarial robustness.

problem Improving deep neural network accuracy and adversarial robustness.
method SPLASH units are learnable activation functions with specific properties that enhance both accuracy and robustness.
result SPLASH units significantly increase adversarial robustness of deep neural networks.

Efficient active learning method defends against malicious mislabeling and data poisoning attacks.

problem Malicious mislabeling and data poisoning attacks on deep neural networks.
method Adversarial retraining and active learning with random sampling strategy.
result The proposed method achieves 89% accuracy with only one-third of the labeled data, significantly outperforming the baseline method.

SEAL improves AL on attributed graphs by combining deep learning and adversarial strategies.

problem Efficient AL on attributed graphs with label sparsity issues.
method SEAL framework using adversarial components for graph embedding and semi-supervised discriminator.
result Superior performance improvements over state-of-the-art baselines.

We propose a new active learning strategy designed for deep neural networks. The goal is to minimize the number of data annotation queried from an oracle during training. Previous active learning strategies scalable for deep networks were mostly based on uncertain sample selection. In this work, we focus on examples ly…

2018-02-27abs ↗pdf ↗

DAL uses disentanglement for automatic labeling in GAN-based active learning.

problem Reducing human labeling in GAN-based active learning.
method DAL leverages disentanglement in InfoGAN to automatically label datapoints, deciding human labeling based on disagreement with InfoGAN labels and label correction.
result DAL achieves better performance than existing GAN-based active learning approaches on image classification tasks.

New sparsity attacks degrade DNN efficiency, raising concerns for resource-constrained systems.

problem Vulnerabilities in DNNs through energy and latency attacks.
method Proposed sparsity attacks that modify DNN inputs to reduce activation sparsity, increasing execution time and energy consumption.
result Adversarial sparsity attacks can degrade DNN efficiency by up to 1.82x in image recognition DNNs.

A new method generates natural-looking adversarial examples by bounding internal activation values.

problem Creating natural-looking adversarial examples that closely mimic the original input.
method Bounding internal activation values through a distribution quantile bound and polynomial barrier loss function.
result Our attack achieves similar success and confidence levels as state-of-the-art methods but with more natural-looking perturbations.

Adversarial training purifies hidden weights to remove small perturbations.

problem Understanding and removing adversarial perturbations in deep learning models.
method Introducing Feature Purification, a principle that adversarial training aims to remove small dense mixtures in hidden weights.
result Adversarial training can make neural networks robust against small perturbations, even with simple algorithms.

TA-VAAL improves active learning by better utilizing task structures and overall data distribution.

problem High labeling cost limits deep learning applications; active learning selects informative samples.
method Task-aware variational adversarial active learning (TA-VAAL) modifies VAAL by relaxing task loss prediction and using ranking loss information.
result TA-VAAL outperforms state-of-the-arts on various datasets, including balanced and imbalanced labels.

A new PLL method uses class activation values to improve robustness.

problem Weakly supervised learning with noisy data and adversarial perturbations.
method Subjective logic with class activation values for uncertainty representation and label weight re-distribution.
result More robust predictions under high noise levels, out-of-distribution examples, and adversarial perturbations.

Classifiers operating in a dynamic, real world environment, are vulnerable to adversarial activity, which causes the data distribution to change over time. These changes are traditionally referred to as concept drift, and several approaches have been developed in literature to deal with the problem of drift handling an…

2018-03-24abs ↗pdf ↗

Our work proves convergence to low robust training loss for polynomial width ReLU networks.

problem Understanding why adversarial training leads to low robust training loss in over-parameterized neural nets.
method Extending convergence theory for standard supervised training to adversarial training, using tools from online learning and showing ReLU networks can approximate the step function.
result Convergence to low robust training loss for polynomial width ReLU networks under natural assumptions.

Improved neural spike inference from calcium imaging data.

problem Neural spike inference from calcium imaging data.
method Importance weighted adversarial variational autoencoders (IWAE) with adversarial training.
result Adversarial IWAE methods outperform VAEs in inferring neural spikes.

New algorithm robust to label corruptions in active learning.

problem Active learning under unknown adversarial label corruptions.
method Proposed a new active learning algorithm that is provably correct without assumptions on corruptions.
result Achieves minimax label complexity in non-corrupted setting and only requires additional labels to achieve desired accuracy in corrupted setting.

Proposes a new model to generate informative samples for image classification without querying an oracle.

problem Expensive and difficult labeling of data for machine learning models.
method Integrates active learning with a conditional GAN to generate samples with high uncertainty for a specific label.
result Generated samples improve image classification performance without querying an oracle.

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.

A new approach for learning from expert demonstrations using multiple perspectives.

problem Learning from expert demonstrations with limited information from different perspectives.
method Generative adversarial network-based active learning approach.
result Our approach effectively learns from expert demonstrations and highlights the importance of architectural choices.

The paper explores transferability of adversarial examples between convex and 01 loss models, finding non-transferability due to different decision boundaries caused by outliers.

problem Transferability of adversarial examples between convex and 01 loss models.
method Empirical study of transferability between linear 01 loss and convex (hinge) loss models, and between neural networks with different activation functions.
result Adversarial examples are non-transferable between convex and 01 loss models due to different decision boundaries caused by outliers.

Study improves distributed linear estimation under adversarial conditions.

problem Mean estimation of a random vector with adversarial measurements and asynchrony.
method Two-timescale ℓ1-minimization algorithm with tight convergence rates.
result Unified finite-time characterization of robustness, identifiability, and statistical efficiency.

This work accelerates uncertainty propagation in DNNs using active subspace.

problem Challenges in propagating uncertainty in DNN predictions from real-world data.
method Gradient-based active subspace method and response surface technique.
result Efficient uncertainty propagation in DNN predictions at low computational cost.

New algorithm learns halfspaces with adversarial noise efficiently.

problem Learning halfspaces in the presence of adversarial noise.
method Polynomial-time Perceptron-like online active learning algorithm.
result Near-optimal label and sample complexity with isotropic log-concave marginal distribution.

Study on online learning with networked agents, showing how network structure affects performance.

problem Understanding how network structure impacts performance in online learning settings.
method Characterized the effect of network structure on regret in both stochastic and adversarial settings.
result Optimal regret bound of order αT\sqrt{αT} when activations are stochastic and network structure is known.

Discriminative active learning reduces data annotation costs for domain adaptation.

problem Conditional shift problem hinders domain adaptation between related but different domains.
method Three-stage active adversarial training: invariant feature space learning, uncertainty and diversity criteria, re-training with queried labels.
result Empirical comparisons show the proposed approach is more effective than existing methods.