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

239477716954 · Jun 202019922001200920182026
48 results for Multi-task networks

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.

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.

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.

Algorithm for agents to agree on a single objective in multi-task networks.

problem Decentralized decision-making in multi-task networks with multiple objectives.
method Distributed decision-making algorithm for agents observing different models.
result Agents reach agreement on which model to track for network performance enhancement.

VIRTUAL improves federated multi-task learning for non-convex models.

problem Real-world federated datasets show statistical heterogeneity.
method VIRTUAL treats federated network as a star-shaped Bayesian network and uses variational inference.
result VIRTUAL outperforms state-of-the-art for federated learning on real-world datasets.

Kernel-based algorithm optimizes cellular network configuration through multi-task learning.

problem Optimizing network configuration based on field experience and minimizing exploration cost.
method Kernel-based multi-BS contextual bandit algorithm leveraging conditional kernel embedding for multi-task learning.
result The proposed algorithm reduces exploration cost and improves network performance.

Network anomaly detection is still a vibrant research area. As the fast growth of network bandwidth and the tremendous traffic on the network, there arises an extremely challengeable question: How to efficiently and accurately detect the anomaly on multiple traffic? In multi-task learning, the traffic consisting of flo…

2014-03-17abs ↗pdf ↗

The paper shows how multi-task learning in neural networks is similar to kernel regression and Hilbert spaces.

problem Understanding the solutions to multi-task shallow ReLU neural network learning problems.
method Analyzing the properties of solutions to multi-task shallow ReLU neural network learning problems, proving uniqueness and equivalence to minimum-norm interpolation problems in Hilbert spaces.
result The solutions to multi-task neural network interpolation problems are almost always unique and coincide with the solution to a minimum-norm interpolation problem in a Sobolev (Reproducing Kernel) Hilbert Space.

Graph networks struggle with multi-task learning due to varying property loss surface curvatures.

problem Graph networks underperform in multi-task learning for crystal and molecule properties.
method Assessed curvature of property loss surfaces via spectral properties of Hessians, matrix-free using randomized numerical linear algebra.
result Varying curvature of property loss surfaces explains graph networks' multi-task learning inefficiency.

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.

Automated multi-task learning algorithm that optimizes network topology.

problem Over-sharing in multi-task learning leads to over-generalization and suboptimal performance.
method Tree-structured design space with gumbel-softmax sampling for differentiable network splitting.
result End-to-end trainable algorithm that optimizes network topology for multiple objectives across tasks.

Enhances cooperative multi-task SemCom for distributed users.

problem Performance degradation in cooperative multi-tasking due to negative information transfer.
method Federated learning (FL) with semantic-aware task clustering.
result Constructive cooperation across distributed users with semantic-aware task 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.

Multi-task learning (MTL) allows deep neural networks to learn from related tasks by sharing parameters with other networks. In practice, however, MTL involves searching an enormous space of possible parameter sharing architectures to find (a) the layers or subspaces that benefit from sharing, (b) the appropriate amoun…

2017-05-23abs ↗pdf ↗

Boosts share routing for multi-task learning with flexible sparse connections.

problem Designing suitable sharing mechanisms among multiple tasks in multi-task learning.
method Proposes MTNAS framework to modularize sharing into sub-networks with sparse connections and gating.
result Demonstrates consistent improvement over single-task and typical multi-task methods while maintaining efficiency.

Clusters of ACS patients identified for better therapeutic stratification.

problem Data-driven classification and subtyping of ACS patients for improved treatment.
method Outcome-driven clustering using a multi-task neural network with attention.
result Seven patient clusters with distinct characteristics and risk profiles identified.

MTCNet uses MTL to estimate crowd density and count.

problem Crowd count estimation challenges due to scale variations and perspective.
method MTL deep neural network architecture with two tasks: density estimation and count classification.
result Achieves lower MAE than state-of-the-art methods on multiple datasets.

PathRank ranks paths in spatial networks using multi-task learning.

problem Ranking paths in spatial networks for better navigation services.
method Data-driven framework using multi-task learning, spatial network embedding, and recurrent neural networks.
result PathRank effectively ranks paths based on historical trajectories.

A multi-task network avoids indirect discrimination in insurance pricing.

problem Indirect discrimination in insurance pricing models based on protected characteristics.
method Multi-task neural network architecture trained with partial protected characteristic information.
result Multi-task network produces discrimination-free insurance prices with comparable accuracy to conventional models.

TAAN model learns optimal network architecture for MTL tasks.

problem Improving generalization performance of MTL by finding flexible and accurate shared architecture.
method TAAN model with flexible activation functions and functional regularization.
result TAAN and regularization methods improve MTL performance.

Paper introduces vector-valued variation spaces for multi-output neural networks.

problem Understanding and optimizing multi-output neural networks.
method Development of vector-valued variation spaces and representer theorem.
result Novel bounds for layer widths in deep networks and a convex optimization method for compression.

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.

Keyphrase boundary classification (KBC) is the task of detecting keyphrases in scientific articles and labelling them with respect to predefined types. Although important in practice, this task is so far underexplored, partly due to the lack of labelled data. To overcome this, we explore several auxiliary tasks, includ…

2017-04-03abs ↗pdf ↗

GIRNet tackles multi-tasking with mixed domain sequences, improving sentiment and tagging tasks.

problem Labeling sequences with mixed domain data and position-specific inference.
method Unified position-sensitive multi-task RNN architecture with gated state sequences from auxiliary data.
result GIRNet achieves new state-of-the-art performance in sentiment classification, POS tagging, and target position-sensitive annotation.

Federated learning poses new statistical and systems challenges in training machine learning models over distributed networks of devices. In this work, we show that multi-task learning is naturally suited to handle the statistical challenges of this setting, and propose a novel systems-aware optimization method, MOCHA,…

2017-05-30abs ↗pdf ↗

CnGAN generates synthetic user preferences for non-overlapped users in cross-network recommender systems.

problem Cross-network recommender solutions ignore non-overlapped users, limiting their applicability.
method Multi-task learning, encoder-GAN architecture, user-based pairwise loss function.
result Generated user preferences improve recommendations for non-overlapped users, achieving superior performance.

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.

Study combines speaker verification and voice trigger detection in a single network.

problem Separate training for speaker verification and voice trigger detection.
method Multi-task learning with a single network trained on both tasks.
result Single network achieves comparable accuracy to independent models for each task.