POEMS: Product of Experts for Interpretable Multi-omic Integration using Sparse Decoding

Mihriban Kocak Balik, Pekka Marttinen, Negar Safinianaini
11/5/2025
cs.LG

No official code found. Best implementation: anonymous-fish14/POEMS (1 star, MIT, last commit 2025-10-15).

Abstract

Integrating different molecular layers, i.e., multiomics data, is crucial for unraveling the complexity of diseases; yet, most deep generative models either prioritize predictive performance at the expense of interpretability or enforce interpretability by linearizing the decoder, thereby weakening the network's nonlinear expressiveness. To overcome this tradeoff, we introduce POEMS: Product Of Experts for Interpretable Multiomics Integration using Sparse Decoding, an unsupervised probabilistic framework that preserves predictive performance while providing interpretability. POEMS provides interpretability without linearizing any part of the network by 1) mapping features to latent factors using sparse connections, which directly translates to biomarker discovery, 2) allowing for cross-omic associations through a shared latent space using product of experts model, and 3) reporting contributions of each omic by a gating network that adaptively computes their influence in the representation learning. Additionally, we present an efficient sparse decoder. In a cancer subtyping case study, POEMS achieves competitive clustering and classification performance while offering our novel set of interpretations, demonstrating that biomarker based insight and predictive accuracy can coexist in multiomics representation learning.

View on arXivView PDF

Code Implementations(1)

MIT

POEMS: Product of Experts for Interpretable Multi-omic Integration using Sparse Decoding

10Shell, PythonOct 10, 20251 years agoMIT

Similar Papers

Cite this paper

@article{balik2025poems,
  title  = {POEMS: Product of Experts for Interpretable Multi-omic Integration using Sparse Decoding},
  author = {Mihriban Kocak Balik and Pekka Marttinen and Negar Safinianaini},
  year   = {2025},
  eprint = {2511.03464},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.03464v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2511.03464.svg)](https://codeofpaper.com/paper/2511.03464)

Discussion