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

Trend · papers per month

103206308411 · Jun 202019922001200920172026
48 results for Robust Transfer

Adversarially robust models transfer better than standard models in image classification.

problem Improving transfer learning performance in image classification.
method Focused on adversarially robust ImageNet classifiers, compared to standard models.
result Adversarially robust models yield improved accuracy on downstream classification tasks.

Paper tackles robust transfer learning with unreliable source data.

problem Challenges in robust transfer learning stemming from ambiguity in Bayes classifiers and weak transferable signals.
method Introduces ambiguity level, proposes Transfer Around Boundary (TAB) model, establishes general theorem.
result Demonstrates efficiency and robustness of TAB model improving classification while avoiding negative transfer.

RTFE provides adversarial robustness to multiple models.

problem Adversarial examples can transfer to other models, compromising robustness.
method Proposes RTFE, a deep learning-based pre-processing mechanism.
result RTFE provides adversarial robustness to multiple independently trained classifiers.

Study shows how pretraining robustness transfers to downstream tasks.

problem Understanding how robustness is transferred from pretraining to downstream tasks.
method Theoretical analysis and practical validation of robustness constraints.
result Robustness of a linear predictor on downstream tasks can be constrained by the robustness of its underlying representation.

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.

Transfer learning aims at building robust prediction models by transferring knowledge gained from one problem to another. In the semantic Web, learning tasks are enhanced with semantic representations. We exploit their semantics to augment transfer learning by dealing with when to transfer with semantic measurements an…

2019-05-31abs ↗pdf ↗

Transfer learning improves model robustness against adversarial attacks.

problem Understanding how transfer learning affects model robustness against adversarial attacks.
method Extensive empirical evaluations of white-box and black-box attacks on fine-tuned transfer learning models.
result Adversarial examples are more transferable when fine-tuning is used than when networks are trained independently.

This work studies adversarial transferability and proposes ensemble methods to improve robustness.

problem Adversarial transferability in neural networks and its implications for robustness.
method Investigates the effect of various factors on adversarial transferability and proposes ensemble attack methods.
result Transferability is significantly hampered by input quantization and architectural mismatch, but not by initialization.

New method tackles concept shifts in nonparametric regression using robust and adaptive transfer learning.

problem Concept shifts and sample scarcity in target domains hinder nonparametric regression.
method Robust and adaptive transfer learning procedure leveraging fixed bandwidth Gaussian kernels.
result Spectral algorithms with fixed bandwidth Gaussian kernels attain minimax convergence rates for nonparametric regression.

Transfer learning, in which a network is trained on one task and re-purposed on another, is often used to produce neural network classifiers when data is scarce or full-scale training is too costly. When the goal is to produce a model that is not only accurate but also adversarially robust, data scarcity and computatio…

2019-05-20abs ↗pdf ↗

CTRF combines logged data and randomized experiments for robust prediction.

problem Robust prediction models to handle distributional shifts between training and testing data.
method CTRF uses existing training data and a small amount of randomized experiment data to train a robust model.
result CTRF produces robust predictions and outperforms baseline methods in the presence of feature shifts.

A new method transfers adversarial robustness from teacher to student using feature distillation.

problem Adversarial robustness transfer across different models and tasks.
method Guided Adversarial Contrastive Distillation (GACD) with contrastive learning and sample reweighted estimation.
result GACD effectively transfers adversarial robustness from teacher to student, achieving comparable or better results.

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 ↗

LOTOS improves ensemble robustness by promoting orthogonal transformations.

problem Transferability of adversarial examples threatens robustness of classification models.
method LOTOS promotes orthogonality among sub-spaces of transformations in ensemble models.
result LOTOS increases robust accuracy of ensembles by 6 percentage points against black-box attacks.

The paper analyzes and minimizes transferability of adversarial attacks between models in an ensemble.

problem Adversarial attacks can transfer between models, posing security risks.
method Introduces a gradient-based measure to assess and reduce transferability, and uses it during training to increase robustness.
result Demonstrates that the gradient-based measure can be used to increase an ensemble's robustness to adversarial attacks.

Transfer knowledge from multiple sources to improve matrix completion.

problem Matrix completion with noisy data.
method Aggregating singular subspaces information from multiple sources to solve a two-way PCA problem and transform into a low-dimensional linear regression.
result Guaranteed statistical efficiency in transforming the high-dimensional target matrix completion problem.

Paper tackles robust knowledge transfer in parallel RL tasks.

problem Transfer knowledge from low-tier to high-tier tasks in parallel RL without shared dynamics or reward functions.
method Identifies Optimal Value Dominance condition and proposes online learning algorithms for both tasks.
result Achieves constant regret on partial states and near-optimal regret when tasks are dissimilar.

Batch normalization shifts models to rely more on non-robust features.

problem Understanding the impact of batch normalization on deep neural networks.
method Empirical analysis and a framework for disentangling robustness and usefulness.
result Batch normalization increases reliance on non-robust features, decreasing adversarial robustness.

KG-WDRO optimizes transfer learning with external knowledge.

problem Over-pessimism in WDRO for small target samples.
method KG-WDRO incorporates multiple sources of external knowledge to construct smaller Wasserstein ambiguity sets.
result KG-WDRO improves transfer learning performance and adaptivity.

Patients whose transfer to the Intensive Care Unit (ICU) is unplanned are prone to higher mortality rates than those who were admitted directly to the ICU. Recent advances in machine learning to predict patient deterioration have introduced the possibility of \emph{proactive transfer} from the ward to the ICU. In this …

2020-02-14abs ↗pdf ↗

New method improves transfer and robustness of supervised contrastive learning.

problem Class collapse in supervised contrastive learning leads to poor representation quality.
method Adding a weighted class-conditional InfoNCE loss and a class-conditional autoencoder.
result Improves transfer and robustness on 5 standard datasets and 3 worst-group robustness datasets.

Paper tackles robustness in adversarial noise with a meta-optimizer.

problem Sensitivity to adversarial noise hinders machine learning deployment.
method Meta-optimizer learns to robustly optimize models using adversarial examples.
result Meta-optimizer transfers adversarial knowledge to new models without generating new examples.

CONCERT improves transfer learning by borrowing partial information from auxiliary datasets.

problem Inefficiency of global similarity measures in transfer learning for high-dimensional data.
method Conditional spike-and-slab prior with covariate-specific priors for robust partial information transfer.
result CONCERT achieves variable selection and information transfer simultaneously, improving performance on the target.

Algorithm identifies and transfers unstable features to create robust classifiers.

problem Developing unbiased classifiers from input-label pairs alone.
method Contrast different data environments in source tasks to encode unstable features, then cluster target task data and minimize worst-case risk.
result Our method maintains robustness across synthetic and real-world environments.

SAM minimizes loss sharpness, improving adversarial transferability.

problem Improving adversarial transferability of deep neural networks.
method Evaluating surrogate models trained with seven minimizers, focusing on loss sharpness and flat neighborhoods.
result SAM minimizes loss sharpness, leading to better adversarial transferability.

Adversarial training enhances model transferability without sacrificing accuracy.

problem The principle of minimal information in classification models is challenged by adversarial training.
method Investigation of the dual relationship between adversarial training and information theory.
result Adversarial training improves linear transferability and introduces a trade-off between transferability and source task accuracy.

Bayesian method mitigates negative transfer in unknown source data.

problem Negative transfer in transfer learning where target performance worsens after source data consideration.
method Proxy-informed robust method for probabilistic transfer learning (PROMPT).
result Negative transfer can be mitigated without prior knowledge of source data.

Study reveals adversarially robust domain adaptation is harder to generalize across domains.

problem Hardness of transferring adversarial robustness across different domains.
method Analysis of adversarial Rademacher complexity over symmetric difference hypothesis space.
result Adversarial Rademacher complexity is always greater than non-adversarial, indicating intrinsic hardness.

Paper presents a robust transfer learning method for active level set estimation.

problem Efficiently identifying regions of a black-box function with limited function evaluations.
method Incorporates prior knowledge from a related function while locally adapting it.
result The method achieves better convergence of level sets compared to standard transfer learning.

Study improves GMM learning performance through multi-task and transfer learning.

problem Improving GMM learning performance through similar task structures.
method Proposes a multi-task GMM learning procedure based on EM algorithm, robust to outliers.
result Achieves minimax optimal rate of convergence for parameter estimation and mis-clustering.

A new framework for robust transfer learning that avoids negative transfer in domains with unequal information.

problem Negative transfer in unsupervised domain adaptation, especially when source and target domains have different levels of informativeness.
method Decision-theoretic framework based on Le Cam's theory of statistical experiments, using constructive approximations to replace strict invariance with directional simulability.
result Le Cam Distortion achieves near-perfect frequency estimation and zero source utility loss in various domains, demonstrating superior performance compared to traditional methods.

Grogan et al [11,12] have recently proposed a solution to colour transfer by minimising the Euclidean distance L2 between two probability density functions capturing the colour distributions of two images (palette and target). It was shown to be very competitive to alternative solutions based on Optimal Transport for c…

2019-05-29abs ↗pdf ↗

It is always demanding to learn robust visual representation for various learning problems; however, this learning and maintenance process usually suffers from noise, incompleteness or knowledge domain mismatch. Thus, robust representation learning by removing noisy features or samples, complementing incomplete data, a…

2019-09-28abs ↗pdf ↗

This paper examines allocation mechanisms in markets with transfer costs, showing how these costs affect economic efficiency.

problem Transfer costs in decentralized exchange markets reduce economic efficiency.
method An axiomatic study of allocation mechanisms in the presence of transfer costs, providing robust and conditional mean allocation mechanisms.
result Robust and conditional mean allocation mechanisms are identified, relating to risk sharing in agent pools.

State entropy regularization improves robustness in reinforcement learning, especially under structured perturbations.

problem Structured and spatially correlated perturbations in reinforcement learning.
method State entropy regularization, compared to policy entropy.
result State entropy regularization provides better robustness to structured and spatially correlated perturbations.

New approach improves domain adaptation by enforcing cluster assumption in target domain.

problem Lack of robustness in target classifier due to violation of cluster assumption.
method Enforces cluster assumption in target domain (Target Consistency) paired with Class-Level InVariance.
result Significant improvement in image classification and segmentation benchmarks.

DRUM transfers cardiac arrest models across registries with missing covariates.

problem Clinical prediction models fail when key training covariates are unavailable at deployment.
method DRUM transfers models to target populations with structurally missing covariates, optimizing worst-case predictive performance over unknown target distributions.
result DRUM yields better-calibrated predictions and improved clinical classification performance across sites.