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

169339508677 · Jun 202019922001200920172026
48 results for diverse tasks

Proposes a Bayesian federated learning method for diverse tasks.

problem Current federated learning approaches focus on homogeneous tasks, ignoring task diversity.
method Integrates multi-task learning with MOGP at the local level and federated learning at the global level.
result Demonstrates superior predictive performance and uncertainty calibration on diverse tasks.

Proposes Ada-Sit method for mortality prediction of rare diseases.

problem Data insufficiency and clinical diversity of rare diseases make mortality prediction hard.
method Initialization-sharing multi-task learning method (Ada-Sit) for fast adaptation to similar tasks.
result Experimental results show the proposed model is effective for mortality prediction of diverse rare diseases.

This paper shows how diverse tasks can make inefficient exploration in MTRL efficient.

problem The challenge of efficient exploration in Multitask Reinforcement Learning.
method A generic policy-sharing algorithm with myopic exploration design trained on diverse tasks.
result A generic policy-sharing algorithm with myopic exploration design can be sample-efficient in MTRL.

Meta-learning performance is affected by how task diversity is allocated, not just overall variability.

problem Meta-learning performance degrades when task diversity is unevenly distributed.
method Decomposed task-specific regression effects into structurally informative and orthogonal components.
result Meta-learning prediction degrades when a larger fraction of task variability is orthogonal and non-informative.

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.

Training task diversity improves ICL with linear attention.

problem Understanding the impact of training task diversity on in-context learning.
method Modeling training task vectors as a mixture of low-rank Gaussians.
result Our model explains why training with task diversity shortens the ICL plateau and achieves out-of-distribution generalization.

DEN learns diverse tasks to generalize to unseen tasks.

problem Generalization from a diverse set of classification tasks with limited data.
method Three-block architecture: covariate transformation, distribution embedding, and classification.
result DEN outperforms existing methods in various synthetic and real tasks.

The study provides precise asymptotic theory for in-context learning by Transformers.

problem Understanding the sample complexity, pretraining task diversity, and context length for successful in-context learning.
method An exactly solvable model of linear regression task by linear attention, deriving sharp asymptotics.
result Double-descent learning curve with increasing pretraining examples, phase transition between low and high task diversity regimes.

This paper improves ensemble learning for vision tasks by encouraging diversity in predictions.

problem Generating effective ensembles of neural networks for multi-modal data.
method Explicitly optimize a diversity inducing adversarial loss for learning stochastic latent variables.
result Significant improvements in classification accuracy and out-of-distribution detection compared to baselines.

A method for a single policy to solve various tasks across diverse agent morphologies.

problem Generalizing a single policy to solve various tasks across diverse agent morphologies.
method Unified representation and behavior distillation using a morphology-task graph and Transformer architecture.
result Improves multi-task performances compared to baselines, suggesting a promising approach.

MxPool learns graph features from diverse graphs using a hierarchical structure.

problem Learning graph features from diverse graphs with varying properties and sizes.
method MxPool uses a multiplex structure with multiple graph convolution/pooling networks in a hierarchical learning structure.
result MxPool outperforms state-of-the-art methods on graph classification benchmarks.

Paper presents a deterministic method for diverse subset selection.

problem Diverse subset selection problems in recommendation, summarization, and search.
method Greedy deterministic adaptation of k-DPP for low-rank approximations and image search.
result The method yields low-rank approximations of kernel matrices and demonstrates effectiveness in image search.

New method learns diverse solutions in reinforcement learning without gradient bias.

problem Lack of diverse solutions in reinforcement learning tasks.
method Maximizes state-action-based mutual information directly, using variational lower bound.
result Successfully learns an infinite set of diverse solutions.

New analysis shows diverse classes in pre-training boost NLP performance.

problem Improving sample efficiency in downstream NLP tasks.
method Proved that diverse classes in pre-training lead to better performance, using a large last linear layer singular value.
result Transfer learning excess risk improves with large ildeν ildeν and $O\left(\frac{1}{ ildeν \sqrt{n}} ight)$ rate.

DIVA generates diverse tasks for complex simulators, enabling adaptive agent training.

problem Lack of diverse training data for complex, open-ended simulators.
method Evolutionary approach using domain randomization and procedural generation.
result Successfully trains adaptive agent behavior in complex simulators.

This paper improves model generalization by integrating diverse pretrained models.

problem Leveraging diverse pretrained models for robust out-of-distribution generalization.
method Characterize and integrate diverse pretrained models based on diversity and correlation shifts.
result Demonstrates state-of-the-art out-of-distribution generalization performance.

We propose MAD-GAN, an intuitive generalization to the Generative Adversarial Networks (GANs) and its conditional variants to address the well known problem of mode collapse. First, MAD-GAN is a multi-agent GAN architecture incorporating multiple generators and one discriminator. Second, to enforce that different gener…

2017-04-10abs ↗pdf ↗

Improved transfer learning with expert models, reducing compute and speeding up performance.

problem Improving sample efficiency and reducing computational requirements for new tasks.
method Training a diverse set of experts using existing label structures and performance proxies to select the relevant expert for each target task.
result Significant speed-up of 2-3 orders of magnitude compared to competing approaches.

PDTS improves robustness in sequential decision-making.

problem Robust active task sampling for efficient and reliable decision-making.
method Characterizes robust active task sampling as a Markov decision process, proposes PDTS method.
result Significantly improves zero-shot and few-shot adaptation robustness.

This work studies the impact of intra-/inter-class diversity on pre-training datasets and finds a balance for optimal performance.

problem The impact of intra-/inter-class diversity on supervised pre-training datasets and their effect on downstream tasks.
method Empirical study and theoretical analysis of the relationship between diversity types and downstream performance.
result The optimal class-to-sample ratio is invariant to the size of the pre-training dataset and can be predicted.

Ensembles depend on diversity for improved performance. Many ensemble training methods, therefore, attempt to optimize for diversity, which they almost always define in terms of differences in training set predictions. In this paper, however, we demonstrate the diversity of predictions on the training set does not nece…

2019-11-04abs ↗pdf ↗

DiCE uses diverse agents to explore and learn, avoiding local minima.

problem Local minima in RL due to limited exploration and correlated behavior.
method DiCE employs a group of heterogeneous agents to explore simultaneously and share experiences, with a diversity regularization mechanism.
result DiCE achieves substantial improvement over baselines in MuJoCo locomotion tasks.

aMCL uses annealing to improve hypothesis diversity in ambiguous tasks.

problem Limitations of Winner-takes-all in predicting plausible hypotheses.
method Combines simulated annealing with Multiple Choice Learning (MCL).
result Enhanced exploration of hypothesis space during training.

Looped Transformers improve robustness and expressivity in in-context learning for diverse tasks.

problem Improving robustness and expressivity in in-context learning for diverse tasks.
method Study in-context linear regression with diverse tasks, focusing on depth and looping.
result Looped Transformers exhibit similar expressive power and are provably robust under mild assumptions.

Gradient-based meta-learners such as MAML are able to learn a meta-prior from similar tasks to adapt to novel tasks from the same distribution with few gradient updates. One important limitation of such frameworks is that they seek a common initialization shared across the entire task distribution, substantially limiti…

2018-12-18abs ↗pdf ↗

Database activity monitoring (DAM) systems are commonly used by organizations to protect the organizational data, knowledge and intellectual properties. In order to protect organizations database DAM systems have two main roles, monitoring (documenting activity) and alerting to anomalous activity. Due to high-velocity …

2019-10-23abs ↗pdf ↗

We propose a simple yet highly effective method that addresses the mode-collapse problem in the Conditional Generative Adversarial Network (cGAN). Although conditional distributions are multi-modal (i.e., having many modes) in practice, most cGAN approaches tend to learn an overly simplified distribution where an input…

2019-01-25abs ↗pdf ↗

DAMVI algorithm improves imbalanced binary classification by adjusting weights of examples and classifiers.

problem Imbalanced binary classification tasks where minority class is underrepresented.
method DAMVI algorithm increases positive example weights and optimizes classifier weights using PAC-Bayesian C-Bound.
result DAMVI outperforms state-of-the-art models on various imbalanced datasets.

We tackle the task of diverse 3D human motion prediction, that is, forecasting multiple plausible future 3D poses given a sequence of observed 3D poses. In this context, a popular approach consists of using a Conditional Variational Autoencoder (CVAE). However, existing approaches that do so either fail to capture the …

2019-12-18abs ↗pdf ↗

Paper fine-tunes LLMs for financial tasks using data fusion.

problem Improving LLMs for financial analysis tasks.
method Fine-tuned Llama3-8B and Mistral-7B using PEFT and LoRA, combined datasets for data fusion.
result Enhanced model performance across financial tasks.