While deep learning and deep reinforcement learning (RL) systems have demonstrated impressive results in domains such as image classification, game playing, and robotic control, data efficiency remains a major challenge. Multi-task learning has emerged as a promising approach for sharing structure across multiple tasks…
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,694 papers · 148 categories
Trend · papers per month
48 results for “conditional multi-task learning”
Improved NLP performance with fewer parameters and less data using conditional multi-task learning.
problem Challenges in transferring knowledge across different NLP tasks, including overfitting, forgetting, and negative transfer.
method Proposes a novel Transformer architecture with conditional attention and task-conditioned modules for efficient parameter sharing and mitigating forgetting.
result Achieves state-of-the-art performance on 26 NLP tasks with 66% less data and 50% fewer parameters compared to existing methods.
A new framework enables real-time task trade-off control.
problem Conflict between multiple related tasks in a fixed model capacity.
method Formulates MTL as a preference-conditioned multiobjective optimization problem; uses a hypernetwork-based neural network.
result A single model can handle different trade-off preferences among multiple tasks.
Extends neural diffusion processes for multi-task regression.
problem Limited to single-task inference, existing formulations cannot capture dependencies across related tasks.
method Introduces a task encoder to condition diffusion model on low-dimensional representations of context observations.
result Improves predictive performance and uncertainty calibration across related functions.
We present a framework to derive risk bounds for vector-valued learning with a broad class of feature maps and loss functions. Multi-task learning and one-vs-all multi-category learning are treated as examples. We discuss in detail vector-valued functions with one hidden layer, and demonstrate that the conditions under…
CondMTL improves toxicity detection by learning group-specific representations.
problem Algorithmic bias in toxic language detection across demographic groups.
method Conditional Multi-Task Learning (CondMTL) for demographic-specific tasks.
result CondMTL improves predictive recall for minority demographic groups.
This work shows how disentangled and sparse representations improve multi-task learning.
problem Improving generalization in multi-task learning with disentangled and sparse representations.
method Proved a new identifiability result and proposed a practical approach using sparsity-promoting bi-level optimization.
result Maximally sparse base-predictors yield disentangled representations under certain conditions.
The goal of this paper is to design image classification systems that, after an initial multi-task training phase, can automatically adapt to new tasks encountered at test time. We introduce a conditional neural process based approach to the multi-task classification setting for this purpose, and establish connections …
We sharply characterize the performance of different penalization schemes for the problem of selecting the relevant variables in the multi-task setting. Previous work focuses on the regression problem where conditions on the design matrix complicate the analysis. A clearer and simpler picture emerges by studying the No…
In multi-task learning, difficulty levels of different tasks are varying. There are many works to handle this situation and we classify them into five categories, including the direct sum approach, the weighted sum approach, the maximum approach, the curriculum learning approach, and the multi-objective optimization ap…
We study the problem of estimating multiple linear regression equations for the purpose of both prediction and variable selection. Following recent work on multi-task learning Argyriou et al. [2008], we assume that the regression vectors share the same sparsity pattern. This means that the set of relevant predictor var…
Small parameterized towers improve multi-task learning efficiency and generalization.
problem Balancing Pareto efficiency and generalization in multi-task learning.
method Under-parameterized self-auxiliaries for multi-task models.
result Small parameterized towers enhance Pareto efficiency in various multi-task applications.
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.
Reliable and effective multi-task learning is a prerequisite for the development of robotic agents that can quickly learn to accomplish related, everyday tasks. However, in the reinforcement learning domain, multi-task learning has not exhibited the same level of success as in other domains, such as computer vision. In…
TOPPO improves PPO for MTRL by balancing critic gradients, outperforming SAC.
problem Critic-side gradient ill-conditioning in PPO for MTRL.
method Critic Balancing modules to improve gradient conditioning and balance task updates.
result TOPPO achieves stronger mean and tail-task performance than SAC-family and ARS-family baselines.
Agents solving multi-task classification learn disentangled representations.
problem Creating interpretable world models from multi-task data.
method Optimal multi-task classification tasks, noise, evidence accumulation.
result Disentangled representations emerge in multi-task learning.
Multi-task learning uses auxiliary data or knowledge from relevant tasks to facilitate the learning in a new task. Multi-task optimization applies multi-task learning to optimization to study how to effectively and efficiently tackle multiple optimization problems simultaneously. Evolutionary multi-tasking, or multi-fa…
Disentangled representations naturally emerge in multi-task learning.
problem Finding adaptable representations for multiple tasks.
method Empirical study of neural networks trained on automatically generated supervised tasks.
result Disentanglement naturally occurs during multi-task learning.
Selective inference improves multi-task neuroimaging analysis.
problem Improving predictive performance and modeling accuracy in neuroimaging studies.
method Proposes a framework for selective inference to jointly identify relevant covariates and conduct valid inference in a sparsity-inducing model.
result Selective inference yields tighter confidence intervals and more accurate signal recovery than single-task methods.
We consider a problem of learning kernels for use in SVM classification in the multi-task and lifelong scenarios and provide generalization bounds on the error of a large margin classifier. Our results show that, under mild conditions on the family of kernels used for learning, solving several related tasks simultaneou…
SMART transfers knowledge across related studies for multi-task learning.
problem Deterioration of multi-task learning performance with small target sample size.
method SMART assumes spectral similarity between source and target models, estimating target coefficients through structured regularization.
result SMART achieves near-minimax error rates, improving estimation accuracy and robustness to negative transfer.
Survey on multi-task learning for deep neural networks.
problem Simultaneous learning of multiple tasks by a shared model.
method Partitioning deep MTL techniques into architectures, optimization methods, and task relationship learning.
result Improved data efficiency and reduced overfitting through shared representations.
Wide neural networks can benefit from multi-task learning in their infinite-width limit.
problem The generalization behavior of wide neural networks in multi-task learning settings.
method Optimizing wide ReLU neural networks with L2-regularization promotes multi-task learning in the infinite-width limit.
result An exact quantitative characterization of multi-task learning in the infinite-width limit of wide ReLU neural networks.
Cellular network configuration plays a critical role in network performance. In current practice, network configuration depends heavily on field experience of engineers and often remains static for a long period of time. This practice is far from optimal. To address this limitation, online-learning-based approaches hav…
From Low Intrinsic Dimensionality to Non-Vacuous Generalization Bounds in Deep Multi-Task Learningcs.LG
Deep multi-task learning benefits from low intrinsic dimensionality, leading to better generalization.
problem Improving generalization in deep multi-task learning with high-dimensional models.
method Parametrizing multi-task networks in a low-dimensional space using random expansions and weight compression.
result First non-vacuous generalization bounds for deep multi-task networks are derived.
Near-optimal rates for multi-task learning with shared representations.
problem Approximation and statistical complexity of learning multiple operators.
method Multiple Neural Operators (MNO) architecture and comparison with DeepONet.
result Near-optimal upper and lower bounds for approximation and generalization.
Improves shared encoder representations for better multi-task learning performance.
problem Improving quality of shared encoder representations in multi-task learning.
method Dummy Gradient norm Regularization (DGR) to decrease gradient norm of dummy task-specific predictors.
result DGR improves multi-task prediction performances and superior performance compared to existing methods.
A new framework integrates classification and regression tasks in multi-task learning.
problem Jointly solving classification and regression tasks in multi-task scenarios.
method Two-Stage Learning-to-Defer (L2D) framework with a unified deferral mechanism.
result Unified deferral mechanism ensures convergence to the Bayes-optimal rejector.
We study the stability properties of nonlinear multi-task regression in reproducing Hilbert spaces with operator-valued kernels. Such kernels, a.k.a. multi-task kernels, are appropriate for learning prob- lems with nonscalar outputs like multi-task learning and structured out- put prediction. We show that multi-task ke…
SON-GOKU uses graph coloring to improve multi-task learning by partitioning tasks into compatible groups.
problem Gradient interference between conflicting multi-task learning objectives slows convergence and model performance.
method SON-GOKU computes gradient interference, constructs an interference graph, and applies greedy graph-coloring to partition tasks.
result SON-GOKU consistently outperforms baselines and state-of-the-art multi-task optimizers on six datasets.
New method learns multiple reward functions for complex tasks.
problem Learning reward functions for tasks with multiple ways of solving.
method Combines maximum entropy approach with Dirichlet process clustering.
result Method accurately learns reward functions for complex tasks.
Research explores the trade-off between multi-task learning and multitasking in deep neural networks.
problem Trade-off between multi-task learning and multitasking in deep neural networks.
method Meta-learning algorithm to manage the trade-off between shared and separated representations.
result Agent successfully optimizes training strategy based on environment.
Multi-task learning is a learning paradigm which seeks to improve the generalization performance of a learning task with the help of some other related tasks. In this paper, we propose a regularization formulation for learning the relationships between tasks in multi-task learning. This formulation can be viewed as a n…
Bayesian approach improves network lasso for multi-task learning.
problem Improving the determination of relational coefficients in network lasso.
method Proposes a Bayesian approach to solve multi-task learning problems using network lasso.
result Objective determination of relational coefficients through Bayesian estimation.
Analysing Multi-Task Regression via Random Matrix Theory with Application to Time Series Forecastingstat.ML
The paper uses random matrix theory for multi-task regression, improving time series forecasting.
problem Improving time series forecasting using multi-task regression.
method Applying random matrix theory to multi-task regression problems, deriving closed-form solutions for optimization.
result Provides a robust foundation for hyperparameter optimization in multi-task regression scenarios.
Multi-task learning aims to learn multiple tasks jointly by exploiting their relatedness to improve the generalization performance for each task. Traditionally, to perform multi-task learning, one needs to centralize data from all the tasks to a single machine. However, in many real-world applications, data of differen…
Develops a method for fairness in multi-task learning using Wasserstein barycenters.
problem Extending fairness to multi-task learning with shared representations.
method Definition of Strong Demographic Parity extended to multi-task learning using multi-marginal Wasserstein barycenters. Closed form solution for optimal fair predictor.
result Empirical results show practical value of post-processing methodology in promoting fair decision-making.
Multi-task sparse feature learning aims to improve the generalization performance by exploiting the shared features among tasks. It has been successfully applied to many applications including computer vision and biomedical informatics. Most of the existing multi-task sparse feature learning algorithms are formulated a…
Flexible multi-task learning framework using summary statistics.
problem Data-sharing constraints in healthcare settings.
method Proposes a flexible multi-task learning framework utilizing summary statistics and adaptive parameter selection.
result Systematic non-asymptotic analysis and simulations demonstrate the method's performance.
This paper investigates multi-task reinforcement learning in non-Markovian decision making, showing benefits in sample efficiency.
problem Investigating multi-task reinforcement learning in non-Markovian decision making processes.
method Developed a joint model class for tasks and used the -bracketing number to quantify complexity and similarity.
result Multi-task reinforcement learning can improve sample efficiency in non-Markovian decision making processes.
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.
DeepDIVE disentangles input into marginal and conditional distributions for multi-task learning.
problem Challenges in multi-task learning due to conflicting objectives.
method Inspired by probability theory, DeepDIVE uses a variational autoencoder with disentangled features and cross-attention mechanism.
result DeepDIVE disentangles input and improves forecast accuracy compared to baseline models.
This paper reviews dMTL and methods for selecting auxiliary tasks.
problem Improving model performance for multiple tasks.
method Review of dMTL approaches and methods for selecting auxiliary tasks.
result Methods for selecting auxiliary tasks can improve dMTL performance.
This paper proposes a method to reveal task relationships in multi-task learning models using sparse graphs.
problem Understanding the underlying task relationships in multi-task learning models.
method Proposes a bilevel formulation of multi-task learning that induces sparse graphs.
result The method improves interpretability of multi-task learning models without sacrificing generalization performance.
Paper estimates noise covariance in correlated multi-task linear models.
problem Estimating noise covariance in multi-task high-dimensional linear models with correlated noise.
method Uses multi-task elastic-net and lasso estimators to estimate noise covariance, correcting bias in squared residual matrix.
result Develops a novel estimator of noise covariance that converges at rate , matching oracle estimator under suitable conditions.
Algorithm learns which weights to share in deep multi-task learning.
problem Difficulty in deciding which weights to share between tasks in deep learning models.
method Combines natural evolution strategy and stochastic gradient descent to learn optimal weight sharing.
result Task-specific networks achieve lower test errors than existing methods on multi-task learning datasets.
Exploration in multi-task reinforcement learning is critical in training agents to deduce the underlying MDP. Many of the existing exploration frameworks such as , , Thompson sampling assume a single stationary MDP and are not suitable for system identification in the multi-task setting. We present a nove…
Proposes a transductive matrix completion method with calibration for multi-task learning.
problem Improving multi-task learning with multiple related data sources.
method Transductive matrix completion with calibration constraint.
result The proposed algorithm recovers incomplete feature and target matrices with improved results.