Papers › Bayesian Multi-scale Modeling of Factor Matrix without using Partition Tree
Bayesian Multi-scale Modeling of Factor Matrix without using Partition Tree
Maoran Xu, Leo L. Duan
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The multi-scale factor models are particularly appealing for analyzing matrix- or tensor-valued data, due to their adaptiveness to local geometry and intuitive interpretation. However, the reliance on the binary tree for recursive partitioning creates high complexity in the parameter space, making it extremely challenging to quantify its uncertainty. In this article, we discover an alternative way to generate multi-scale matrix using simple matrix operation: starting from a random matrix with each column having two unique values, its Cholesky whitening transform obeys a recursive partitioning structure. This allows us to consider a generative distribution with large prior support on common multi-scale factor models, and efficient posterior computation via Hamiltonian Monte Carlo. We demonstrate its potential in a multi-scale factor model to find broader regions of interest for human brain connectivity.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections