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,932 papers · 148 categories

Trend · papers per month

6.3%12.5%18.8%25.0% · Apr 199319922001200920172026
48 results for diverse perturbations

This work generates diverse adversarial attacks for different domains using latent variable perturbation.

problem Adversarial attacks on deep neural networks are limited to a single perturbation.
method Frame adversarial attacks as learning a distribution of perturbations, enabling generation of diverse attacks.
result Framework generates competitive or superior adversarial attacks across diverse domains (images, text, graphs).

Adversarial training adds dynamic perturbations to neural networks for robustness.

problem Accuracy trade-off and lack of diversity in adversarial examples.
method Dynamic adversarial perturbations in the parameter space of neural networks, updating perturbation biases during training.
result Adversarial training with negligible cost and reduced accuracy trade-off.

PGEL learns embeddings to diversify protein motifs while maintaining biological function.

problem Generating diverse protein structures while preserving biological function.
method Embedding learning framework that enhances motif diversity in a diffusion model's frozen denoiser.
result PGEL achieves greater structural diversity, better designability, and improved self-consistency compared to partial diffusion.

PerturBench benchmarks ML models for cellular perturbation analysis.

problem Standardizing benchmarking in modeling single cell transcriptomic responses to perturbations.
method Modular platform, diverse datasets, metrics, extensive evaluation, rank metrics.
result Simpler models are competitive and scale well with larger datasets.

New method stabilizes private LASSO for high-dimensional data with diverse covariate scales.

problem Privacy constraints and heterogeneity in covariate scales degrade LASSO stability and accuracy.
method Gram-based anisotropic objective perturbation to counteract covariate structure.
result Significantly improves convergence and statistical efficiency of private LASSO estimators.

We consider the problem of diversity enhancing clustering, i.e, developing clustering methods which produce clusters that favour diversity with respect to a set of protected attributes such as race, sex, age, etc. In the context of fair clustering, diversity plays a major role when fairness is understood as demographic…

2019-04-10abs ↗pdf ↗

We study the transfer of adversarial robustness of deep neural networks between different perturbation types. While most work on adversarial examples has focused on LL_\infty and L2L_2-bounded perturbations, these do not capture all types of perturbations available to an adversary. The present work evaluates 32 attack…

2019-05-03abs ↗pdf ↗

SEERL uses ensemble methods to improve reinforcement learning efficiency.

problem High sample complexity and computational expense in reinforcement learning.
method Directed perturbation of model parameters to learn diverse policies, selection of an adequately diverse set of policies.
result Our approach outperforms state-of-the-art scores in Atari 2600 and Mujoco.

ODS improves adversarial attacks by maximizing output diversity.

problem Efficiency and effectiveness of adversarial attacks, especially black-box attacks.
method Output Diversified Sampling (ODS) that maximizes diversity in model outputs.
result ODS reduces the number of queries needed for black-box attacks on ImageNet by a factor of two.

Novel framework uses synthetic data to quantify uncertainty in complex data.

problem Uncertainty quantification in complex, unstructured data.
method Perturbation-Assisted Sample Synthesis (PASS) and Perturbation-Assisted Inference (PAI) framework.
result Statistically guaranteed validity in inference, enhancing reliability of synthetic data.

Paper introduces a new method for generating diverse human motion predictions.

problem Stochastic human motion prediction with limited flexibility.
method Stochastically combines root variations with previous pose information in a recurrent network.
result Model generates more diverse motion sequences than existing techniques.

This paper explores how diverse neural network ensembles improve prediction accuracy and robustness against deception.

problem Improving prediction accuracy and robustness of neural networks against adversarial attacks.
method Examines and measures ensemble diversity, develops algorithms for creating and combining diverse ensembles.
result Greater diversity in neural network ensembles leads to higher accuracy and robustness against deception.

The paper tackles extrapolation of gene knockouts effects on RNA counts.

problem Modeling effects of gene knockouts on RNA counts for new perturbations.
method Formulated as a latent variable model with additive perturbation effects, proved identifiability, proposed PDAE for estimation.
result PDAE can accurately predict effects of unseen but identifiable perturbations.

FHBI enhances generalization in Bayesian inference with iterative steps in functional spaces.

problem Improving generalization in Bayesian inference models.
method Iterative two-step procedure with adversarial and functional descent steps in a reproducing kernel Hilbert space.
result FHBI consistently outperforms nine baseline methods on the VTAB-1K benchmark.

We address the challenge of effective exploration while maintaining good performance in policy gradient methods. As a solution, we propose diverse exploration (DE) via conjugate policies. DE learns and deploys a set of conjugate policies which can be conveniently generated as a byproduct of conjugate gradient descent. …

2019-02-10abs ↗pdf ↗

New measures quantify diversity of latent representations using metric space magnitude.

problem Evaluating the diversity of latent representations in machine learning models.
method Developed magnitude-based measures for latent representations, stable under data perturbations.
result Demonstrated superior performance across various domains and tasks.

New method for analyzing compositional data, addressing biases in summary statistics.

problem Inadequate effect measures for compositional data, especially in high-dimensionality and sparsity.
method Perturbation-based effect measures, average perturbation effects.
result Proposed estimators efficiently estimate average perturbation effects, outperforming existing techniques.

FoRDE uses input gradients to improve neural network ensembles.

problem Improving neural network ensembles for robustness and accuracy.
method Proposes FoRDE, an ensemble learning method based on ParVI, which repels function space by input gradients.
result FoRDE significantly outperforms DEs and other ensemble methods in accuracy and calibration.

The paper learns perturbation sets from data to improve robustness in machine learning.

problem Real-world perturbations are not well characterized in adversarial defenses.
method A conditional generator defines perturbation sets over latent space, with properties for quality measured.
result Learned perturbation sets generate diverse, meaningful perturbations and improve model robustness.

New regularization techniques improve stability of deep neural networks.

problem Improving stability of deep neural networks in high-dimensional data.
method Apply manifold regularization to develop new regularizers based on graph Laplacian sparsification.
result Empirically, networks achieve high stability in various perturbation models, including adversarial attacks.

We analyze the adversarial examples problem in terms of a model's fault tolerance with respect to its input. Whereas previous work focuses on arbitrarily strict threat models, i.e., εε-perturbations, we consider arbitrary valid inputs and propose an information-based characteristic for evaluating tolerance to diverse …

2018-11-30abs ↗pdf ↗

New metrics improve scRNA-seq perturbation modeling by reducing mode collapse.

problem Outperformed by simple mean prediction in scRNA-seq perturbation modeling.
method Introduce DEG-aware metrics (WMSE, Rw2(Δ)R^{2}_{w}(Δ)) and negative/positive baselines.
result WMSE loss function reduces mode collapse and improves model performance.

DIP-FAT improves adversarial training by diversifying perturbations.

problem Adversarial examples fool deep neural networks, leading to overfitting and poor performance.
method DIP-FAT uses random directions to diversify perturbations in adversarial training.
result DIP-FAT reduces overfitting and improves clean data accuracy.

The paper proposes a method to generate diverse counterfactual explanations for anomaly detection in time series data.

problem Lack of helpful explanations for anomaly detection models in time series data.
method Model-agnostic algorithm that generates diverse counterfactual examples for anomaly detection models.
result The method produces counterfactual examples that are not considered anomalous by the detection model and satisfy validity, plausibility, and closeness criteria.

Adversaries with multiple antennas can fool deep learning modulators more effectively.

problem Improving evasion attacks on deep learning-based modulation classifiers.
method Utilizing multiple antennas to enhance adversarial attacks on deep learning classifiers.
result Adversarial attacks with multiple antennas significantly improve classifier accuracy.

The paper introduces a method to improve adversarial robustness in neural networks using randomized perturbations.

problem Deep neural networks are sensitive to small perturbations on correctly classified examples, leading to erroneous predictions.
method The approach uses randomized perturbations to optimize the worst case loss function over all possible substitutions of training examples, ensuring that substitution likelihood is weighted by the proximity to the original word.
result The method achieves performance gains and differentially-private model training, improving robustness against adversarial attacks.

CausalRegNet generates accurate data for gene perturbation experiments, improving CSL methods.

problem Assessing and selecting causal structure learning methods in gene perturbation experiments.
method CausalRegNet, a multiplicative effect structural causal model, generates accurate observational and interventional data.
result CausalRegNet generates more accurate distributions and scales better than current simulation frameworks.

SAMS-VAE models cellular perturbations using sparse additive mechanisms.

problem Modeling effects of diverse interventions on cells.
method Sparse Additive Mechanism Shift Variational Autoencoder (SAMS-VAE).
result SAMS-VAE identifies disentangled, perturbation-specific latent subspaces.

Study on stability of GCNNs under graph perturbations.

problem Limited theoretical understanding of GCNN stability.
method Proposes a probabilistic framework to analyze GCNN stability under various graph perturbations.
result Demonstrates the importance of data distribution in stability analysis.

This study benchmarks transcriptomics models for perturbation analysis, finding scVI and PCA superior.

problem Limited evaluation of transcriptomics foundation models for perturbation analysis.
method Developed a novel evaluation framework using diverse public datasets from different sequencing techniques and cell lines.
result scVI and PCA identified as superior models for understanding biological perturbations.

GANchors generates realistic image perturbations for better classifier explanations.

problem Improving the trustworthiness of image classification explanations.
method Using GANs to optimize a lower-dimensional latent space for realistic perturbation distributions.
result Generated images are more likely to be from the original training set, leading to more precise explanations.

MODEF combines denoising and verification to defend against adversarial attacks.

problem Vulnerability of deep neural networks to adversarial inputs.
method Cross-layer model diversity ensemble combining unsupervised denoising and supervised verification.
result MODEF achieves remarkable defense success rates against black-box attacks.

DVERGE diversifies adversarial vulnerabilities to enhance robust ensemble models.

problem Diverse adversarial vulnerabilities for robust ensemble models.
method Isolates and diversifies adversarial vulnerabilities through distillation and training.
result Achieves higher robustness against transfer attacks compared to previous methods.

SVAT reduces investment risks by making stock models sensitive to adversarial perturbations.

problem Risk control in stock recommendation models is insufficient, leading to high investment losses.
method SVAT combines adversarial learning and variational perturbation generation to enhance risk awareness.
result SVAT reduces investment risks by more than 30% compared to state-of-the-art baselines.

Adversarial examples are delicately perturbed inputs, which aim to mislead machine learning models towards incorrect outputs. While most of the existing work focuses on generating adversarial perturbations in multi-class classification problems, many real-world applications fall into the multi-label setting in which on…

2019-01-02abs ↗pdf ↗

Graphs can be fooled by small edge changes, but this work protects them.

problem Adversaries can manipulate graph data to mislead graph classification models.
method We introduce a smoothed graph classification model with a robustness guarantee.
result The smoothed model maintains consistent predictions under small adversarial perturbations.

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.

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.