Genome as a functional program

• URL: http://arxiv.org/abs/2006.09980v1
• Date: Fri, 5 Jun 2020 07:58:50 GMT
• Title: Genome as a functional program
• Authors: S.V. Kozyrev
• Abstract summary: We introduce a model of learning for some class of functional programs. We consider the approach to Darwinian evolution as a learning problem for functional programming.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We discuss a model of genome as a program with functional architecture and consider the approach to Darwinian evolution as a learning problem for functional programming. In particular we introduce a model of learning for some class of functional programs. This approach is related to information geometry -- the learning model uses some kind of distance in the information space (the reduction graph of the model), we consider statistical sum over paths in the reduction graph and discuss relation of this sum to temperature learning.

Related papers

• The Function-Representation Model of Computation [2.5069344340760713]
  We propose a novel model of computation, one where memory and program are merged: the Function-Representation. This model of computation involves defining a generic Function-Representation and instantiating multiple instances of it. We also explore the kind of functions a Function-Representation can implement, and present different ways to organise multiple instances of a Function-Representation.
  arXiv  Detail & Related papers  (2024-10-10T13:54:35Z)
• Statistical investigations into the geometry and homology of random programs [0.2302001830524133]
  We show how the relation between random Python programs generated from chatGPT can be described geometrically and topologically. We compare publicly available models: ChatGPT-4 and TinyLlama, on a simple problem related to image processing. We speculate that our approach may in the future give new insights into the structure of programming languages.
  arXiv  Detail & Related papers  (2024-07-05T20:25:02Z)
• Directed Cyclic Graph for Causal Discovery from Multivariate Functional Data [15.26007975367927]
  We introduce a functional linear structural equation model for causal structure learning. To enhance interpretability, our model involves a low-dimensional causal embedded space. We prove that the proposed model is causally identifiable under standard assumptions.
  arXiv  Detail & Related papers  (2023-10-31T15:19:24Z)
• Deep Graph Reprogramming [112.34663053130073]
  "Deep graph reprogramming" is a model reusing task tailored for graph neural networks (GNNs) We propose an innovative Data Reprogramming paradigm alongside a Model Reprogramming paradigm.
  arXiv  Detail & Related papers  (2023-04-28T02:04:29Z)
• Latent Multimodal Functional Graphical Model Estimation [26.457941699285165]
  We propose a new framework that models the data generation process and identifies operators mapping from the observation space to the latent space. We then develop an estimator that simultaneously estimates the transformation operators and the latent graph. Our work is applied to analyze simultaneously acquired multimodal brain imaging data where the graph indicates functional connectivity of the brain.
  arXiv  Detail & Related papers  (2022-10-31T11:43:05Z)
• Advancing Reacting Flow Simulations with Data-Driven Models [50.9598607067535]
  Key to effective use of machine learning tools in multi-physics problems is to couple them to physical and computer models. The present chapter reviews some of the open opportunities for the application of data-driven reduced-order modeling of combustion systems.
  arXiv  Detail & Related papers  (2022-09-05T16:48:34Z)
• Self-Supervised Graph Representation Learning for Neuronal Morphologies [75.38832711445421]
  We present GraphDINO, a data-driven approach to learn low-dimensional representations of 3D neuronal morphologies from unlabeled datasets. We show, in two different species and across multiple brain areas, that this method yields morphological cell type clusterings on par with manual feature-based classification by experts. Our method could potentially enable data-driven discovery of novel morphological features and cell types in large-scale datasets.
  arXiv  Detail & Related papers  (2021-12-23T12:17:47Z)
• Towards Open-World Feature Extrapolation: An Inductive Graph Learning Approach [80.8446673089281]
  We propose a new learning paradigm with graph representation and learning. Our framework contains two modules: 1) a backbone network (e.g., feedforward neural nets) as a lower model takes features as input and outputs predicted labels; 2) a graph neural network as an upper model learns to extrapolate embeddings for new features via message passing over a feature-data graph built from observed data.
  arXiv  Detail & Related papers  (2021-10-09T09:02:45Z)
• Kernel-Based Models for Influence Maximization on Graphs based on Gaussian Process Variance Minimization [9.357483974291899]
  We introduce and investigate a novel model for influence (IM) on graphs. Data-driven approaches can be applied to determine proper kernels for this IM model. Compared to models in this field that rely on costly Monte-Carlo simulations, our model allows for a simple and cost-efficient update strategy.
  arXiv  Detail & Related papers  (2021-03-02T08:55:34Z)
• Sufficiently Accurate Model Learning for Planning [119.80502738709937]
  This paper introduces the constrained Sufficiently Accurate model learning approach. It provides examples of such problems, and presents a theorem on how close some approximate solutions can be. The approximate solution quality will depend on the function parameterization, loss and constraint function smoothness, and the number of samples in model learning.
  arXiv  Detail & Related papers  (2021-02-11T16:27:31Z)
• 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.