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 条
  • [1] AutoHash: Learning Higher-Order Feature Interactions for Deep CTR Prediction
    Xue, Niannan
    Liu, Bin
    Guo, Huifeng
    Tang, Ruiming
    Zhou, Fengwei
    Zafeiriou, Stefanos
    Zhang, Yuzhou
    Wang, Jun
    Li, Zhenguo
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2022, 34 (06) : 2653 - 2666
  • [2] Higher-order learning
    Lewis S.
    Nature Reviews Neuroscience, 2021, 22 (2) : 75 - 75
  • [3] Higher-order learning
    Piotr Evdokimov
    Umberto Garfagnini
    Experimental Economics, 2022, 25 : 1234 - 1266
  • [4] Higher-order genetic interactions
    Rusk, Nicole
    NATURE METHODS, 2018, 15 (07) : 481 - 481
  • [5] Higher-order graph wavelets and sparsity on circulant graphs
    Kotzagiannidis, Madeleine S.
    Dragotti, Pier Luigi
    WAVELETS AND SPARSITY XVI, 2015, 9597
  • [6] Higher-order genetic interactions
    Nicole Rusk
    Nature Methods, 2018, 15 : 481 - 481
  • [7] TESTING FOR HIGHER-ORDER INTERACTIONS
    CASE, TJ
    BENDER, EA
    AMERICAN NATURALIST, 1981, 118 (06): : 920 - 929
  • [8] LEARNING CONNECTIVITY AND HIGHER-ORDER INTERACTIONS IN RADIAL DISTRIBUTION GRIDS
    Yang, Qiuling
    Coutino, Mario
    Wang, Gang
    Giannakis, Georgios B.
    Leus, Geert
    2020 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2020, : 5555 - 5559
  • [9] Explaining Local, Global, And Higher-Order Interactions In Deep Learning
    Lerman, Samuel
    Venuto, Charles
    Kautz, Henry
    Xu, Chenliang
    2021 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2021), 2021, : 1204 - 1213
  • [10] Learning higher-order features for relation prediction in knowledge hypergraph
    Wang, Peijie
    Chen, Jianrui
    Wang, Zhihui
    Hao, Fei
    KNOWLEDGE-BASED SYSTEMS, 2024, 289