Knowledge transfer across cell lines using Hybrid Gaussian Process models with entity embedding vectors

• URL: http://arxiv.org/abs/2011.13863v1
• Date: Fri, 27 Nov 2020 17:38:15 GMT
• Title: Knowledge transfer across cell lines using Hybrid Gaussian Process models with entity embedding vectors
• Authors: Clemens Hutter, Moritz von Stosch, Mariano Nicolas Cruz Bournazou, Alessandro Butt\'e
• Abstract summary: A large number of experiments are performed to develop a biochemical process. Could we exploit data of already developed processes to make predictions for a novel process, we could significantly reduce the number of experiments needed.
• Score: 62.997667081978825
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: To date, a large number of experiments are performed to develop a biochemical process. The generated data is used only once, to take decisions for development. Could we exploit data of already developed processes to make predictions for a novel process, we could significantly reduce the number of experiments needed. Processes for different products exhibit differences in behaviour, typically only a subset behave similar. Therefore, effective learning on multiple product spanning process data requires a sensible representation of the product identity. We propose to represent the product identity (a categorical feature) by embedding vectors that serve as input to a Gaussian Process regression model. We demonstrate how the embedding vectors can be learned from process data and show that they capture an interpretable notion of product similarity. The improvement in performance is compared to traditional one-hot encoding on a simulated cross product learning task. All in all, the proposed method could render possible significant reductions in wet-lab experiments.

Related papers

• Unsupervised Representation Learning from Sparse Transformation Analysis [79.94858534887801]
  We propose to learn representations from sequence data by factorizing the transformations of the latent variables into sparse components. Input data are first encoded as distributions of latent activations and subsequently transformed using a probability flow model.
  arXiv  Detail & Related papers  (2024-10-07T23:53:25Z)
• Permutation invariant multi-output Gaussian Processes for drug combination prediction in cancer [2.1145050293719745]
  Dose-response prediction in cancer is an active application field in machine learning. The goal is to develop accurate predictive models that can be used to guide experimental design or inform treatment decisions.
  arXiv  Detail & Related papers  (2024-06-28T18:28:38Z)
• CKD: Contrastive Knowledge Distillation from A Sample-wise Perspective [48.99488315273868]
  We present a contrastive knowledge distillation approach, which can be formulated as a sample-wise alignment problem with intra- and inter-sample constraints. Our method minimizes logit differences within the same sample by considering their numerical values. We conduct comprehensive experiments on three datasets including CIFAR-100, ImageNet-1K, and MS COCO.
  arXiv  Detail & Related papers  (2024-04-22T11:52:40Z)
• Using Intermediate Forward Iterates for Intermediate Generator Optimization [14.987013151525368]
  Intermediate Generator Optimization can be incorporated into any standard autoencoder pipeline for the generative task. We show applications of the IGO on two dense predictive tasks viz., image extrapolation, and point cloud denoising.
  arXiv  Detail & Related papers  (2023-02-05T08:46:15Z)
• DORE: Document Ordered Relation Extraction based on Generative Framework [56.537386636819626]
  This paper investigates the root cause of the underwhelming performance of the existing generative DocRE models. We propose to generate a symbolic and ordered sequence from the relation matrix which is deterministic and easier for model to learn. Experimental results on four datasets show that our proposed method can improve the performance of the generative DocRE models.
  arXiv  Detail & Related papers  (2022-10-28T11:18:10Z)
• Counterfactual Generation Under Confounding [24.503075567519048]
  A machine learning model, under the influence of observed or unobserved confounders in the training data, can learn spurious correlations. We propose a counterfactual generation method that learns to modify the value of any attribute in an image and generate new images given a set of observed attributes. Our method is computationally efficient, simple to implement, and works well for any number of generative factors and confounding variables.
  arXiv  Detail & Related papers  (2022-10-22T06:39:22Z)
• OCT-GAN: Neural ODE-based Conditional Tabular GANs [8.062118111791495]
  We introduce our generator and discriminator based on neural ordinary differential equations (NODEs) We conduct experiments with 13 datasets, including but not limited to insurance fraud detection, online news article prediction, and so on.
  arXiv  Detail & Related papers  (2021-05-31T13:58:55Z)
• On the Robustness of Active Learning [0.7340017786387767]
  Active Learning is concerned with how to identify the most useful samples for a Machine Learning algorithm to be trained with. We find that it is often applied with not enough care and domain knowledge. We propose the new "Sum of Squared Logits" method based on the Simpson diversity index and investigate the effect of using the confusion matrix for balancing in sample selection.
  arXiv  Detail & Related papers  (2020-06-18T09:07:23Z)
• Omni-supervised Facial Expression Recognition via Distilled Data [120.11782405714234]
  We propose omni-supervised learning to exploit reliable samples in a large amount of unlabeled data for network training. We experimentally verify that the new dataset can significantly improve the ability of the learned FER model. To tackle this, we propose to apply a dataset distillation strategy to compress the created dataset into several informative class-wise images.
  arXiv  Detail & Related papers  (2020-05-18T09:36:51Z)
• The data-driven physical-based equations discovery using evolutionary approach [77.34726150561087]
  We describe the algorithm for the mathematical equations discovery from the given observations data. The algorithm combines genetic programming with the sparse regression. It could be used for governing analytical equation discovery as well as for partial differential equations (PDE) discovery.
  arXiv  Detail & Related papers  (2020-04-03T17:21:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.