Papers › Overlapping Indices for Dynamic Information Borrowing in Bayesian Hierarchical Modeling
Overlapping Indices for Dynamic Information Borrowing in Bayesian Hierarchical Modeling
Xuetao Lu, J. Jack Lee
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.
Bayesian hierarchical model (BHM) has been widely used in synthesizing information across subgroups. Identifying heterogeneity in the data and determining proper strength of borrow have long been central goals pursued by researchers. Because these two goals are interconnected, we must consider them together. This joint consideration presents two fundamental challenges: (1) How can we balance the trade-off between homogeneity within the cluster and information gain through borrowing? (2) How can we determine the borrowing strength dynamically in different clusters? To tackle challenges, first, we develop a theoretical framework for heterogeneity identification and dynamic information borrowing in BHM. Then, we propose two novel overlapping indices: the overlapping clustering index (OCI) for identifying the optimal clustering result and the overlapping borrowing index (OBI) for assigning proper borrowing strength to clusters. By incorporating these indices, we develop a new method BHMOI (Bayesian hierarchical model with overlapping indices). BHMOI includes a novel weighted K-Means clustering algorithm by maximizing OCI to obtain optimal clustering results, and embedding OBI into BHM for dynamically borrowing within clusters. BHMOI can achieve efficient and robust information borrowing with desirable properties. Examples and simulation studies are provided to demonstrate the effectiveness of BHMOI in heterogeneity identification and dynamic information borrowing.
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