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.

169,051 papers · 148 categories

Trend · papers per month

137273410546 · Jun 202019922001200920182026
48 results for Multitask Gaussian Process

The paper improves Gaussian processes by adding sum constraints, enhancing prediction accuracy.

problem Improving Gaussian process predictions with background knowledge constraints.
method Conditioning the prior distribution on sum constraints to ensure fulfillment of linear and nonlinear constraints.
result The approach fulfills constraints with high precision and improves prediction accuracy.

Establishes connection between MTDNN and multitask GP, revealing weight correlation as key to task sharing.

problem Limited theoretical understanding of information sharing in MTDNN.
method Derives multitask GP kernels for MTDNN and MTBNN, showing shared hyper-parameters and last layer weights.
result Information sharing in MTDNN is due to weight correlation, not intermediate layer weights.

A new approach simplifies multitask Gaussian processes without rank approximations.

problem Handling multioutput regression problems with conditionally dependent tasks.
method Introduces a novel approach to reduce multitask learning to univariate GPs, eliminating the need for rank approximations.
result Accurately recovers multitask covariance and noise matrices with fewer parameters, improving performance and reducing overfitting risk.

Multitask Gaussian process regression reduces data generation costs for molecular property prediction.

problem Data bottleneck in training surrogate models for molecular properties.
method Multitask Gaussian process regression over heterogeneous data sources (CC and DFT).
result Predicts at CC-level accuracy with over an order of magnitude reduction in data generation cost.

A new LMC model reduces complexity from cubic to linear, making multitask Gaussian processes more practical.

problem High computational complexity in multitask Gaussian processes.
method Decoupling latent processes under mild noise model assumptions, leading to linear complexity.
result Efficient exact computation of the LMC model is possible under mild noise model assumptions.

We study learning problems in which the conditional distribution of the output given the input varies as a function of additional task variables. In varying-coefficient models with Gaussian process priors, a Gaussian process generates the functional relationship between the task variables and the parameters of this con…

2015-08-28abs ↗pdf ↗

Study uses SABR model to create implied volatilities from sparse quotes.

problem Creating accurate implied volatility surfaces from limited market data.
method Multitask Gaussian process with SABR model embeddings and hierarchical regularization.
result Model produces more accurate volatilities than single-task methods.

Scalable GP model handles functional covariates and multitasks.

problem Uncertainty quantification in complex mechanical systems with time-dependent inputs.
method Introduced a fully separable kernel structure for functional covariates and multitask problems, leveraging Kronecker structure for scalability.
result The model significantly improves over single task GPs, requiring fewer samples for accurate predictions.

Enhances MTGP for better hierarchical latent interactions.

problem Current MTGPs struggle with hierarchical latent interactions.
method Proposes a novel kernel representation for hierarchical interactions in LMC of MTGP.
result Promotes knowledge transferring in MTGP through hierarchical interactions.

The study calculates the risk of semi-supervised multitask learning on Gaussian mixtures.

problem Understanding the risk in semi-supervised multitask learning on Gaussian mixtures.
method Statistical physics methods applied to Gaussian mixture models.
result The study evaluates the performance gain of learning tasks together versus separately.

New models improve stock and wind speed forecasting.

problem Lack of posterior distribution in stochastic volatility models.
method Re-cast stochastic volatility models as hierarchical Gaussian processes with specialized covariance functions.
result Volt and Magpie models significantly outperform baselines in forecasting.

This paper presents a new model called infinite mixtures of multivariate Gaussian processes, which can be used to learn vector-valued functions and applied to multitask learning. As an extension of the single multivariate Gaussian process, the mixture model has the advantages of modeling multimodal data and alleviating…

2013-07-26abs ↗pdf ↗

DGPs learn from multiple tasks using shared and private latent processes.

problem Improving learning performance and information transfer between tasks.
method Non-linear mixtures of latent processes with shared and task-specific components, using hard or soft sharing.
result DGPs outperform other multi-task learning models across various settings.

Data-driven approach discovers molecular photoswitches with separated electronic absorption bands.

problem Engineering photoswitchable molecules with specific electronic absorption bands remains challenging.
method Data-driven discovery pipeline using Gaussian processes for multitask learning.
result Multioutput Gaussian process (MOGP) trained on four photoswitch transition wavelengths outperforms single-task models and TD-DFT.

Massively multitask neural architectures provide a learning framework for drug discovery that synthesizes information from many distinct biological sources. To train these architectures at scale, we gather large amounts of data from public sources to create a dataset of nearly 40 million measurements across more than 2…

2015-02-06abs ↗pdf ↗

Research explores the trade-off between multi-task learning and multitasking in deep neural networks.

problem Trade-off between multi-task learning and multitasking in deep neural networks.
method Meta-learning algorithm to manage the trade-off between shared and separated representations.
result Agent successfully optimizes training strategy based on environment.

Recently there has been an increasing interest in methods that deal with multiple outputs. This has been motivated partly by frameworks like multitask learning, multisensor networks or structured output data. From a Gaussian processes perspective, the problem reduces to specifying an appropriate covariance function tha…

2009-11-26abs ↗pdf ↗

Study improves drug prediction accuracy for pharmacokinetic parameters.

problem Limited accuracy in predicting pharmacokinetic parameters.
method Integrated transfer learning and multitask learning approach.
result Improved model generalization and predictive ability.

New algorithm REFUEL shows multitask representation learning is more sample-efficient in RL.

problem Understanding the benefit of representation learning in reinforcement learning.
method Developed REFUEL algorithm for multitask low-rank RL, analyzing both upstream and downstream tasks.
result Multitask representation learning is provably more sample-efficient than individual task learning.

Multitask learning has shown promising performance in many applications and many multitask models have been proposed. In order to identify an effective multitask model for a given multitask problem, we propose a learning framework called learning to multitask (L2MT). To achieve the goal, L2MT exploits historical multit…

2018-05-19abs ↗pdf ↗

Framework identifies brain connectivity alterations for MDD patients using limited rs-fMRI data.

problem Difficult to analyze brain connectivity alterations from limited rs-fMRI data.
method Proposed a multitask Gaussian Bayesian network (MTGBN) framework to learn individual disease-induced alterations.
result Framework efficiently learns Bayesian network structures from limited data, showing improved performance.

A new multitask model using Hopfield Networks improves classification performance.

problem Improving classification models by sharing information across multiple tasks.
method Developed a transductive semi-supervised parametric Hopfield Network (HoMTask) that minimizes an energy function for all tasks.
result HoMTask achieves competitive performance compared to state-of-the-art semi-supervised graph-based algorithms.

Deep learning methods such as multitask neural networks have recently been applied to ligand-based virtual screening and other drug discovery applications. Using a set of industrial ADMET datasets, we compare neural networks to standard baseline models and analyze multitask learning effects with both random cross-valid…

2016-06-28abs ↗pdf ↗

This thesis advances algorithms and software for QMC, GP, and sciML.

problem Efficient high-dimensional integration, interpolation, and PDE modeling.
method Developed new algorithms and software for QMC, GP, and sciML.
result Efficient and accurate methods for high-dimensional problems.

We propose Deep Asymmetric Multitask Feature Learning (Deep-AMTFL) which can learn deep representations shared across multiple tasks while effectively preventing negative transfer that may happen in the feature sharing process. Specifically, we introduce an asymmetric autoencoder term that allows reliable predictors fo…

2017-08-01abs ↗pdf ↗

This paper presents a new multitask learning framework that learns a shared representation among the tasks, incorporating both task and feature clusters. The jointly-induced clusters yield a shared latent subspace where task relationships are learned more effectively and more generally than in state-of-the-art multitas…

2017-03-03abs ↗pdf ↗

MSOL learns hierarchical policies for multitask tasks with soft options.

problem Training hierarchical policies for multiple tasks with stability and flexibility.
method MSOL uses separate variational posteriors for each task, regularized by a shared prior, to avoid instabilities and fine-tune options for new tasks.
result MSOL significantly outperforms hierarchical and flat transfer-learning baselines.

Multitask learning improves phenotyping in EHR data, but its benefits vary by phenotype complexity.

problem Improving phenotyping accuracy in EHR data using multitask learning.
method Investigated multitask learning for phenotyping rare and common phenotypes in EHR data using neural nets and logistic regression.
result Multitask learning with neural nets consistently outperforms single-task neural nets for rare phenotypes but underperforms for common phenotypes.

Proposes a method to balance tasks in multitask learning with a single gradient step update.

problem Balancing tasks in multitask learning to avoid imbalance.
method Gradient-based meta-learning to balance tasks at the gradient level, training shared and task-specific layers separately.
result Achieves state-of-the-art performance on various multitask computer vision problems.

Paper proposes a method to identify negative transfers in multitask learning using surrogate models.

problem Identifying subsets of source tasks that improve target task performance in multitask learning.
method Surrogate modeling to precompute multitask learning performances and approximate them with a linear regression model.
result The approach predicts negative transfers from multiple source tasks to target tasks more accurately than existing methods.

This paper introduces self-paced task selection to multitask learning, where instances from more closely related tasks are selected in a progression of easier-to-harder tasks, to emulate an effective human education strategy, but applied to multitask machine learning. We develop the mathematical foundation for the appr…

2017-03-02abs ↗pdf ↗

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 ↗

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 ↗

New algorithm improves multitask learning across diverse agents.

problem Performance degradation in decentralized learning with heterogeneous objectives.
method Developed an exact subspace diffusion algorithm for multitask learning over networks.
result The algorithm outperforms alternatives in noisy gradient approximations.

Paper introduces multitask neural networks for efficient stochastic control problems.

problem Infeasibility of simulating state variables in some stochastic control problems.
method Multitask neural networks with dynamic task balancing.
result Multitask neural networks outperform state-of-the-art approaches in derivatives pricing problems.

This paper proposes a new multitask learning method to better measure task relationships.

problem Learning multiple tasks independently loses information about task relationships.
method Jointly learns shared parameters and shared feature representations through a new strategy.
result The proposed method better measures task relationships and optimizes shared parameters.