The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Dirichlet–Laplace Priors for Optimal Shrinkage
Open accessAbstract
regularization, are routinely used in high-dimensional applications, and there is a rich literature on optimality properties under sparsity assumptions. In the Bayesian paradigm, sparsity is routinely induced through two-component mixture priors having a probability mass at zero, but such priors encounter daunting computational problems in high dimensions. This has motivated continuous shrinkage priors, which can be expressed as global-local scale mixtures of Gaussians, facilitating computation. In contrast to the frequentist literature, little is known about the properties of such priors and the convergence and concentration of the corresponding posterior distribution. In this article, we propose a new class of Dirichlet-Laplace priors, which possess optimal posterior concentration and lead to efficient posterior computation. Finite sample performance of Dirichlet-Laplace priors relative to alternatives is assessed in simulated and real data examples.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple Testing
Benjamini, Y., & Hochberg, Y. (1995) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1995.tb02031.x · Cited by 109,482
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
W., J. W., Abramowitz, M., & Stegun, I. A. (1965) · Mathematics of Computation · doi:10.2307/2004114 · Cited by 18,663
The adaptive lasso and its oracle properties
Zou, H. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000735 · Cited by 7,470
Park, T., & Casella, G. (2008) · Journal of the American Statistical Association · doi:10.1198/016214508000000337 · Cited by 2,934
Introduction to the non-asymptotic analysis of random matrices
Vershynin, R. (2012) · Compressed Sensing · doi:10.1017/cbo9780511794308.006 · Cited by 2,150
The horseshoe estimator for sparse signals
Carvalho, C. M., Polson, N. G., & Scott, J. G. (2010) · Biometrika · doi:10.1093/biomet/asq017 · Cited by 1,381
Large-Scale Inference: Empirical Bayes Methods for Estimation, Testing, and Prediction
Efron, B. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511761362 · Cited by 813
Dimensionality Reduction for Supervised Learning With Reproducing Kernel Hilbert Spaces
Fukumizu, K., Bach, F. R., & Jordan, M. I. (2003) · doi:10.21236/ada446572 · Cited by 723
On the conditions used to prove oracle results for the Lasso
van de Geer, S. A., & Bühlmann, P. (2009) · Electronic Journal of Statistics · doi:10.1214/09-ejs506 · Cited by 684
Cited by
Penalising Model Component Complexity: A Principled, Practical Approach to Constructing Priors
Simpson, D., Rue, H., Riebler, A., Martins, T. G., & Sørbye, S. H. (2017) · Statistical Science · doi:10.1214/16-sts576 · Cited by 1,085
Sparsity information and regularization in the horseshoe and other shrinkage priors
Piironen, J., & Vehtari, A. (2017) · Electronic Journal of Statistics · doi:10.1214/17-ejs1337si · Cited by 457
Li, C., & Mei, B. (2026) · Journal of Bioinformatics and Computational Biology · doi:10.1142/s0219720026500125
Metadata
- Authors
- Bhattacharya, A., Pati, D., Pillai, N. S., & Dunson, D. B.
- Venue
- Journal of the American Statistical Association
- Publisher
- Informa UK Limited
- Published
- 2015-10-02
- Volume
- 110
- Issue
- 512
- Pages
- 1479-1490
- ISSN
- 0162-1459 (ISSN-L)
- 1537-274X
- OpenAlex
- W2150149003
- Cited by
- 413
- References
- 29
- FWCI
- 19.93
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dirichlet–Laplace Priors for Optimal Shrinkage. https://app.cochat.ai/papers/10.1080/01621459.2014.960967
- The paper
- Bhattacharya, A., Pati, D., Pillai, N. S., & Dunson, D. B. (2015). Dirichlet–Laplace Priors for Optimal Shrinkage. Journal of the American Statistical Association. https://doi.org/10.1080/01621459.2014.960967
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.