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.

169,051 papers · 148 categories

Trend · papers per month

3917831,1741,565 · Jun 202019922001200920172026
48 results for sequential multitask learning

Framework uses experience replay to prevent deep networks from forgetting past tasks.

problem Deep networks forget past tasks after learning new ones in sequential multitask learning.
method Generative model that couples current task with past learned tasks through a discriminative embedding space.
result Framework learns a shared abstract distribution across all tasks, preventing catastrophic forgetting.

Multitask learning has shown promising performance in many applications and many multitask models have been proposed. In order to identify an effective multitask model for a given multitask problem, we propose a learning framework called learning to multitask (L2MT). To achieve the goal, L2MT exploits historical multit…

2018-05-19abs ↗pdf ↗

Deep learning methods such as multitask neural networks have recently been applied to ligand-based virtual screening and other drug discovery applications. Using a set of industrial ADMET datasets, we compare neural networks to standard baseline models and analyze multitask learning effects with both random cross-valid…

2016-06-28abs ↗pdf ↗

This paper presents a new multitask learning framework that learns a shared representation among the tasks, incorporating both task and feature clusters. The jointly-induced clusters yield a shared latent subspace where task relationships are learned more effectively and more generally than in state-of-the-art multitas…

2017-03-03abs ↗pdf ↗

MSOL learns hierarchical policies for multitask tasks with soft options.

problem Training hierarchical policies for multiple tasks with stability and flexibility.
method MSOL uses separate variational posteriors for each task, regularized by a shared prior, to avoid instabilities and fine-tune options for new tasks.
result MSOL significantly outperforms hierarchical and flat transfer-learning baselines.

Proposes a method to balance tasks in multitask learning with a single gradient step update.

problem Balancing tasks in multitask learning to avoid imbalance.
method Gradient-based meta-learning to balance tasks at the gradient level, training shared and task-specific layers separately.
result Achieves state-of-the-art performance on various multitask computer vision problems.

We discuss a general method to learn data representations from multiple tasks. We provide a justification for this method in both settings of multitask learning and learning-to-learn. The method is illustrated in detail in the special case of linear feature learning. Conditions on the theoretical advantage offered by m…

2015-05-23abs ↗pdf ↗

Paper proposes a method to identify negative transfers in multitask learning using surrogate models.

problem Identifying subsets of source tasks that improve target task performance in multitask learning.
method Surrogate modeling to precompute multitask learning performances and approximate them with a linear regression model.
result The approach predicts negative transfers from multiple source tasks to target tasks more accurately than existing methods.

This paper introduces self-paced task selection to multitask learning, where instances from more closely related tasks are selected in a progression of easier-to-harder tasks, to emulate an effective human education strategy, but applied to multitask machine learning. We develop the mathematical foundation for the appr…

2017-03-02abs ↗pdf ↗

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.

Establishes connection between MTDNN and multitask GP, revealing weight correlation as key to task sharing.

problem Limited theoretical understanding of information sharing in MTDNN.
method Derives multitask GP kernels for MTDNN and MTBNN, showing shared hyper-parameters and last layer weights.
result Information sharing in MTDNN is due to weight correlation, not intermediate layer weights.

The study calculates the risk of semi-supervised multitask learning on Gaussian mixtures.

problem Understanding the risk in semi-supervised multitask learning on Gaussian mixtures.
method Statistical physics methods applied to Gaussian mixture models.
result The study evaluates the performance gain of learning tasks together versus separately.

We learn multiple hypotheses for related tasks under a latent hierarchical relationship between tasks. We exploit the intuition that for domain adaptation, we wish to share classifier structure, but for multitask learning, we wish to share covariance structure. Our hierarchical model is seen to subsume several previous…

2014-08-09abs ↗pdf ↗

New algorithm improves multitask learning across diverse agents.

problem Performance degradation in decentralized learning with heterogeneous objectives.
method Developed an exact subspace diffusion algorithm for multitask learning over networks.
result The algorithm outperforms alternatives in noisy gradient approximations.

Massively multitask neural architectures provide a learning framework for drug discovery that synthesizes information from many distinct biological sources. To train these architectures at scale, we gather large amounts of data from public sources to create a dataset of nearly 40 million measurements across more than 2…

2015-02-06abs ↗pdf ↗

This paper proposes a new multitask learning method to better measure task relationships.

problem Learning multiple tasks independently loses information about task relationships.
method Jointly learns shared parameters and shared feature representations through a new strategy.
result The proposed method better measures task relationships and optimizes shared parameters.

Improved audio classification with limited labels using multitask and self-supervised learning.

problem Limited labeled data for audio classification.
method Multitask learning and self-supervised learning on unlabeled data.
result Significant improvement in performance (up to 6%) through multitask and self-supervised learning.

New algorithm REFUEL shows multitask representation learning is more sample-efficient in RL.

problem Understanding the benefit of representation learning in reinforcement learning.
method Developed REFUEL algorithm for multitask low-rank RL, analyzing both upstream and downstream tasks.
result Multitask representation learning is provably more sample-efficient than individual task learning.

The paper provides a theoretical framework for learning task similarity in multitask learning.

problem Understanding and leveraging task similarities for improving multitask learning performance.
method The paper derives theoretical bounds on multitask learning generalization error, and proposes a new training algorithm to learn task relation coefficients and neural network parameters.
result The proposed algorithm outperforms baselines and reaffirms the benefits of theoretical insight in algorithm design.

Analyzes how multitask learning improves deep neural networks' generalization.

problem Understanding how multitask learning enhances deep neural networks' generalization.
method Developed an analytic theory using statistical physics techniques for classification tasks.
result Multitask learning benefits from task alignment and noise characteristics.

Paper introduces multitask neural networks for efficient stochastic control problems.

problem Infeasibility of simulating state variables in some stochastic control problems.
method Multitask neural networks with dynamic task balancing.
result Multitask neural networks outperform state-of-the-art approaches in derivatives pricing problems.

Multitask Gaussian process regression reduces data generation costs for molecular property prediction.

problem Data bottleneck in training surrogate models for molecular properties.
method Multitask Gaussian process regression over heterogeneous data sources (CC and DFT).
result Predicts at CC-level accuracy with over an order of magnitude reduction in data generation cost.

Unified multitask learning framework for mixed-type outcomes.

problem Difficulty in formulating a unified objective for tasks with different outcomes.
method Multitask transformation framework with shared sparsity, using deep neural networks and rank-based optimization.
result Improved prediction and variable selection across continuous, binary, and mixed outcomes.

The study analyzes implicit biases in neural networks using backward error analysis.

problem Analyzing implicit biases in multitask and continual learning settings.
method Backward error analysis to compute implicit training biases, deriving modified losses with three terms.
result The conflict term, measuring gradient alignment, is a new quantity in continual learning.

A new multitask model using Hopfield Networks improves classification performance.

problem Improving classification models by sharing information across multiple tasks.
method Developed a transductive semi-supervised parametric Hopfield Network (HoMTask) that minimizes an energy function for all tasks.
result HoMTask achieves competitive performance compared to state-of-the-art semi-supervised graph-based algorithms.

Optimal multitask learning method for sparse heterogeneous datasets.

problem Efficiently learning from multiple related datasets with sparse task-specific differences.
method MOLAR estimator, combining weighted median and shrinkage.
result Improves estimation error dependence on data dimension compared to task-wise least squares.

A new approach simplifies multitask Gaussian processes without rank approximations.

problem Handling multioutput regression problems with conditionally dependent tasks.
method Introduces a novel approach to reduce multitask learning to univariate GPs, eliminating the need for rank approximations.
result Accurately recovers multitask covariance and noise matrices with fewer parameters, improving performance and reducing overfitting risk.

Scalable GP model handles functional covariates and multitasks.

problem Uncertainty quantification in complex mechanical systems with time-dependent inputs.
method Introduced a fully separable kernel structure for functional covariates and multitask problems, leveraging Kronecker structure for scalability.
result The model significantly improves over single task GPs, requiring fewer samples for accurate predictions.

Fundamental frequency (f0) estimation from polyphonic music includes the tasks of multiple-f0, melody, vocal, and bass line estimation. Historically these problems have been approached separately, and only recently, using learning-based approaches. We present a multitask deep learning architecture that jointly estimate…

2018-09-02abs ↗pdf ↗

Automated protein function prediction is a challenging problem with distinctive features, such as the hierarchical organization of protein functions and the scarcity of annotated proteins for most biological functions. We propose a multitask learning algorithm addressing both issues. Unlike standard multitask algorithm…

2016-11-03abs ↗pdf ↗

We investigate the use of sparse coding and dictionary learning in the context of multitask and transfer learning. The central assumption of our learning method is that the tasks parameters are well approximated by sparse linear combinations of the atoms of a dictionary on a high or infinite dimensional space. This ass…

2012-09-04abs ↗pdf ↗

Estimates shared parameters across related learning problems using robust statistics and LASSO.

problem Simultaneously learning related but heterogeneous problems like store demand or patient risk.
method Two-stage multitask learning estimator combining robust statistics and LASSO regression.
result Improved sample complexity bounds for multitask learning, especially beneficial for 'data-poor' instances.

The paper improves Gaussian processes by adding sum constraints, enhancing prediction accuracy.

problem Improving Gaussian process predictions with background knowledge constraints.
method Conditioning the prior distribution on sum constraints to ensure fulfillment of linear and nonlinear constraints.
result The approach fulfills constraints with high precision and improves prediction accuracy.

We propose Deep Asymmetric Multitask Feature Learning (Deep-AMTFL) which can learn deep representations shared across multiple tasks while effectively preventing negative transfer that may happen in the feature sharing process. Specifically, we introduce an asymmetric autoencoder term that allows reliable predictors fo…

2017-08-01abs ↗pdf ↗