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,695 papers · 148 categories

Trend · papers per month

15.2%30.5%45.7%61.0% · Jun 202019922001200920172026
48 results for sparse multi-task learning

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.

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 ↗

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.

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.

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.

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.

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.

SOFARI improves inference on multi-task learning latent factors.

problem Challenges in precise inference on multi-task learning latent factor matrices.
method High-dimensional manifold-based Neyman near-orthogonality inference on Stiefel manifold structure.
result Easy-to-use bias-corrected estimators for latent factor vectors and singular values with asymptotic normal distributions.

Robots learn new tasks autonomously with minimal human intervention.

problem Lack of scalable data collection for robot learning.
method Multi-task imitation learning with autonomous data collection and one-shot generalization.
result Robots can continuously improve through autonomous data collection without reinforcement learning.

DSelect-k improves MoE models for multi-task learning with better performance and smoother training.

problem Smoothness and convergence issues in sparse gate selection for MoE models.
method Developed DSelect-k, a differentiable and sparse gate for MoE models.
result DSelect-k achieves statistically significant improvements in prediction and expert selection over Top-k.

The one-class kernel spectral regression (OC-KSR), the regression-based formulation of the kernel null-space approach has been found to be an effective Fisher criterion-based methodology for one-class classification (OCC), achieving state-of-the-art performance in one-class classification while providing relatively hig…

2019-05-22abs ↗pdf ↗

Develops a scalable multi-task Gaussian process with neural embedding for improved performance.

problem High model complexity and limited model capability in multi-task Gaussian processes.
method Neural embedding of coregionalization, advanced variational inference, sparse approximation.
result Higher prediction quality and better generalization of the NSVLMC model.

In the paradigm of multi-task learning, mul- tiple related prediction tasks are learned jointly, sharing information across the tasks. We propose a framework for multi-task learn- ing that enables one to selectively share the information across the tasks. We assume that each task parameter vector is a linear combi- nat…

2012-06-27abs ↗pdf ↗

Unsupervised learning filters tweets for emergency services during crises.

problem Challenges in filtering relevant information from social web data during disasters.
method Multi-task domain adversarial attention network for unsupervised domain adaptation.
result The multi-task model outperforms single task models in filtering relevant tweets.

Multi-task learning (MTL) aims to improve generalization performance by learning multiple related tasks simultaneously. While sometimes the underlying task relationship structure is known, often the structure needs to be estimated from data at hand. In this paper, we present a novel family of models for MTL, applicable…

2014-09-01abs ↗pdf ↗

The paper reduces sample complexity for estimating novel task parameters with few meta-learning tasks.

problem Meta-learning sparse linear regression with limited data.
method Accessing multiple similar tasks to recover common support and reduce novel task sample complexity.
result The sample complexity for estimating the parameter of a novel task is greatly reduced to O(1) with respect to the number of tasks.

MTLRRC improves MTL by robustly clustering tasks and detecting outliers.

problem Improving MTL by handling outlier tasks and sharing common information.
method Robust regularized clustering with non-convex group penalties.
result MTLRRC effectively detects and clusters tasks, improving overall performance.

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.

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.

We propose a new approach for metric learning by framing it as learning a sparse combination of locally discriminative metrics that are inexpensive to generate from the training data. This flexible framework allows us to naturally derive formulations for global, multi-task and local metric learning. The resulting algor…

2014-04-15abs ↗pdf ↗

Estimates multiple related causal graphs with shared causal order.

problem Discovering multiple related Gaussian DAGs with shared causal order.
method Proposes a l1/l2l_1/l_2-regularized MLE for joint estimation of KK linear structural equation models.
result Joint estimator achieves better sample complexity and consistency in causal order recovery.

We focus in this paper on high-dimensional regression problems where each regressor can be associated to a location in a physical space, or more generally a generic geometric space. Such problems often employ sparse priors, which promote models using a small subset of regressors. To increase statistical power, the so-c…

2018-05-20abs ↗pdf ↗

Despite increasing focus on data publication and discovery in materials science and related fields, the global view of materials data is highly sparse. This sparsity encourages training models on the union of multiple datasets, but simple unions can prove problematic as (ostensibly) equivalent properties may be measure…

2017-11-02abs ↗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 ↗

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 ↗

New method for MTL with varying sparsity patterns across tasks.

problem Jointly training multiple linear models with differing sparsity patterns.
method Mixed-integer programming formulation and scalable algorithms.
result Our methods leverage shared support information to improve variable selection.

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.

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.