Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2502.02552

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2502.02552 (cs)
[Submitted on 4 Feb 2025 ]

Title: Hierarchical Sparse Bayesian Multitask Model with Scalable Inference for Microbiome Analysis

Title: 用于微生物组分析的分层稀疏贝叶斯多任务模型及其可扩展推理方法

Authors:Haonan Zhu, Andre R. Goncalves, Camilo Valdes, Hiranmayi Ranganathan, Boya Zhang, Jose Manuel Martí, Car Reen Kok, Monica K. Borucki, Nisha J. Mulakken, James B. Thissen, Crystal Jaing, Alfred Hero, Nicholas A. Be
Abstract: This paper proposes a hierarchical Bayesian multitask learning model that is applicable to the general multi-task binary classification learning problem where the model assumes a shared sparsity structure across different tasks. We derive a computationally efficient inference algorithm based on variational inference to approximate the posterior distribution. We demonstrate the potential of the new approach on various synthetic datasets and for predicting human health status based on microbiome profile. Our analysis incorporates data pooled from multiple microbiome studies, along with a comprehensive comparison with other benchmark methods. Results in synthetic datasets show that the proposed approach has superior support recovery property when the underlying regression coefficients share a common sparsity structure across different tasks. Our experiments on microbiome classification demonstrate the utility of the method in extracting informative taxa while providing well-calibrated predictions with uncertainty quantification and achieving competitive performance in terms of prediction metrics. Notably, despite the heterogeneity of the pooled datasets (e.g., different experimental objectives, laboratory setups, sequencing equipment, patient demographics), our method delivers robust results.
Abstract: 本文提出了一种分层贝叶斯多任务学习模型,适用于一般的多任务二分类学习问题,该模型假设不同任务之间共享稀疏结构。 我们基于变分推理推导出一种计算效率高的推理算法以近似后验分布。 我们在各种合成数据集以及基于微生物组特征预测人类健康状况方面展示了新方法的潜力。 我们的分析结合了来自多个微生物组研究的数据,并与其他基准方法进行了全面比较。 合成数据集中的结果显示,当底层回归系数在不同任务间共享共同的稀疏结构时,所提出的模型具有优越的支持恢复特性。 我们在微生物组分类实验中证明了该方法在提取信息丰富的分类群方面的实用性,同时提供了经过良好校准的预测和不确定性量化,并在预测指标方面取得了具有竞争力的表现。 值得注意的是,尽管合并的数据集存在异质性(例如,不同的实验目标、实验室设置、测序设备、患者人口统计),我们的方法仍能提供稳健的结果。
Subjects: Machine Learning (cs.LG) ; Biomolecules (q-bio.BM); Applications (stat.AP); Computation (stat.CO); Methodology (stat.ME)
Cite as: arXiv:2502.02552 [cs.LG]
  (or arXiv:2502.02552v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2502.02552
arXiv-issued DOI via DataCite

Submission history

From: Haonan Zhu [view email]
[v1] Tue, 4 Feb 2025 18:23:22 UTC (26,486 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
stat
< prev   |   next >
new | recent | 2025-02
Change to browse by:
cs
cs.LG
q-bio
q-bio.BM
stat.AP
stat.CO
stat.ME

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号