FLDA adapts classifiers across domains using feature-level transfer models.
problem Adapting classifiers to different data distributions.
method FLDA models domain dependence with a feature-level transfer model, then trains a classifier to minimize expected loss.
result FLDA performs similarly to state-of-the-art techniques on real-world problems.
Proposes a model to decompose feature-level variation in high-dimensional data.
problem Interpreting complex high-dimensional data for understanding feature-level variability.
method Covariate Gaussian Process Latent Variable Model (c-GPLVM) for structured kernel decomposition.
result Extracts low-dimensional structures from high-dimensional data sets while explaining feature-level variability.
Paper proposes MDAT to stabilize domain alignment in label-scarce settings.
problem Stable and comprehensive domain alignment in label-scarce settings.
method Max-margin Domain-Adversarial Training (MDAT) with Adversarial Reconstruction Network (ARN).
result MDAT stabilizes gradient reversing and achieves strong robustness to hyper-parameters.
Proposes a feature leveling method to improve interpretability of deep neural networks.
problem Deep neural networks are hard to interpret due to mixed feature levels.
method Introduces a feature leveling architecture to isolate low and high level features.
result Modified models achieve competitive results and improved interpretability.
Novel model improves clinical risk prediction by transferring knowledge between tasks over time.
problem Negative transfer in multi-task learning for clinical risk prediction.
method Temporal Probabilistic Asymmetric Multi-Task Learning (TPAMTL).
result Significantly outperforms various deep learning models for time-series prediction.
Proposes a new CNN approach for multimodal biometric identification.
problem Improving biometric identification accuracy across multiple modalities.
method Uses a bank of modality-specific CNNs, fuses their outputs, and optimizes the system.
result Significantly outperforms unimodal systems and demonstrates reduction in parameters.
Study evaluates manifold alignment methods for noisy double pendulum dynamics.
problem Aligning manifolds of double pendulum dynamics under noise.
method Compared four manifold alignment methods: semi-supervised feature-level global and local.
result Local alignment methods were more robust to noise and faster.
Traditionally, multitask learning (MTL) assumes that all the tasks are related. This can lead to negative transfer when tasks are indeed incoherent. Recently, a number of approaches have been proposed that alleviate this problem by discovering the underlying task clusters or relationships. However, they are limited to …
Optimized deep learning architectures improve sensor fusion performance.
problem Sensor fusion in autonomous systems.
method Proposed two optimized architectures: coarser-grained and two-stage gated.
result Significant performance improvements and robustness in noisy conditions.
A fusion approach combines audio and video features for emotion recognition.
problem Continuous emotion recognition using both visual and auditory modalities.
method Pre-trained CNN features from video frames and minimalistic auditory descriptors. Fusion at feature or prediction level. SVR for prediction.
result Improves CCCs of 0.749 and 0.565 for arousal and valence respectively.
Paper proposes methods to reduce adversarial vulnerability in neural networks.
problem Adversarial vulnerability of deep neural networks in safety-critical applications.
method Defining vulnerability, proposing Vulnerability Suppression (VS) loss, and a Bayesian feature pruning method.
result Improves adversarial robustness and clean example performance with minimal parameter reduction.
Topology-GS improves 3D GS for better structural and feature integrity.
problem Compromised pixel-level and feature-level integrity in 3D GS.
method Incorporates Local Persistent Voronoi Interpolation (LPVI) and PersLoss based on persistent homology.
result Topology-GS outperforms existing methods in PSNR, SSIM, and LPIPS metrics.
Study uses image analysis to predict MSI status in tumors.
problem Challenges in distinguishing MSI from its counterpart.
method Interpretable pathological image analysis strategies using Haematoxylin and eosin-stained images.
result Strategies achieve decent performance in MSI prediction.
A new framework explains GNN predictions by simulating graph structure and feature changes.
problem Lack of transparency in GNN predictions hinders understanding.
method TraP2 framework using a three-layer architecture: Translation, Perturbation, and Paraphrase layers.
result TraP2 achieves 10.2% higher explanation accuracy than state-of-the-art methods.
Dictionary learning algorithms have been successfully used for both reconstructive and discriminative tasks, where an input signal is represented with a sparse linear combination of dictionary atoms. While these methods are mostly developed for single-modality scenarios, recent studies have demonstrated the advantages …
Interpreting machine learning models helps understand adversarial attacks and defenses.
problem Understanding model vulnerability to adversarial attacks.
method Model interpretation techniques to explore adversarial attacks and defenses.
result Interpretation methods can be applied to adversarial attacks and defenses.
CUBE explains models by balanced experiments and contrasts.
problem Post-hoc explanation of trained predictive models.
method Design-based framework using balanced low-high probes.
result Reveals dominant learned effect structure and clarifies query efficiency.
Uniform-in-time analysis for Stein Variational Gradient Descent across various metrics.
problem Understanding long-term behavior of finite-particle systems in relation to their mean-field limits.
method Developed uniform-in-time propagation-of-chaos results for continuous-time SVGD using cutoff strategies and finite-dimensional theories.
result Uniform-in-time propagation-of-chaos bounds in various metrics, including Langevin kernel Stein discrepancy, Wasserstein-1, and Wasserstein-2 distances.
DNDT combines neural networks and decision trees for tabular data.
problem Tabular data processing with interpretability and efficiency.
method Deep Neural Decision Trees (DNDT) using neural networks to model decision trees.
result DNDT achieves both interpretability and efficiency in tabular data processing.
New screening rules speed up Sparse-Group Lasso solving.
problem Efficiently solving Sparse-Group Lasso in high dimensions.
method Adapted safe screening rules for Sparse-Group Lasso.
result Significant speed-ups in computing time for coordinate descent.
New meta-optimizer learns from both point-based and population-based algorithms.
problem Current meta-optimizers are limited in space and unaware of uncertainty.
method Proposes a new meta-optimizer that learns in the space of both point-based and population-based algorithms, targeting a meta-loss function of cumulative regret and entropy.
result Empirical results show superior performance over existing competitors.
Transfer learning improves portfolio optimization by identifying transfer risk.
problem Financial portfolio optimization problem.
method Introduces transfer risk concept within transfer learning framework.
result Transfer risk is a significant indicator of transferability and enhances portfolio management efficiency.
Paper analyzes transfer risk in transfer learning for finance.
problem Evaluate transferability of transfer learning in finance.
method Proposes transfer risk concept and applies to stock return prediction and portfolio optimization.
result Transfer risk correlates with transfer learning performance and identifies appropriate source tasks.
This paper explores the connection between adversarial and knowledge transferability.
problem Understanding the factors affecting knowledge transferability.
method Theoretical analysis and practical metrics for adversarial transferability.
result Adversarial transferability and knowledge transferability are closely related.
The paper decomposes probabilistic scores into reliability, uncertainty, and information loss.
problem Understanding the reliability and uncertainty of probabilistic predictions.
method Developed decomposition identities for proper losses, quantifying reliability, residual uncertainty, and information gain.
result A three-term identity for classification scores, revealing miscalibration, grouping term, and feature-level uncertainty.
Mathematical framework for transfer learning feasibility and transfer risk.
problem Theoretical analysis of transfer learning.
method Reformulated transfer learning as an optimization problem, introduced transfer risk concept.
result Demonstrated the potential and benefits of incorporating transfer risk in transfer learning evaluation.
L2T learns to automatically decide what and how to transfer knowledge.
problem Optimal transfer learning algorithm selection is computationally intractable.
method L2T framework learns transfer learning skills through meta-cognitive reflection and optimizes them for new domains.
result L2T outperforms state-of-the-art transfer learning algorithms and discovers more transferable knowledge.
Hierarchical VAEs detect out-of-distribution data by identifying low-level in-distribution features.
problem Out-of-distribution data often has in-distribution low-level features, leading to misleading likelihood estimates in deep generative models.
method Developed a fast, scalable, unsupervised likelihood-ratio score for out-of-distribution detection based on hierarchical variational autoencoders.
result Achieved state-of-the-art results on out-of-distribution detection across various data and model combinations.
Improves unsupervised domain adaptation by mixing source and target domains.
problem Improves unsupervised domain adaptation by mixing source and target domains.
method Enforces training constraints across domains using mixup formulation and feature-level consistency regularizer.
result Significantly improves state-of-the-art performance on image classification and human activity recognition tasks.
Survey connects and systematizes transfer learning research.
problem Reduce dependence on target domain data for target learners.
method Systematic review of 40+ transfer learning approaches.
result Importance of choosing appropriate transfer learning models.
Enhances transfer learning with semantic reasoning for robust predictions.
problem Improving robustness of transfer learning models.
method Integrates semantic representations for better knowledge transfer.
result Demonstrated robustness in bus delay and air quality forecasting.
Transfer learning can worsen fairness, study finds.
problem Transfer learning can reduce fairness in predictions.
method Examined fairness of standard transfer and multi-task learning algorithms.
result Both standard algorithms suffer from discriminatory transfer.
Study measures impact of data and neural net similarity on transferability in restaurant sales data.
problem Identify indicators for successful transferability of neural nets across different data sets.
method Empirical study on sales data from six restaurants, calculating indicators based on data and neural net similarities.
result Negative correlations between transferability and indicators, allowing better model performance and fewer transfers.
Paper defines and mitigates negative transfer in transfer learning.
problem Negative transfer occurs when transferring knowledge from a less related source task inversely harms target performance.
method Formal definition, analysis of three aspects, adversarial networks-based technique.
result The proposed method consistently improves target performance and largely avoids negative transfer.
The paper analyzes phase transitions in transfer learning for perceptrons.
problem Understanding when transfer learning from a source task to a target task is beneficial.
method Theoretical analysis of a pair of related perceptron learning tasks.
result Reveals a phase transition from negative to positive transfer as task similarity changes.
Transfer entropy analyzes interactions between network communities, including rare events.
problem Understanding information flows between network communities.
method Transfer entropy analysis, including Rényi transfer entropy for rare events.
result Transfer entropy provides a coherent description of community interactions, including non-linear interactions.
Adaptive source selection for positive transfer in linear models improves target dataset performance.
problem Limited task-specific labeled data in business settings.
method Greedily decides from which sources and how many samples to incorporate into the target dataset using an accept/reject rule based on a data-dependent estimate of the transfer gain.
result Consistent gains over classical and recent strong baselines while avoiding negative transfer.
New research on limits of transfer learning, proving key selection and dependence requirements.
problem Insufficient theoretical foundation for transfer learning.
method Proved novel results on transfer learning, emphasizing selection of information and dependence between domains.
result Upper bound on improvement possible with transfer learning, highlighting the need for careful selection.
Proposes a transfer learning method for high-dimensional quantile regression.
problem Inadequate handling of heterogeneity and heavy tails in transfer learning.
method High-dimensional quantile regression framework with double transfer learning estimator.
result Established error bounds and valid confidence intervals for high-dimensional quantile regression coefficients.
Localized transfer learning improves nonparametric regression performance.
problem Improving nonparametric regression performance on target tasks.
method Localized transfer learning framework that models heterogeneity and partition covariate space into cells.
result Sharp minimax rates show local transfer mitigates the curse of dimensionality.
Paper bounds parameter transfer learning performance and applies it to self-taught learning.
problem Transfer learning performance bounds and self-taught learning theory.
method Introduces local stability and transfer learnability, derives a learning bound.
result First theoretical learning bound for self-taught learning.
This work transfers causal knowledge between tasks for Individual Treatment Effect estimation.
problem Estimating Individual Treatment Effects (ITE) requires a large amount of data, making it challenging.
method The authors introduce a practical framework for efficient transfer of causal knowledge between tasks, using a Causal Inference Task Affinity (CITA) measure.
result ITE knowledge transfer can significantly reduce the amount of data needed for ITE estimation.
A meta-learning approach for automatic knowledge transfer between networks.
problem Improving performance in small-data real-world problems with heterogeneous architectures and tasks.
method Meta-learning to automatically learn what knowledge to transfer and where in the target network.
result Meta-transfer approach significantly outperforms hand-crafted methods on various datasets and network architectures.
Investigates transfer learning in spatial statistics.
problem Applying transfer learning to spatial statistics.
method Simple MLP models for spatial data.
result Potential of transfer learning in spatial statistics.
Simple methods improve regression transferability estimation.
problem Estimating how well regression models transfer between tasks.
method Two simple, computationally efficient approaches based on negative regularized mean squared error.
result Significantly outperform existing methods in accuracy and efficiency.
This paper defines and quantifies transferability in domain generalization.
problem Understanding and quantifying transferability between domains.
method Formal definition and estimation of transferability, upper bound for target error.
result Many algorithms do not learn transferable features, proposing a new algorithm.
Training a source model optimally for its own task is suboptimal for downstream transfer.
problem The optimality of a source model for its own task hinders downstream transfer performance.
method Analyzes L2-SP ridge regression, characterizes transfer-optimal source penalty, and identifies alignment-dependent effects.
result Transfer benefits from stronger source regularization when aligned imperfectly, and from weaker regularization when aligned perfectly.
PTU learns fine-grained parameter transfer for deep networks.
problem Discrete transfer states and lack of principled approach to learn transfer strategies.
method PTU learns a fine-grained nonlinear combination of activations from source and target networks using two gates.
result PTU outperforms heuristic methods in most settings.