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

4348671,3011,734 · Jun 202019922001200920172026
48 results for multi task learning

In multi-task learning, multiple tasks are solved jointly, sharing inductive bias between them. Multi-task learning is inherently a multi-objective problem because different tasks may conflict, necessitating a trade-off. A common compromise is to optimize a proxy objective that minimizes a weighted linear combination o…

2018-10-10abs ↗pdf ↗

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…

2018-02-03abs ↗pdf ↗

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…

2020-01-19abs ↗pdf ↗

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…

2018-12-15abs ↗pdf ↗

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.

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 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…

2016-12-13abs ↗pdf ↗

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.

New method generates continuous Pareto sets for multi-task learning.

problem Challenges in finding optimal solutions for correlated multi-task learning problems.
method Efficiently generates locally continuous Pareto sets and fronts in multi-objective optimization problems.
result Demonstrates continuous analysis of Pareto optimal solutions in machine learning problems.

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…

2012-10-22abs ↗pdf ↗

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.

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.

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.

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.

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.

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.

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.

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.

Multi-label learning studies the problem where an instance is associated with a set of labels. By treating single-label learning problem as one task, the multi-label learning problem can be casted as solving multiple related tasks simultaneously. In this paper, we propose a novel Multi-task Gradient Descent (MGD) algor…

2019-11-18abs ↗pdf ↗

This work benchmarks MARL algorithms in cooperative tasks.

problem Lack of evaluation tasks and criteria for comparing MARL algorithms.
method Systematic evaluation of three MARL algorithm classes in diverse cooperative tasks.
result Insights into the effectiveness of different learning approaches.

Paper introduces a new model to handle multi-task learning across different input domains.

problem Learning correlated tasks across varying input domains.
method Develops a novel heterogeneous stochastic variational linear model of coregionalization (HSVLMC) for multi-task learning.
result The proposed model outperforms existing models in diverse multi-task scenarios.

Method learns graph structure for multi-task learning, revealing interpretable relationships.

problem Learning relationships among tasks in multi-task learning.
method Simultaneously learns graph structure and model parameters, optimizing the graph structure with the model parameters.
result Reduces generalization error and reveals interpretable sparse graph among tasks.

Framework for multi-task learning with semiparametric models and nuisance parameters.

problem Improving parameter estimation from diverse, heterogeneous datasets.
method Late fusion multi-task learning framework with two-step process: individual task learning followed by adaptive aggregation.
result The method achieves faster convergence rates compared to individual task learning when tasks share similar parametric components.

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.

Multi-task learning is a powerful method for solving multiple correlated tasks simultaneously. However, it is often impossible to find one single solution to optimize all the tasks, since different tasks might conflict with each other. Recently, a novel method is proposed to find one single Pareto optimal solution with…

2019-12-30abs ↗pdf ↗

MT-HAL learns features and task associations for multiple tasks with a shared sparse structure.

problem Learning features and task associations for multiple tasks with shared structure.
method Fully nonparametric approach that learns features, samples, and task associations with a shared sparse structure.
result MT-HAL achieves a powerful convergence rate and outperforms other methods across various simulation settings.

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.

Develops a new method to improve performance in multi-objective learning problems.

problem Gradient bias in multi-objective learning leading to degraded performance.
method Stochastic Multi-objective gradient Correction (MoCo) method that guarantees convergence without increasing batch size.
result Demonstrates effectiveness of MoCo method in simulations on multi-task learning.

Sharing knowledge between tasks is vital for efficient learning in a multi-task setting. However, most research so far has focused on the easier case where knowledge transfer is not harmful, i.e., where knowledge from one task cannot negatively impact the performance on another task. In contrast, we present an approach…

2019-07-05abs ↗pdf ↗

Paper tackles multi-task learning for molecular property prediction with limited data.

problem Limited labeled data for each molecular property task in drug discovery.
method Proposes SGNN-EBM method to utilize relation graph between tasks and improve multi-task learning performance.
result Empirical results show the effectiveness of SGNN-EBM.

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…

2013-06-17abs ↗pdf ↗

Study multi-task learning with low-rank representation in stochastic linear bandits.

problem Transfer learning across multiple linear bandit tasks with shared low-dimensional representation.
method Proposes a greedy policy with trace norm regularization to implicitly learn a low-rank representation without knowing the rank.
result Upper bound on multi-task regret of NdT(T+d)r\sqrt{NdT(T+d)r}, showing benefit over independent task solving.

Proposes Ada-Sit method for mortality prediction of rare diseases.

problem Data insufficiency and clinical diversity of rare diseases make mortality prediction hard.
method Initialization-sharing multi-task learning method (Ada-Sit) for fast adaptation to similar tasks.
result Experimental results show the proposed model is effective for mortality prediction of diverse rare diseases.

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.