Improved vision-language embeddings boost cross-task learning.
problem Creating general vision systems with better cross-task learning.
method Aligning image-word representations for better cross-task transfer.
result Improved inductive transfer from visual recognition to visual question answering.
New framework estimates demand responses across multiple contexts with limited price variation.
problem Estimating heterogeneous linear price-response functions across multiple contexts with limited price variation and confounding.
method Meta-learning framework that identifies conditional mean of task-specific causal demand parameters given a subset of task-specific observables.
result Improved recovery of demand responses relative to standard transfer-learning baselines.
UBMF tackles fault diagnosis in imbalanced industrial data with enhanced accuracy and adaptability.
problem Fault diagnosis challenges in imbalanced industrial data.
method Integrates four key modules: data perturbation, cross-task feature extraction, uncertainty-based filtering, and Bayesian meta-knowledge integration.
result Achieves an average improvement of 42.22% across ten diagnostic tasks.
TAWT improves cross-task learning efficiency and guarantees.
problem Improving cross-task learning efficiency and theoretical understanding.
method Target-Aware Weighted Training (TAWT) minimizing representation-based task distance.
result TAWT achieves non-asymptotic learning-theoretic guarantees and is effective in NLP tasks.
Unified scoring model improves efficiency and performance across multiple tasks.
problem Efficient and resource-efficient automated scoring for diverse tasks.
method Knowledge-distilled multi-task Mixture-of-Experts (MoE) approach.
result Comparable performance to task-specific models with significantly less storage and training resources.
Robot learns multiple tasks hierarchically by transferring knowledge.
problem Learning multiple complex tasks in open-ended environments.
method Task-oriented procedures, goal-babbling, imitation learning, active learning, intrinsic motivation.
result Robots can learn complex tasks more efficiently by transferring knowledge from simpler ones.
Study uses SABR model to create implied volatilities from sparse quotes.
problem Creating accurate implied volatility surfaces from limited market data.
method Multitask Gaussian process with SABR model embeddings and hierarchical regularization.
result Model produces more accurate volatilities than single-task methods.
Proposes a curriculum-based scheme to smooth CNN feature embeddings.
problem Distortion artifacts in early training stages of CNNs.
method Smoothes feature embedding using Gaussian kernels to control high-frequency information.
result Significant performance improvements on various vision tasks.
SARA uses similarity to learn rewards robustly and adaptively.
problem Robustness to labeler errors and adaptability to diverse feedback formats.
method Contrastive framework that learns latent representations and computes rewards as similarities.
result Strong performance on offline RL benchmarks and diverse applications.
No multi-class labels needed for multi-class classification.
problem Multi-class classification without requiring class-specific labels.
method Meta classification learning using pairwise similarity prediction.
result The method learns a multi-class classifier from binary classifier for pairwise similarity.
PPI uses proxy data to improve inference from limited labels across related tasks.
problem Statistical inference with limited labels across multiple related tasks.
method Prediction-powered inference framework that uses cross-task recalibration to improve power and accuracy.
result Cross-task recalibration can substantially reduce confidence interval widths when labels are scarce.
New method clusters tasks for deep learning to improve multi-task and few-shot learning.
problem Uncertainty and asymmetry in task similarity matrices affect clustering accuracy.
method Proposes a matrix completion technique to overcome limitations of task similarity matrices.
result The proposed algorithm can accurately recover task clusters with high probability.
ARML learns task relations to improve meta-learning efficiency.
problem Handling task heterogeneity in meta-learning.
method Automatically extracts cross-task relations and constructs a meta-knowledge graph.
result ARML outperforms state-of-the-art baselines in few-shot learning tasks.
Unified product embeddings improve cross-task performance in e-commerce.
problem Training product embeddings in isolation limits cross-task performance.
method Combining text, clickstream, and image data using denoising auto-encoders, BPR, and Siamese neural networks.
result Unified product embeddings uniformly outperform isolated embeddings across three e-commerce tasks.
MTL-NAS combines NAS with GP-MTL for task-agnostic multi-task learning.
problem Designing architectures for diverse tasks with varying priors.
method Disentangled GP-MTL networks, hierarchical feature sharing, and gradient-based search.
result General-purpose model trained once can adapt to multiple tasks.
A new multi-task learning estimator improves Gaussian graphical regression model fitting.
problem High error rate in fitting Gaussian graphical regression models due to separate node-wise lasso regressions.
method Proposes a multi-task learning estimator with cross-task group sparsity and within-task element-wise sparsity penalties, solved via an efficient augmented Lagrangian algorithm.
result Error rate improvement over separate node-wise lasso estimates, demonstrated through simulations and application to gene co-expression network study.
SPARC improves continual learning with minimal memory and computational overhead.
problem Efficient continual learning for deep neural networks.
method Combines task-specific working memories and task-agnostic semantic memory.
result Significantly reduces parameter usage (6% of full-model surrogates) while maintaining performance.
Estimates multiple connected linear regressions with refined common and individual parameters.
problem Multi-task learning in high-dimensional settings.
method Introduced an estimator for multiple connected linear regressions with refined common and individual parameters.
result Proposed an iterative estimation algorithm with geometric convergence rate and provided a high probability non-asymptotic bound for estimation error.
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.
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.
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.
The paper introduces a method to measure the benefits of incidental supervision signals.
problem Lack of a principled way to measure the benefits of various types of incidental supervision signals.
method Unified PAC-Bayesian motivated informativeness measure, PABI.
result Demonstrates PABI's effectiveness in quantifying the value added by various types of incidental signals.
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.
The paper proposes a method to estimate heterogeneous treatment effects using pretraining strategies.
problem Estimating conditional average treatment effects (CATE) in the presence of many covariates.
method The approach leverages prognostic factors that also predict treatment effect heterogeneity, using the R-learner framework.
result The proposed method improves estimation accuracy and power for detecting treatment effect heterogeneity.
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.
Transfer learning does not improve character recognition performance.
problem Improving character recognition performance using transfer learning.
method Performed experiments with varying levels of similarity between source and target tasks, transferring both parameters and features.
result No significant advantage gained by transfer learning over traditional machine learning.
AdaTrans adapts to feature and sample transfer in high-dimensional regression.
problem High-dimensional linear regression with more features than samples.
method F-AdaTrans and S-AdaTrans methods using fused-penalties and adaptive weights.
result AdaTrans achieves convergence rates close to oracle estimators and near-minimax optimal rates.
Adversarial perturbations fool wearable sensor systems, showing transferability across different systems.
problem Adversarial examples fool wearable sensor systems, showing transferability across different systems.
method Study of adversarial transferability in wearable sensor systems from four perspectives: systems, subjects, sensor body locations, and datasets.
result Strong untargeted transferability in most cases, targeted attacks less successful.
Paper tackles continuous transfer learning with evolving target domains.
problem Challenges of negative transfer in evolving target domains.
method Proposes label-informed C-divergence for measuring distribution shift and negative transfer.
result Demonstrates effectiveness of TransLATE framework in minimizing classification error and C-divergence.