Sparsity of higher-order landscape interactions enables learning and prediction for microbiomes

被引:8
|
作者
Arya, Shreya [1 ]
George, Ashish B. [2 ,3 ,4 ]
O'Dwyer, James P. [2 ,4 ]
机构
[1] Univ Illinois, Dept Phys, Urbana, IL 61801 USA
[2] Univ Illinois, Carl R Woese Inst Genom Biol, Ctr Artificial Intelligence & Modeling, Urbana, IL 61801 USA
[3] Broad Inst Massachusetts Inst Technol & Harvard, Cambridge 02142, MA USA
[4] Univ Illinois, Dept Plant Biol, Urbana, IL 61801 USA
关键词
microbial ecology; compressive sensing; microbiome; theoretical ecology; FITNESS LANDSCAPE; CONSORTIA; EPISTASIS; COEXISTENCE; DEGRADATION; DESIGN;
D O I
10.1073/pnas.2307313120
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Microbiome engineering offers the potential to leverage microbial communities to improve outcomes in human health, agriculture, and climate. To translate this potential into reality, it is crucial to reliably predict community composition and function. But a brute force approach to cataloging community function is hindered by the combinatorial explosion in the number of ways we can combine microbial species. An alternative is to parameterize microbial community outcomes using simplified, mechanistic models, and then extrapolate these models beyond where we have sampled. But these approaches remain data-hungry, as well as requiring an a priori specification of what kinds of mechanisms are included and which are omitted. Here, we resolve both issues by introducing a mechanism-agnostic approach to predicting microbial community compositions and functions using limited data. The critical step is the identification of a sparse representation of the community landscape. We then leverage this sparsity to predict community compositions and functions, drawing from techniques in compressive sensing. We validate this approach on in silico community data, generated from a theoretical model. By sampling just similar to 1% of all possible communities, we accurately predict community compositions out of sample. We then demonstrate the real-world application of our approach by applying it to four experimental datasets and showing that we can recover interpretable, accurate predictions on composition and community function from highly limited data.
引用
收藏
页数:11
相关论文
共 50 条
  • [31] Learning higher-order logic programs
    Andrew Cropper
    Rolf Morel
    Stephen Muggleton
    Machine Learning, 2020, 109 : 1289 - 1322
  • [32] Learning and generalization in higher-order perceptrons
    Yoon, H
    Oh, JH
    PHILOSOPHICAL MAGAZINE B-PHYSICS OF CONDENSED MATTER STATISTICAL MECHANICS ELECTRONIC OPTICAL AND MAGNETIC PROPERTIES, 1998, 77 (05): : 1557 - 1563
  • [33] MACHINE LEARNING OF HIGHER-ORDER PROGRAMS
    BALIGA, G
    CASE, J
    JAIN, S
    SURAJ, M
    JOURNAL OF SYMBOLIC LOGIC, 1994, 59 (02) : 486 - 500
  • [34] Higher-Order Linkage Learning in the ECGA
    Iclanzan, David
    PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2012, : 265 - 272
  • [35] Unsupervised learning of higher-order statistics
    Luo, FL
    Unbehauen, R
    Ndjountche, T
    NEURAL PROCESSING LETTERS, 1999, 9 (03) : 249 - 255
  • [36] Unsupervised Learning of Higher-Order Statistics
    Fa-Long Luo
    Rolf Unbehauen
    Tertulien Ndjountche
    Neural Processing Letters, 1999, 9 : 249 - 255
  • [37] Machine learning approach for higher-order interactions detection to ecological communities management
    Evarista Arellano-Garcia, Maria
    Ariel Camacho-Gutierrez, Jose
    Solorza-Calderon, Selene
    APPLIED MATHEMATICS AND COMPUTATION, 2021, 411
  • [38] DIPOLAR AND HIGHER-ORDER INTERACTIONS IN FERROELECTRIC TSCC
    LIFANTE, G
    GONZALO, JA
    WINDSCH, W
    FERROELECTRICS, 1992, 135 (1-4) : 277 - 281
  • [39] Programming higher-order interactions of Rydberg atoms
    Byun, Andrew
    Jeong, Seokho
    Ahn, Jaewook
    PHYSICAL REVIEW A, 2024, 110 (04)
  • [40] Loop vertex expansion for higher-order interactions
    Vincent Rivasseau
    Letters in Mathematical Physics, 2018, 108 : 1147 - 1162