Relaxation of Projected Prior with Continuous Gap Shrinkage
Leo L Duan, Sunghyun Cho, Mingzhang Yin

TL;DR
This paper introduces a continuous relaxation of projected priors called gap-shrinkage priors, enabling efficient Bayesian inference for constrained parameter spaces without iterative optimization at each step.
Contribution
It proposes a tractable, probabilistic prior that shrinks the duality gap, simplifying posterior computation for projected priors and connecting to global-local shrinkage models.
Findings
Gap-shrinkage priors have a tractable form and do not require nested optimization.
They effectively concentrate probability near the exact projection.
The model demonstrates competitive posterior contraction and broad applicability.
Abstract
Projected priors were originally introduced to accommodate parameter constraints, but have recently regained popularity due to their ability to assign probability mass to low-dimensional parameter sets, such as the spaces of sparse vectors, directed acyclic graphs, or transport plans. When employed as a transformation of random variables, projection is especially useful, since its contraction property not only preserves probability concentration, but also often preserves differentiability for gradient-based posterior computation. On the other hand, unless the projection can be obtained by some non-iterative algorithm, posterior computation can be expensive because it requires nesting an iterative optimization routine within each Markov chain Monte Carlo iteration. In this article, inspired by the success of continuous shrinkage models as replacements for discrete spike-and-slab priors,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
