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

178356533711 · Jun 202019922001200920172026
48 results for task specialization

This paper benchmarks uncertainty disentanglement across various tasks.

problem Disentangling multiple sources of uncertainty for specialized tasks.
method Reimplemented and evaluated a wide range of uncertainty estimators.
result No existing approach provides disentangled uncertainty estimators in practice.

New model optimizes worker-task specialization for crowdsourcing.

problem Inferring correct labels from noisy answers across varying worker and task skills.
method Introduced a dd-type specialization model to account for varying worker and task types, and proposed algorithms achieving optimal sample complexity.
result Optimal label inference algorithms for crowdsourcing with unknown worker and task types.

Improved HMoE models using Laplace gating function enhance expert specialization and performance.

problem Improving performance of hierarchical mixture of experts models.
method Used Laplace gating function instead of Softmax in hierarchical mixture of experts models.
result Laplace gating function accelerates expert convergence and enhances specialization.

The goal of meta-learning is to train a model on a variety of learning tasks, such that it can adapt to new problems within only a few iterations. Here we propose a principled information-theoretic model that optimally partitions the underlying problem space such that specialized expert decision-makers solve the result…

2019-10-31abs ↗pdf ↗

KM method reduces ConvNet parameters to 9% higher accuracy with minimal additional memory.

problem Expensive memory usage for training ConvNets on embedded devices.
method Kernel Modulation (KM) method that adapts all network parameters for each task.
result KM delivers up to 9% higher accuracy than other parameter-efficient methods.

One of the main difficulties in analyzing neural networks is the non-convexity of the loss function which may have many bad local minima. In this paper, we study the landscape of neural networks for binary classification tasks. Under mild assumptions, we prove that after adding one special neuron with a skip connection…

2018-05-22abs ↗pdf ↗

Multiple Additive Regression Trees (MART), an ensemble model of boosted regression trees, is known to deliver high prediction accuracy for diverse tasks, and it is widely used in practice. However, it suffers an issue which we call over-specialization, wherein trees added at later iterations tend to impact the predicti…

2015-05-07abs ↗pdf ↗

FinRobot opens-source AI for financial tasks, breaking down complex problems.

problem Barriers to AI adoption in finance due to proprietary data and specialized knowledge.
method Develops open-source AI agent platform with four layers: Financial AI Agents, LLM Algorithms, LLMOps/DataOps, and Foundation Models.
result FinRobot democratizes AI access for financial analysis.

The instance segmentation problem intends to precisely detect and delineate objects in images. Most of the current solutions rely on deep convolutional neural networks but despite this fact proposed solutions are very diverse. Some solutions approach the problem as a network problem, where they use several networks or …

2019-02-01abs ↗pdf ↗

We propose a novel graph-driven generative model, that unifies multiple heterogeneous learning tasks into the same framework. The proposed model is based on the fact that heterogeneous learning tasks, which correspond to different generative processes, often rely on data with a shared graph structure. Accordingly, our …

2019-11-20abs ↗pdf ↗

A practical limitation of deep neural networks is their high degree of specialization to a single task and visual domain. Recently, inspired by the successes of transfer learning, several authors have proposed to learn instead universal, fixed feature extractors that, used as the first stage of any deep network, work w…

2018-03-27abs ↗pdf ↗

Determinantal point processes (DPPs) have received significant attention in the recent years as an elegant model for a variety of machine learning tasks, due to their ability to elegantly model set diversity and item quality or popularity. Recent work has shown that DPPs can be effective models for product recommendati…

2018-05-24abs ↗pdf ↗

We propose a novel framework for multi-task reinforcement learning (MTRL). Using a variational inference formulation, we learn policies that generalize across both changing dynamics and goals. The resulting policies are parametrized by shared parameters that allow for transfer between different dynamics and goal condit…

2019-06-21abs ↗pdf ↗

Meta-learning techniques like MAML and Reptile fail to generalize well to out-of-distribution tasks compared to simple finetuning.

problem Generalization of meta-learning techniques in low-data scenarios.
method Investigation of MAML, Reptile, and finetuning on various tasks.
result MAML and Reptile specialize for fast adaptation but fail to generalize to out-of-distribution tasks.

Learning to solve sequential tasks with recurrent models requires the ability to memorize long sequences and to extract task-relevant features from them. In this paper, we study the memorization subtask from the point of view of the design and training of recurrent neural networks. We propose a new model, the Linear Me…

2020-01-31abs ↗pdf ↗

A new machine learning framework simplifies survival analysis.

problem Survival analysis challenges including censoring, truncation, and multiple events.
method Data augmentation to standard Poisson regression, using various machine learning algorithms.
result General machine learning methods can be applied to time-to-event analysis without specific assumptions.

We discuss a general method to learn data representations from multiple tasks. We provide a justification for this method in both settings of multitask learning and learning-to-learn. The method is illustrated in detail in the special case of linear feature learning. Conditions on the theoretical advantage offered by m…

2015-05-23abs ↗pdf ↗

Improved language model for French clinical reports achieves state-of-the-art performance in medical NLP tasks.

problem Lack of specialized language models for French clinical reports.
method Adapted a general pre-trained language model (CamemBERT) to French clinical reports using a corpus of 21M reports.
result Pretrained and fine-tuned models improved F1-score by 3 percentage points on APMed task.

Study shows how a strong model can learn a task's feature while retaining other capabilities.

problem How to align superhuman AI systems using weak-to-strong generalization.
method Two-layer neural networks, reward-model learning, multi-step SGD, feature learning.
result The strong model efficiently learns task features while retaining general capabilities.

While recent progress has spawned very powerful machine learning systems, those agents remain extremely specialized and fail to transfer the knowledge they gain to similar yet unseen tasks. In this paper, we study a simple reinforcement learning problem and focus on learning policies that encode the proper invariances …

2018-09-07abs ↗pdf ↗

Paper proposes a new AI design philosophy for distributed learning.

problem Designing AI systems that mimic human cognitive capabilities.
method Democratized learning (Dem-AI) with self-organized hierarchical agents.
result Self-organized learning systems can perform complex tasks more efficiently.

New study reveals task alignment is key to ICL performance.

problem Understanding how task alignment affects generalization in in-context learning.
method Derived an exact expression for ICL generalization error in high dimensions under task covariance mismatch.
result Identified train-test task alignment as a key determinant of generalization in ICL.

Many real-world problems, including multi-speaker text-to-speech synthesis, can greatly benefit from the ability to meta-learn large models with only a few task-specific components. Updating only these task-specific modules then allows the model to be adapted to low-data tasks for as many steps as necessary without ris…

2019-09-12abs ↗pdf ↗

Neural networks have succeeded in many reasoning tasks. Empirically, these tasks require specialized network structures, e.g., Graph Neural Networks (GNNs) perform well on many such tasks, but less structured networks fail. Theoretically, there is limited understanding of why and when a network structure generalizes be…

2019-05-30abs ↗pdf ↗

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 ↗

Transformers learn to generalize out-of-distribution with diverse pretraining tasks.

problem Conditions for pretrained transformers to generalize out-of-distribution.
method Empirical study of task diversity and pretraining distribution.
result As task diversity increases, transformers transition from specialized to generalized solutions.

STAR improves equivariant and invariant representation learning by routing projection heads.

problem Redundant feature learning in equivariant and invariant representation learning.
method Soft Task-Aware Routing (STAR) for projection heads specialization.
result Lower canonical correlations between invariant and equivariant embeddings.

Meta-learning has emerged as an important framework for learning new tasks from just a few examples. The success of any meta-learning model depends on (i) its fast adaptation to new tasks, as well as (ii) having a shared representation across similar tasks. Here we extend the model-agnostic meta-learning (MAML) framewo…

2019-10-16abs ↗pdf ↗

Transformers learn to integrate information from past positions incrementally, specializing heads in distinct patterns.

problem How transformers learn to integrate information from multiple past positions with varying statistical significance.
method High-order Markov chain task, incremental learning, sparse attention patterns, simplified differential equations, stage-wise convergence, early stopping as regularizer.
result Transformers learn to specialize heads in distinct patterns, shifting from competitive to cooperative learning dynamics.

A new benchmark task for evaluating policy learning in complex, high-dimensional action spaces.

problem Lack of a commonly accepted benchmark for evaluating policy learning in hierarchical tasks with high-dimensional action spaces.
method Proposed DinerDash Gym benchmark and Decomposed Policy Graph Modelling (DPGM) algorithm.
result DPGM achieves significant improvement over baselines and effectively injects domain knowledge.

A new framework decouples SSL tasks into VDA and VLC, revealing VDA's importance.

problem Designing effective self-supervised learning tasks without manual annotation.
method Borrowing a multi-view perspective, the paper decouples popular pretext tasks into VDA and VLC, focusing on VDA's role in feature learning.
result VDA tasks dominate SSL performance, and integrating predictions from augmented views improves overall performance.