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

171341512682 · Jun 202019922001200920172026
48 results for task relationships

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.

This paper presents a novel multitask multiple kernel learning framework that efficiently learns the kernel weights leveraging the relationship across multiple tasks. The idea is to automatically infer this task relationship in the \textit{RKHS} space corresponding to the given base kernels. The problem is formulated a…

2016-11-10abs ↗pdf ↗

Traditionally, multitask learning (MTL) assumes that all the tasks are related. This can lead to negative transfer when tasks are indeed incoherent. Recently, a number of approaches have been proposed that alleviate this problem by discovering the underlying task clusters or relationships. However, they are limited to …

2012-06-18abs ↗pdf ↗

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 ↗

Multi-task learning aims to learn multiple tasks jointly by exploiting their relatedness to improve the generalization performance for each task. Traditionally, to perform multi-task learning, one needs to centralize data from all the tasks to a single machine. However, in many real-world applications, data of differen…

2016-12-13abs ↗pdf ↗

Existing meta-learning based few-shot learning (FSL) methods typically adopt an episodic training strategy whereby each episode contains a meta-task. Across episodes, these tasks are sampled randomly and their relationships are ignored. In this paper, we argue that the inter-meta-task relationships should be exploited …

2020-02-11abs ↗pdf ↗

New method evaluates financial graphs for stock trend forecasting.

problem Lack of dynamic stock relationship graphs and evaluation methods.
method SPNews dataset and novel evaluation methods independent of downstream tasks.
result Evaluation methods can differentiate between various financial relationship graphs.

CausalCOMRL improves RL task representations by integrating causal relationships, enhancing generalizability.

problem Spurious correlations in context-based offline meta-reinforcement learning.
method CausalCOMRL integrates causal representation learning to uncover and incorporate causal relationships among task components.
result CausalCOMRL achieves better performance on meta-reinforcement learning benchmarks.

NGAT predicts long-term stock trends using graph attention networks.

problem Lack of effective corporate relationship graph comparison methods and model complexity in stock prediction.
method Developed a Node-level Graph Attention Network (NGAT) for corporate relationship graphs.
result Demonstrated the effectiveness of NGAT across two datasets.

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.

Bayesian framework for sequential learning tasks with low-rank approximations.

problem Balancing knowledge retention and adaptability in sequential neural networks.
method Bayesian framework with diagonal plus low-rank approximations of the precision matrix.
result Unlocking capabilities to encode task relationships and incorporate prior knowledge from later tasks.

The paper tackles model selection for unseen tasks by capturing relationships among checkpoints.

problem Deciding which model combinations are likely to be effective for a new task is difficult.
method The paper models the task space as a Gaussian process and identifies representative checkpoints using mutual information and a greedy algorithm.
result Representative checkpoints generalize to new tasks with superior performance.

Learning from small data sets is critical in many practical applications where data collection is time consuming or expensive, e.g., robotics, animal experiments or drug design. Meta learning is one way to increase the data efficiency of learning algorithms by generalizing learned concepts from a set of training tasks …

2018-03-20abs ↗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.

Study improves recognition of long-tail visual relationships.

problem Improving recognition of structured visual relationships from long-tail classes.
method Developed two benchmarks, introduced VilHub loss, and applied RelMix augmentation.
result Simple techniques significantly improved performance on tail classes.

Attention networks show promise for both vision and language tasks, by emphasizing relationships between constituent elements through weighting functions. Such elements could be regions in an image output by a region proposal network, or words in a sentence, represented by word embedding. Thus far the learning of atten…

2019-05-27abs ↗pdf ↗

Mining relationships between treatment(s) and medical problem(s) is vital in the biomedical domain. This helps in various applications, such as decision support system, safety surveillance, and new treatment discovery. We propose a deep learning approach that utilizes both word level and sentence-level representations …

2018-06-26abs ↗pdf ↗

Capsule networks excel in understanding spatial relationships in 2D data for vision related tasks. Even though they are not designed to capture 1D temporal relationships, with TimeCaps we demonstrate that given the ability, capsule networks excel in understanding temporal relationships. To this end, we generate capsule…

2019-11-26abs ↗pdf ↗

The paper shows why AI safety doesn't generalize across tasks.

problem AI safety fails to generalize across unseen tasks.
method Theoretical analysis of linear-quadratic control with HH_{\infty}-robustness, empirical demonstrations in simulated quadcopter navigation and CRM.
result The mapping from task specification to an optimal controller has a higher Lipschitz constant with safety requirements than without, indicating inherent complexity of safety.

Applying machine learning in the health care domain has shown promising results in recent years. Interpretable outputs from learning algorithms are desirable for decision making by health care personnel. In this work, we explore the possibility of utilizing causal relationships to refine diagnostic prediction. We focus…

2017-11-29abs ↗pdf ↗

New deep learning model for matrix completion combining linear and nonlinear relationships.

problem Matrix completion considering only linear or nonlinear relations, ignoring latent relationships.
method Combines linear and nonlinear models in a latent variables framework, using a deep neural network with two branches for columns and rows, and manifold learning as an auxiliary task.
result Experimental results show the proposed method outperforms state-of-the-art matrix completion methods.

Traditional clustering methods often perform clustering with low-level indiscriminative representations and ignore relationships between patterns, resulting in slight achievements in the era of deep learning. To handle this problem, we develop Deep Discriminative Clustering (DDC) that models the clustering task by inve…

2019-05-05abs ↗pdf ↗

Learning product representations that reflect complementary relationship plays a central role in e-commerce recommender system. In the absence of the product relationships graph, which existing methods rely on, there is a need to detect the complementary relationships directly from noisy and sparse customer purchase ac…

2019-03-16abs ↗pdf ↗

CP-DRL improves curriculum reinforcement learning by leveraging causal relationships.

problem Designing effective task sequences for reinforcement learning.
method Causal-Paced Deep Reinforcement Learning (CP-DRL) that approximates SCM differences based on interaction data.
result CP-DRL outperforms existing methods on benchmarks, achieving faster convergence and higher returns.

COBRA reduces modality gap in cross-modal tasks.

problem Joint embedding spaces fail to sufficiently reduce modality gap in multi-modal tasks.
method COBRA trains image and text modalities in a joint fashion using Contrastive Predictive Coding and Noise Contrastive Estimation.
result COBRA significantly reduces the modality gap and generates robust joint-embedding space.

This paper frames causal structure estimation as a machine learning task. The idea is to treat indicators of causal relationships between variables as `labels' and to exploit available data on the variables of interest to provide features for the labelling task. Background scientific knowledge or any available interven…

2016-12-16abs ↗pdf ↗

DGC clusters data with side-information for better prediction.

problem Improving clustering strategies through better prediction performance.
method Deep Goal-Oriented Clustering (DGC) framework that clusters data using supervision and unsupervised modeling.
result Achieves prediction accuracies comparable to state-of-the-art, while learning congruent clustering strategies.

CREAM models enable concept-grounded predictions and interpretability.

problem Designing models that can encode and extend prior knowledge about concept-concept and concept-task relationships.
method Proposes a flexible and efficient framework (CREAMs) that encodes arbitrary CCC-C and CoYC o Y relationships, incorporating a side-channel for incomplete concept sets.
result CREAM models achieve competitive task performance while encouraging concept-grounded predictions, avoiding concept leakage and achieving black-box-level performance.

A new method for joint eQTL mapping and gene network estimation.

problem Discovering SNP-gene relationships and gene-gene relationships in gene expression regulation.
method L1-2 regularized multi-task graphical lasso (L1-2 GLasso).
result Competitive performance on capturing true sparse structures of eQTL mapping and gene network.

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 ↗

Dropout helps a stable network learn new tasks without forgetting old ones.

problem Catastrophic forgetting in neural networks when learning multiple tasks.
method Investigate the relationship between dropout and stability in neural networks, showing dropout acts as an implicit gating mechanism.
result Dropout stabilizes a network's learning, allowing it to learn new tasks without forgetting old ones.

PPI uses proxy data to improve inference from limited labels across related tasks.

problem Statistical inference with limited labels across multiple related tasks.
method Prediction-powered inference framework that uses cross-task recalibration to improve power and accuracy.
result Cross-task recalibration can substantially reduce confidence interval widths when labels are scarce.

One-hot encoding is a labelling system that embeds classes as standard basis vectors in a label space. Despite seeing near-universal use in supervised categorical classification tasks, the scheme is problematic in its geometric implication that, as all classes are equally distant, all classes are equally different. Thi…

2018-10-22abs ↗pdf ↗

Word2Vec (W2V) and GloVe are popular, fast and efficient word embedding algorithms. Their embeddings are widely used and perform well on a variety of natural language processing tasks. Moreover, W2V has recently been adopted in the field of graph embedding, where it underpins several leading algorithms. However, despit…

2018-05-30abs ↗pdf ↗