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

189378566755 · Jun 202019922001200920172026
48 results for single task

Paper tackles continual learning with single-index models, proving regret bounds.

problem Continual learning with single-index models across multiple tasks.
method Proposes a randomized strategy to learn a common single-index and task-specific link functions.
result Proves regret bounds for the proposed strategy under various loss function assumptions.

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.

We study a recent model of collaborative PAC learning where kk players with kk different tasks collaborate to learn a single classifier that works for all tasks. Previous work showed that when there is a classifier that has very small error on all tasks, there is a collaborative algorithm that finds a single classifi…

2018-05-22abs ↗pdf ↗

Aux-NAS uses auxiliary labels to improve primary task performance without extra inference cost.

problem Improving primary task performance using auxiliary labels without increasing inference cost.
method Architecture-based approach with a flexible asymmetric structure for primary and auxiliary tasks, using Neural Architecture Search (NAS) to evolve networks with only primary-to-auxiliary connections.
result Achieves improved performance on multiple tasks without increasing inference cost.

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 present a multi-task learning approach to jointly estimate the means of multiple independent data sets. The proposed multi-task averaging (MTA) algorithm results in a convex combination of the single-task maximum likelihood estimates. We derive the optimal minimum risk estimator and the minimax estimator, and show t…

2011-07-21abs ↗pdf ↗

AuxiLearn combines auxiliary tasks into a single loss function.

problem Improving neural network performance on a main task using auxiliary tasks.
method Implicit differentiation to learn a network that combines auxiliary tasks into a single coherent objective function.
result AuxiLearn consistently outperforms competing methods in various tasks and domains.

It was recently shown that architectural, regularization and rehearsal strategies can be used to train deep models sequentially on a number of disjoint tasks without forgetting previously acquired knowledge. However, these strategies are still unsatisfactory if the tasks are not disjoint but constitute a single increme…

2018-06-22abs ↗pdf ↗

The paper tackles learning from similar but not identical linear representations, improving performance over single-task learning.

problem Understanding how to learn from tasks with similar but not exactly the same linear representations, especially when dealing with outlier tasks.
method Proposes adaptive and robust penalized empirical risk minimization and spectral methods.
result Both methods outperform single-task learning when representations are similar and perform at least as well otherwise, with minimax optimality demonstrated.

The reinforcement learning community has made great strides in designing algorithms capable of exceeding human performance on specific tasks. These algorithms are mostly trained one task at the time, each new task requiring to train a brand new agent instance. This means the learning algorithm is general, but each solu…

2018-09-12abs ↗pdf ↗

Learning policies that generalize across multiple tasks is an important and challenging research topic in reinforcement learning and robotics. Training individual policies for every single potential task is often impractical, especially for continuous task variations, requiring more principled approaches to share and t…

2013-07-02abs ↗pdf ↗

Transformer attention layers solve single-location regression tasks.

problem Understanding token-wise sparsity and internal linear representations in attention-based models.
method Introduce single-location regression task and a simplified predictor based on self-attention layers.
result Transformer attention layers are asymptotically Bayes optimal and can learn underlying structures effectively.

Single neural network learns multiple tasks from combined data.

problem Can a single neural network learn multiple unrelated tasks?
method Investigates how task representations affect joint learning; uses various task encoding methods.
result Single neural network can learn multiple tasks from combined data, even when tasks are unrelated and different.

ES-Single uses ES to estimate gradients in unrolled graphs, reducing variance and improving performance.

problem Estimating gradients in unrolled computation graphs with low variance and stability.
method Evolution strategies (ES) applied to unrolled graphs, with a single perturbation per particle.
result ES-Single reduces variance compared to PES, leading to better performance in various tasks.

Transferring knowledge across a sequence of reinforcement-learning tasks is challenging, and has a number of important applications. Though there is encouraging empirical evidence that transfer can improve performance in subsequent reinforcement-learning tasks, there has been very little theoretical analysis. In this p…

2013-09-26abs ↗pdf ↗

Neural network tackles continual learning with neuromodulation and local error signals.

problem Catastrophic forgetting in continuous learning.
method Biologically-inspired neural architecture with local learning and neuromodulation, combined with transfer metalearning.
result Superior performance in continual learning tasks compared to other approaches.

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.

We propose minimum regret search (MRS), a novel acquisition function for Bayesian optimization. MRS bears similarities with information-theoretic approaches such as entropy search (ES). However, while ES aims in each query at maximizing the information gain with respect to the global maximum, MRS aims at minimizing the…

2016-02-02abs ↗pdf ↗

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.

CSAC enables cooperative reinforcement learning for multi-stage tasks.

problem Coordinating consecutive reinforcement learning agents for long-term multi-stage tasks.
method CSAC modifies each agent's policy to maximize both current and next agent's critic.
result CSAC outperforms uncooperative policies and single-agent training in multi-room maze domain.

Deep learning yields great results across many fields, from speech recognition, image classification, to translation. But for each problem, getting a deep model to work well involves research into the architecture and a long period of tuning. We present a single model that yields good results on a number of problems sp…

2017-06-16abs ↗pdf ↗

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.

Efficient method for uncertainty estimation in DNNs with improved accuracy.

problem Vital assessment of deep neural networks' reliability in safety-critical applications.
method Multi-loss sub-ensembles for parallel predictions from similar models differing by their loss.
result Improved accuracy on classification tasks and competitive uncertainty measures.

We propose methods for distributed graph-based multi-task learning that are based on weighted averaging of messages from other machines. Uniform averaging or diminishing stepsize in these methods would yield consensus (single task) learning. We show how simply skewing the averaging weights or controlling the stepsize a…

2018-02-11abs ↗pdf ↗

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 ↗

Multi-head attention outperforms single-head in in-context linear regression tasks.

problem Comparing performance of transformer with single-/multi-head attention in in-context learning.
method Theoretical analysis of performance of transformers with different attention mechanisms in linear regression tasks.
result Multi-head attention with a substantial embedding dimension outperforms single-head attention in in-context linear regression tasks.

Deep kernel learning provides an elegant and principled framework for combining the structural properties of deep learning algorithms with the flexibility of kernel methods. By means of a deep neural network, we learn a parametrized kernel operator that can be combined with a differentiable kernel algorithm during infe…

2019-05-28abs ↗pdf ↗

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.

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.