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

195390584779 · Jun 202019922001200920172026
48 results for Grouping Tasks

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.

Sparse mapping has been a key methodology in many high-dimensional scientific problems. When multiple tasks share the set of relevant features, learning them jointly in a group drastically improves the quality of relevant feature selection. However, in practice this technique is used limitedly since such grouping infor…

2017-05-13abs ↗pdf ↗

CondMTL improves toxicity detection by learning group-specific representations.

problem Algorithmic bias in toxic language detection across demographic groups.
method Conditional Multi-Task Learning (CondMTL) for demographic-specific tasks.
result CondMTL improves predictive recall for minority demographic groups.

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 ↗

Gen AI improves document understanding but not data analysis in public sector tasks.

problem Understanding the impact of Gen AI on public sector tasks.
method Pre-registered field experiment comparing Gen AI to control group performance.
result Mixed results: Gen AI improves document understanding but not data analysis.

Improves model calibration and selection in unsupervised domain adaptation.

problem Distribution shifts in unsupervised domain adaptation.
method Developed a novel importance weighted group accuracy estimator.
result Improves state-of-the-art performances by 22% in model calibration and 14% in model selection.

We consider multi-task learning, which simultaneously learns related prediction tasks, to improve generalization performance. We factorize a coefficient matrix as the product of two matrices based on a low-rank assumption. These matrices have sparsities to simultaneously perform variable selection and learn and overlap…

2018-02-13abs ↗pdf ↗

REFIL learns from imagined sub-group interactions to improve multi-agent reinforcement learning.

problem Learning efficiency in multi-agent reinforcement learning settings.
method Randomized Entity-wise Factorization (REFIL) approach.
result REFIL outperforms all strong baselines in challenging multi-task StarCraft settings.

Deep networks learn hierarchical data by invariant representations.

problem How many examples are needed for deep networks to learn hierarchical data?
method Random Hierarchy Model: synthetic tasks inspired by language and images hierarchy.
result Deep networks learn by invariant representations and require a detectable number of correlations between low-level features and classes.

Since learning is typically very slow in Boltzmann machines, there is a need to restrict connections within hidden layers. However, the resulting states of hidden units exhibit statistical dependencies. Based on this observation, we propose using l1/l2l_1/l_2 regularization upon the activation possibilities of hidden unit…

2010-08-30abs ↗pdf ↗

EDGI improves sample efficiency and generalization in tasks with spatial and temporal symmetries.

problem Sample inefficiency and poor generalization in tasks with geometric symmetries.
method Equivariant Diffuser framework, SE(3)xZxSn-equivariant diffusion model.
result EDGI is more sample efficient and generalizes better than non-equivariant models.

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.

AGS-CL selectively updates penalties based on node importance for continual learning.

problem Catastrophic forgetting in continual learning.
method Adaptive Group Sparsity (AGS) with proximal gradient descent.
result Significantly outperforms baselines on various continual learning benchmarks.

Contrastive learning harms minority group representations, affecting downstream tasks.

problem Representation harm in contrastive learning, especially affecting minority groups.
method Causal mediation analysis and stochastic block model explanation.
result Representation harm in contrastive learning is partly responsible for allocation harm in downstream tasks.

Paper defines and solves a problem in representation learning to ensure fairness with high confidence.

problem Learning fair representations with high confidence guarantees for all downstream tasks.
method Formally defines the problem, introduces FRG framework, proves high probability fairness, and demonstrates effectiveness empirically.
result FRG framework provides high-confidence guarantees for limiting unfairness across all downstream models and tasks.

Personalized models using group attributes reduce performance, study finds.

problem Reducing performance of models using group attributes like race or gender.
method Formal conditions and collective preference guarantees to ensure fair use.
result Models personalized with group attributes reduce performance at a group level.

Group equivariant neural networks simplify complex tasks with group representation theory.

problem Challenging tasks requiring input transformations like rotations.
method Group representation theory, non-commutative harmonic analysis, differential geometry.
result A neural network is group equivariant if and only if it has a convolutional structure.

We introduce a probabilistic framework for quantifying the semantic similarity between two groups of embeddings. We formulate the task of semantic similarity as a model comparison task in which we contrast a generative model which jointly models two sentences versus one that does not. We illustrate how this framework c…

2019-04-30abs ↗pdf ↗

This paper introduces a method to select and weight pretext tasks for better self-supervised speech representation learning.

problem Combining pretext tasks for better performance in self-supervised speech representation learning.
method Estimating calibrated weights for partial losses corresponding to pretext tasks during self-supervised training.
result Groups of selected and weighted pretext tasks perform better than classic baselines in automatic speech recognition and speaker/emotion recognition.

Many real world tasks such as reasoning and physical interaction require identification and manipulation of conceptual entities. A first step towards solving these tasks is the automated discovery of distributed symbol-like representations. In this paper, we explicitly formalize this problem as inference in a spatial m…

2017-08-11abs ↗pdf ↗

Study on when the lower central series stops for various groups, including braid groups.

problem Understanding when the lower central series stops for different groups.
method Various techniques applied to braid groups and related groups.
result Complete computation of the lower central series for most groups studied.

Proposes TFCL to mitigate negative transfer in MTL by collaborating across features and tasks.

problem Negative transfer in Multi-Task Learning (MTL) due to dissimilar tasks.
method Task-Feature Collaborative Learning (TFCL) with heterogeneous block-diagonal structure regularizer and optimization method.
result Global convergence and block-diagonal structure recovery guarantees.

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 ↗

Transformer models waste resources on long-context tasks.

problem Redundant attention computations in Transformer models for long-context tasks.
method Reformulate sequence modeling as supervised learning, analyze attention sparsity, formulate attention optimization as linear coding problem, propose Dynamic Group Attention.
result DGA reduces computational costs while maintaining performance.

Deep metric learning has yielded impressive results in tasks such as clustering and image retrieval by leveraging neural networks to obtain highly discriminative feature embeddings, which can be used to group samples into different classes. Much research has been devoted to the design of smart loss functions or data mi…

2019-12-01abs ↗pdf ↗

A new multi-task learning estimator improves Gaussian graphical regression model fitting.

problem High error rate in fitting Gaussian graphical regression models due to separate node-wise lasso regressions.
method Proposes a multi-task learning estimator with cross-task group sparsity and within-task element-wise sparsity penalties, solved via an efficient augmented Lagrangian algorithm.
result Error rate improvement over separate node-wise lasso estimates, demonstrated through simulations and application to gene co-expression network study.

Feature representations from pre-trained deep neural networks have been known to exhibit excellent generalization and utility across a variety of related tasks. Fine-tuning is by far the simplest and most widely used approach that seeks to exploit and adapt these feature representations to novel tasks with limited data…

2017-10-06abs ↗pdf ↗

Proposes a novel MTL approach based on bias-variance analysis.

problem Improving multi-task learning performance through shared knowledge.
method Two-phase iterative aggregation of targets and features using bias-variance analysis.
result Validation on synthetic and real-world datasets demonstrates the effectiveness of the proposed method.

Most previous studies on multi-agent reinforcement learning focus on deriving decentralized and cooperative policies to maximize a common reward and rarely consider the transferability of trained policies to new tasks. This prevents such policies from being applied to more complex multi-agent tasks. To resolve these li…

2019-09-27abs ↗pdf ↗

Unified understanding of neural networks on group operations verified.

problem Understanding and verifying neural networks trained on group operations.
method Investigated one-hidden-layer neural networks trained on binary operation of finite groups, revealing structure and providing a compact proof of model performance.
result Verified explanation applies to a large fraction of networks trained on the symmetric group S5, providing a >=95% accuracy bound for 45% of models.