Posterior contraction rate of sparse latent feature models with application to proteomics

DOI10.1080/24754269.2021.1974664MaRDI QIDQ5880101zbMATH OpenOpenAlexFDO

Authors

Publication date 7 March 2023

Published in Statistical Theory and Related Fields (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1909.09261

zbMATH Keywords

high dimensionIndian buffet processlatent featureMarkov chain Monte Carloposterior convergencereverse phase protein arrays

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• Gibbs Sampling Methods for Stick-Breaking Priors
• Needles and straw in a haystack: posterior concentration for possibly sparse sequences
• Nonparametric Bayesian sparse factor models with application to gene expression modeling
• On Bayes procedures
• Posterior contraction in sparse Bayesian factor models for massive covariance matrices
• Posterior contraction rates of the phylogenetic Indian buffet processes
• The consistency of posterior distributions in nonparametric problems
• The Indian buffet process: an introduction and review

Cited in

(2)

• Rate-optimal posterior contraction for sparse PCA
• Posterior Contraction Rate of Sparse Latent Feature Models with Application to Proteomics

Describes a project that uses

Uses Software

• KEGG
• TCGA-assembler

This page was built for publication: Posterior contraction rate of sparse latent feature models with application to proteomics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5880101)