Paper tackles ASC with coarse-to-fine task transfer for AT-level sentiment classification.
problem Small AT-level corpora and limited data for fine-grained AT task.
method Coarse-to-fine task transfer using MGAN with Coarse2Fine attention and contrastive feature alignment.
result MGAN improves ASC performance on AT-level sentiment classification.
Improves few-shot learning for hierarchical data using hyperbolic space.
problem Few-shot class-incremental learning for hierarchical data.
method Contrastive learning in hyperbolic space, Poincaré ball model, hyperbolic contrastive loss, maximum entropy distribution.
result Effective improvement of coarse and fine class accuracies in few-shot conditions.
Many practical techniques for probabilistic inference require a sequence of distributions that interpolate between a tractable distribution and an intractable distribution of interest. Usually, the sequences used are simple, e.g., based on geometric averages between distributions. When models are expressed as probabili…
This work improves interpretability in deep learning models by introducing a two-level concept discovery framework.
problem High complexity and lack of interpretability in deep learning models, especially for safety-critical tasks.
method Concept Bottleneck Models (CBMs) framework combining vision-language models and data-driven coarse-to-fine concept selection.
result The proposed framework outperforms recent CBM approaches and provides a principled interpretability.
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.
MuSiCNet tackles irregularly sampled multivariate time series by treating them as a hierarchy of relatively regular series.
problem Irregularly sampled multivariate time series with missing values.
method Gradual coarse-to-fine approach with multi-scale and multi-correlation attention network.
result MuSiCNet improves ISMTS representation quality through hierarchical learning.
GSR optimizes tasks in scientific workflows, improving performance across diverse applications.
problem Uncertainty in task selection and evaluation in scientific workflow optimization.
method Generate-Select-Refine (GSR) framework that alternates between task generation and optimization.
result GSR outperforms existing LLM-based optimizers in various scientific applications.
LEAK learns from mistakes to improve point cloud segmentation.
problem Improving point cloud semantic segmentation performance.
method Coarse-to-fine clustering, class-conditional prototypical feature alignment, fairness weighting.
result State-of-the-art performances on different architectures, datasets, and tasks.
Paper tackles cross-granularity few-shot learning with meta-embedder.
problem Few-shot learning with coarse labels and fine-grained testing.
method Meta-embedder that optimizes visual and semantic discrimination across coarse and fine classes.
result Meta-embedder achieves effective cross-granularity few-shot classification.
Identifying dependency in multivariate data is a common inference task that arises in numerous applications. However, existing nonparametric independence tests typically require computation that scales at least quadratically with the sample size, making it difficult to apply them to massive data. Moreover, resampling i…
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.
Defines related tasks for transfer learning using foliations.
problem Lack of a foundational description of related tasks in transfer learning.
method Introduces foliations as a mathematical framework for relatedness between tasks.
result Identifies foliations as a way to represent relatedness in transfer learning.
Estimates task difficulty and transferability without trained models.
problem Estimating the difficulty and transferability of supervised classification tasks.
method Information theoretic approach using conditional entropy between training labels.
result Hardness and transferability estimates correlate with empirical values.
Double descent in transfer learning explained for linear regression problems.
problem Understanding generalization errors in transferring parameters between overparameterized linear regression tasks.
method Analytical characterization of generalization error in terms of transfer learning factors.
result Generalization error follows a two-dimensional double descent trend controlled by transfer learning factors.
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.
New algorithms improve multi-task bandit performance by transferring reward samples.
problem Sequential multi-task bandit problems with adjacent similar tasks.
method Two UCB-based algorithms that transfer reward samples between tasks.
result Transfer of reward samples reduces overall regret compared to no transfer.
Contextual bandit learning is an increasingly popular approach to optimizing recommender systems via user feedback, but can be slow to converge in practice due to the need for exploring a large feature space. In this paper, we propose a coarse-to-fine hierarchical approach for encoding prior knowledge that drastically …
Anti-transfer learning prevents misleading representations for speech tasks.
problem Misleading representations learned from orthogonal tasks in speech processing.
method Penalizes similarity between activations of a network and another trained on an orthogonal task.
result Improves classification accuracy and invariance to the orthogonal task.
Study shows how deep network representations can be transferred between datasets and tasks.
problem Transferability of deep network representations across datasets and tasks.
method Examined layer-wise transferability of representations in deep networks across multiple datasets and tasks.
result Interesting empirical observations on layer-wise transferability of representations.
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.
This paper tackles negative transfer in multi-task learning by introducing class-wise weights.
problem Negative transfer hampers function from achieving optimality in multi-task learning.
method Introduces class-wise weights to drive positive transfer and suppress negative transfer.
result Demonstrates improved performance in multi-task learning by reducing negative transfer.
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.
Develops a method for manifold learning with small sample size datasets.
problem Improving manifold learning performance for multiple tasks with limited samples.
method Uses instance and model transfer to integrate manifold models from similar tasks.
result Successfully estimates manifolds with tiny sample sizes across multiple tasks.
We observe standard transfer learning can improve prediction accuracies of target tasks at the cost of lowering their prediction fairness -- a phenomenon we named discriminatory transfer. We examine prediction fairness of a standard hypothesis transfer algorithm and a standard multi-task learning algorithm, and show th…
New unsupervised transfer learning method for spatiotemporal tasks.
problem Transfer knowledge from unsupervised models to new predictive tasks.
method Differentiable framework with Transferable Memory Unit (TMU).
result Significant improvements on spatiotemporal prediction benchmarks.
Many tasks in natural language understanding require learning relationships between two sequences for various tasks such as natural language inference, paraphrasing and entailment. These aforementioned tasks are similar in nature, yet they are often modeled individually. Knowledge transfer can be effective for closely …
We reduce the computational cost of Neural AutoML with transfer learning. AutoML relieves human effort by automating the design of ML algorithms. Neural AutoML has become popular for the design of deep learning architectures, however, this method has a high computation cost. To address this we propose Transfer Neural A…
Learning from prior tasks and transferring that experience to improve future performance is critical for building lifelong learning agents. Although results in supervised and reinforcement learning show that transfer may significantly improve the learning performance, most of the literature on transfer is focused on ba…
A simple approach improves performance on both past and future tasks in lifelong learning.
problem Forgetting in lifelong learning, where performance on past tasks degrades when learning new tasks.
method Representation ensembling to improve performance on both future and past tasks.
result Representation ensembling demonstrates both forward and backward transfer across various datasets.
New approach for multi-task reinforcement learning without task interference.
problem Efficient knowledge sharing between tasks in reinforcement learning.
method Attention-based multi-task deep reinforcement learning.
result Achieves positive knowledge transfer and avoids negative transfer.
Improved transfer learning with expert models, reducing compute and speeding up performance.
problem Improving sample efficiency and reducing computational requirements for new tasks.
method Training a diverse set of experts using existing label structures and performance proxies to select the relevant expert for each target task.
result Significant speed-up of 2-3 orders of magnitude compared to competing approaches.
Q-learning is one of the most popular methods in Reinforcement Learning (RL). Transfer Learning aims to utilize the learned knowledge from source tasks to help new tasks to improve the sample complexity of the new tasks. Considering that data collection in RL is both more time and cost consuming and Q-learning converge…
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.
Modern deep transfer learning approaches have mainly focused on learning generic feature vectors from one task that are transferable to other tasks, such as word embeddings in language and pretrained convolutional features in vision. However, these approaches usually transfer unary features and largely ignore more stru…
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.
Method selects task-specific neurons for unsupervised transfer learning.
problem Challenges in fine-tuning large language models for specific tasks.
method Selects important neurons for a specific classification task and extends to multi-source transfer learning.
result Higher similarity between task-specific fingerprints leads to better transferability.
New model generates images by reversing heat equation, revealing disentanglement.
problem Image generation without considering image structure.
method Stochastically reverses the heat equation to generate images, using variational approximation.
result Emergent disentanglement of overall colour and shape in images.
PAC-Net prunes deep models for better transfer learning.
problem Improving transfer learning with over-parameterized models.
method Prune, Allocate, Calibrate (PAC) approach.
result PAC-Net achieves state-of-the-art performance in inductive transfer learning.
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.
New insights into continual learning with task similarity.
problem Challenges in learning similar tasks without interference.
method Linear teacher-student model with latent structure.
result High input feature similarity with low readout similarity is catastrophic.
Leap framework transfers knowledge across learning processes for improved performance.
problem Transfer learning struggles with new tasks not linked to previous tasks.
method Leap framework associates each task with a manifold and minimizes the expected path length during training.
result Leap outperforms competing methods in meta-learning and transfer learning.
Study on neural networks' performance in sequential task learning.
problem Understanding the performance of neural networks in sequential task learning.
method Theoretical analysis of generalization performance in continual learning using statistical mechanical analysis of kernel ridge-less regression.
result Characteristic transitions from positive to negative transfer observed in neural networks.
Enhances generative model accuracy through knowledge transfer.
problem Improving generative model precision across different tasks.
method Introduces a novel framework for transfer learning using shared structures.
result Demonstrates enhanced performance in diffusion and normalizing flows models.
New attention mechanism improves meta-transfer learning in dynamic tasks.
problem Underfitting in meta-transfer learning with dynamic tasks.
method Proposed Recurrent Memory Reconstruction (RMR) attention mechanism.
result ASNP-RMR significantly outperforms baselines in various tasks.
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.
New theory explains when pre-trained models can improve downstream tasks.
problem Lack of theoretical understanding of task similarity for transfer learning.
method Feature-centric viewpoint, theoretical results on transferability phase diagram.
result Transfer learning outperforms training from scratch when target task is well represented in feature space.
Transfer learning offers little benefit in medical imaging tasks.
problem Understanding transfer learning's impact on medical imaging tasks.
method Evaluation of transfer learning on two large-scale medical imaging tasks.
result Simple, lightweight models perform comparably to ImageNet architectures.
Paper proposes a transfer learning method for learning with label proportions that handles uncertain data.
problem Learning with label proportions (LLP) for uncertain data.
method Transfer learning approach to transfer knowledge from source to target tasks with uncertain data.
result The proposed TL-LLP method achieves better accuracy and is less sensitive to noise.