Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Amortized Variational Inference for Scalable Bayesian Tensor Factorization in Spatial Transcriptomics

View through CrossRef
Abstract Background: Spatial transcriptomics and single-cell RNA-sequencing (scRNA-seq) provide unprecedented insights into the spatial morphologies of latent biological pathways. While Bayesian Tensor Factorization (e.g., CANDECOMP/PARAFAC) offers a rigorous probabilistic framework to deconvolve these pathways and quantify inherent biological noise, traditional inference methods rely on local Markov Chain Monte Carlo (MCMC) or coordinate-ascent updates. The O ( N ) computational complexity of these approaches renders them intractable for modern, high-dimensional clinical datasets containing hundreds of thousands of cells. Methods: We propose a foundational proof-of-concept architecture that bridges deep learning and probabilistic graphical models via Amortized Variational Inference. By replacing iterative local parameter updates with an amortized neural encoder, we map cell-specific transcriptomic profiles directly to their latent Gaussian parameters. This decouples the parameter space from the dataset size, allowing model training to scale gracefully via stochastic mini-batch optimization, and reducing test-time inference of latent states to a highly parallelizable O (1) forward pass. Results: We validate the framework across two experimental paradigms. First, a simulation study with known continuous latent factors demonstrates strict mathematical identifiability and accurate recovery of topological structure, evidenced by a tightly bounded mean Tucker Congruence Coefficient of 0 . 96 ± 0 . 015. Second, application to a benchmark 10x Genomics Peripheral Blood Mononuclear Cell (PBMC) dataset demonstrates robust scalability and optimization stability. The convergence of the reconstruction error and KL-divergence regularization is strongly consistent with the avoidance of posterior collapse. Conclusion: Amortized inference provides a computationally viable, mathematically rigorous alternative to standard Bayesian tensor decomposition. This framework establishes a scalable, probabilistic foundation for biomarker discovery in complex spatial morphologies.
Springer Science and Business Media LLC
Title: Amortized Variational Inference for Scalable Bayesian Tensor Factorization in Spatial Transcriptomics
Description:
Abstract Background: Spatial transcriptomics and single-cell RNA-sequencing (scRNA-seq) provide unprecedented insights into the spatial morphologies of latent biological pathways.
While Bayesian Tensor Factorization (e.
g.
, CANDECOMP/PARAFAC) offers a rigorous probabilistic framework to deconvolve these pathways and quantify inherent biological noise, traditional inference methods rely on local Markov Chain Monte Carlo (MCMC) or coordinate-ascent updates.
The O ( N ) computational complexity of these approaches renders them intractable for modern, high-dimensional clinical datasets containing hundreds of thousands of cells.
Methods: We propose a foundational proof-of-concept architecture that bridges deep learning and probabilistic graphical models via Amortized Variational Inference.
By replacing iterative local parameter updates with an amortized neural encoder, we map cell-specific transcriptomic profiles directly to their latent Gaussian parameters.
This decouples the parameter space from the dataset size, allowing model training to scale gracefully via stochastic mini-batch optimization, and reducing test-time inference of latent states to a highly parallelizable O (1) forward pass.
Results: We validate the framework across two experimental paradigms.
First, a simulation study with known continuous latent factors demonstrates strict mathematical identifiability and accurate recovery of topological structure, evidenced by a tightly bounded mean Tucker Congruence Coefficient of 0 .
96 ± 0 .
015.
Second, application to a benchmark 10x Genomics Peripheral Blood Mononuclear Cell (PBMC) dataset demonstrates robust scalability and optimization stability.
The convergence of the reconstruction error and KL-divergence regularization is strongly consistent with the avoidance of posterior collapse.
Conclusion: Amortized inference provides a computationally viable, mathematically rigorous alternative to standard Bayesian tensor decomposition.
This framework establishes a scalable, probabilistic foundation for biomarker discovery in complex spatial morphologies.

Related Results

Theoretical Foundations and Practical Applications in Signal Processing and Machine Learning
Theoretical Foundations and Practical Applications in Signal Processing and Machine Learning
Tensor decomposition has emerged as a powerful mathematical framework for analyzing multi-dimensional data, extending classical matrix decomposition techniques to higher-order repr...
Sample-efficient Optimization Using Neural Networks
Sample-efficient Optimization Using Neural Networks
<p>The solution to many science and engineering problems includes identifying the minimum or maximum of an unknown continuous function whose evaluation inflicts non-negligibl...
Imputation of Spatially-resolved Transcriptomes by Graph-regularized Tensor Completion
Imputation of Spatially-resolved Transcriptomes by Graph-regularized Tensor Completion
Abstract High-throughput spatial-transcriptomics RNA sequencing (sptRNA-seq) based on in-situ capturing technologies has recently been developed ...
Enhanced inherent strain modelling for powder-based metal additive manufacturing
Enhanced inherent strain modelling for powder-based metal additive manufacturing
(English) Metal additive manufacturing (MAM), particularly powder bed fusion using a laser beam (PBF-LB), has transformed manufacturing by enabling the production of intricate and ...
Species of Fusarium and Neocosmospora associated with citrus branch diseases in China
Species of Fusarium and Neocosmospora associated with citrus branch diseases in China
Fig. S1. Phylogenetic tree generated by Bayesian inference analyses based on the individual CaM, rpb1, rpb2 and tef1 (A–D) for species in Fusarium fujikuroi species complex (FFSC)....
Sign Problem in Tensor-Network Contraction
Sign Problem in Tensor-Network Contraction
We investigate how the computational difficulty of contracting tensor networks depends on the sign structure of the tensor entries. Using results from computational complexity, we ...
Factorization structures, cones, and polytopes
Factorization structures, cones, and polytopes
Abstract Factorization structures occur in toric differential and discrete geometry and can be viewed in multiple ways, e.g., as objects determining substantial classes of expli...
Gravitational Waves from Alena Tensor
Gravitational Waves from Alena Tensor
Alena Tensor is a recently discovered class of energy-momentum tensors that proposes a general equivalence of the curved path and the geodesic for the analyzed spacetimes which all...

Back to Top