---
title: Group-R2 Decomposition Prior in Bayesian Regression
url: https://www.emergentmind.com/topics/group-r2-decomposition-prior
type: topic
---

# Group-R2 Decomposition Prior in Bayesian Regression

Searching arXiv for the named prior and closely related R2-based grouped shrinkage work.
The **Group-R2 decomposition prior** is a hierarchical shrinkage prior for linear regression with **known groups of predictors**. Its defining construction is a prior on the model’s explained variance, \(R^2\), followed by a **two-stage decomposition** of the induced total signal variance: first **across groups**, then **within groups** across individual coefficients. In this formulation, model complexity, sparsity, and group importance are parameterized through variance allocation rather than through coefficient magnitudes alone, giving an explicitly \(R^2\)-based grouped extension of the broader R2D2/R2-prior family [2507.11833].

## 1. Formal setting and problem class

The prior is developed for the linear regression model
\[
y = b_0 J + \sum_{g=1}^G X_g b_g + \varepsilon, \qquad \varepsilon_i \sim \mathcal{N}(0,\sigma^2),
\]
where predictors are partitioned into \(G\) mutually exclusive groups and
\[
b = (b_1',\dots,b_G')', \qquad b_g = (b_{g1},\dots,b_{gp_g})'.
\]
Under the assumptions \(\mathbb{E}(x)=0\), \(\operatorname{Var}(x)=\Sigma_x\) with unit diagonal, and
\[
\operatorname{Var}(b)=\sigma^2\Lambda,\qquad \Lambda=\mathrm{diag}(\lambda_1^2,\dots,\lambda_p^2),
\]
the variance of the linear predictor is
\[
\operatorname{Var}(x'b)=\sigma^2 \sum_{i=1}^p \lambda_i^2.
\]
The total prior signal variance is denoted
\[
\tau^2 \coloneqq \sum_{i=1}^p \lambda_i^2,
\]
and the corresponding coefficient of determination is
\[
R^2 = \frac{\tau^2}{\tau^2+1}.
\]

This places the prior in the class of **R2-based priors**, where the global signal level is specified through \(R^2\) rather than through a direct prior on a global scale parameter. The grouped extension retains the original one-to-one relationship between \(R^2\) and total signal variance, but adds a structured variance split that respects known predictor partitions [2507.11833].

## 2. Two-stage decomposition of explained variance

The central construction decomposes total prior variance in two nested stages.

At **Stage I**, variance is allocated across groups by a simplex vector
\[
\phi = (\phi_1,\dots,\phi_G), \qquad \phi_g\ge 0,\quad \sum_{g=1}^G \phi_g=1,
\]
so that group \(g\) receives
\[
\tau_g^2 = \phi_g \tau^2.
\]

At **Stage II**, each group-specific variance is allocated within the group by
\[
\varphi_g = (\varphi_{g1},\dots,\varphi_{gp_g}), \qquad \varphi_{gl}\ge 0,\quad \sum_{l=1}^{p_g}\varphi_{gl}=1.
\]
This yields coefficient-specific variances
\[
\operatorname{Var}(b_{gl}) = \sigma^2 \lambda_{gl}^2 = \sigma^2 \varphi_{gl}\tau_g^2 = \sigma^2 \varphi_{gl}\phi_g \tau^2.
\]

The same hierarchy induces a group-wise explained variance
\[
R_g^2 = \frac{\operatorname{Var}(x_g'b_g)}{\operatorname{Var}(x'b)+\sigma^2} = \frac{\tau_g^2}{\tau^2+1} = \phi_g R^2.
\]
Hence the grouped construction makes group contributions directly interpretable as shares of total explained variance. If \(\phi\sim \mathrm{Dirichlet}(\alpha)\), then
\[
\left(\frac{R_1^2}{R^2},\dots,\frac{R_G^2}{R^2}\right)=\phi \sim \mathrm{Dirichlet}(\alpha),
\]
and, conditionally on \(R^2=r^2\),
\[
(R_1^2,\dots,R_G^2)\mid R^2=r^2 \sim r^2\,\mathrm{Dirichlet}(\alpha),
\]
with negative dependence across groups:
\[
\operatorname{Cov}(R_g^2,R_h^2\mid R^2=r^2) = -(r^2)^2 \frac{\alpha_g\alpha_h}{\alpha_0^2(\alpha_0+1)}, \qquad \alpha_0=\sum_{i=1}^G \alpha_i.
\]

This decomposition is the prior’s main structural innovation. It separates **overall model fit**, **between-group allocation**, and **within-group allocation** into distinct stochastic components, allowing sparsity to operate simultaneously at the group and coefficient levels [2507.11833].

## 3. Prior hierarchy and interpretation of hyperparameters

The complete prior takes the form
\[
\begin{aligned}
b_{gl} \mid \varphi_g,\phi,\tau^2,\sigma^2
 &\sim \mathcal{N}\!\left(0,\ \varphi_{gl}\phi_g\tau^2\sigma^2\right), \\
\phi &\sim \mathrm{Dirichlet}(\cdot), \\
\varphi_g &\sim \mathrm{Dirichlet}(\cdot), \\
\tau^2 &\sim \mathrm{BetaPrime}(\mu_{R^2}, \nu_{R^2}), \\
\sigma &\sim \pi(\sigma).
\end{aligned}
\]
In the main development, \(\phi\) and \(\varphi_g\) are often taken as **symmetric Dirichlet** distributions:
\[
\phi \sim \mathrm{Dirichlet}\, s(a_G), \qquad \varphi_g \sim \mathrm{Dirichlet}\, s(c_g).
\]
The prior on explained variance is
\[
R^2 \sim \mathrm{Beta}(a_1,a_2),
\]
with mean and precision
\[
\mu_{R^2} = \frac{a_1}{a_1+a_2}, \qquad \nu_{R^2}=a_1+a_2,
\]
which induces
\[
\tau^2 \sim \mathrm{BetaPrime}(a_1,a_2).
\]

The hyperparameters have distinct roles. The pair \(a_1,a_2\) governs the global prior on \(R^2\), hence overall signal strength and model complexity. The parameter \(a_G\) governs allocation across groups through \(\phi\), while \(c_g\) governs allocation within group \(g\) through \(\varphi_g\). The paper emphasizes the following interpretations:

- If \(a_G<1\), the Dirichlet on \(\phi\) concentrates near simplex corners, so only a few groups get most of the signal.
- If \(a_G=1\), allocation across groups is roughly uniform.
- If \(a_G>1\), variance is spread more evenly across groups.

Likewise:

- If \(c_g<1\), within-group allocation is sparse, favoring only a few active coefficients in each group.
- If \(c_g=1\), allocation within the group is roughly uniform.
- Larger \(c_g\) makes within-group shrinkage weaker and signal more spread out.

A particularly useful coupling is
\[
c_g = \frac{a_G}{p_g},
\]
which yields clean marginal distributions for coefficient variances and ensures that within-group shrinkage is typically stronger than group-level shrinkage [2507.11833].

## 4. Distributional properties and shrinkage behavior

Under the aligned choice \(a_G>0\), \(\tau^2\sim\mathrm{BetaPrime}(Ga_G,a_2)\), \(\phi\sim \mathrm{Dirichlet}\,s(a_G)\), and \(\varphi_g\sim\mathrm{Dirichlet}\,s(c_g)\) with \(c_g=a_G/p_g\), the paper proves two especially simple marginal results:
\[
\tau_g^2=\phi_g\tau^2 \sim \mathrm{BetaPrime}(a_G,a_2)
\quad \text{marginally and independently,}
\]
and
\[
\lambda_{gl}^2 = \varphi_{gl}\tau_g^2 \sim \mathrm{BetaPrime}(c_g,a_2).
\]

After integrating out the local variance, each coefficient has marginal density
\[
p(b_{gl}) = \frac{1}{\sqrt{2\pi}\, \mathrm{B}(c_g,a_2)} \Gamma(\eta)\, U(\eta,\nu_g,z_{gl}),
\]
where
\[
\eta = a_2+\frac12, \qquad \nu_g = \frac32-c_g, \qquad z_{gl}=\frac{|b_{gl}|^2}{2},
\]
and \(U(\cdot,\cdot,\cdot)\) is the confluent hypergeometric function of the second kind.

Its near-zero behavior depends sharply on \(c_g\). As \(|b_{gl}|\to 0\):

- If \(0<c_g<1/2\),
  \[
  p(b_{gl}) \sim c_1 |b_{gl}|^{2c_g-1} + \mathcal{O}(|b_{gl}|^{2c_g+1}),
  \]
  so the density is unbounded at zero.
- If \(c_g=1/2\),
  \[
  p(b_{gl}) \sim -c_2 \log(b_{gl}^2) + \mathcal{O}(b_{gl}^2\log b_{gl}^2),
  \]
  again singular at zero.
- If \(c_g>1/2\), the density is bounded and continuous at zero.

Its tail behavior is
\[
p(b_{gl}) \sim \mathcal{O}\!\left(|b_{gl}|^{-(2a_2+1)}\right)
\qquad \text{as } |b_{gl}|\to\infty.
\]
Thus \(a_2\) controls tail thickness; if \(0<a_2\le 1/2\), the tails are heavier than Cauchy. The special case
\[
c_g = a_2 = \frac12
\]
recovers the **horseshoe prior**, for which the prior has **bounded influence**, meaning
\[
\mathbb{E}(b\mid y^*) \approx y^* \quad \text{as } |y^*|\to\infty.
\]

The grouped hierarchy also admits a shrinkage-factor representation. In the normal means setting \(X=I\),
\[
\kappa_{gl}=\frac{1}{1+\lambda_{gl}^2}\in(0,1),
\]
and the posterior mean obeys
\[
\mathbb{E}(b_{gl}\mid y_{gl}) = \left(1-\mathbb{E}(\kappa_{gl}\mid y_{gl})\right)y_{gl}.
\]
The paper defines the effective number of nonzero coefficients as
\[
m_{\mathrm{eff}}=\sum_{i=1}^p (1-\kappa_i),
\]
with groupwise version
\[
m_{\mathrm{eff},g}=\sum_{l=1}^{p_g}(1-\kappa_{gl}), \qquad m_{\mathrm{eff}}=\sum_{g=1}^G m_{\mathrm{eff},g}.
\]
This supplies a direct prior-based measure of effective model complexity [2507.11833].

## 5. Relation to adjacent grouped \(R^2\)-based priors

The Group-R2 decomposition prior belongs to a broader line of work extending \(R^2\)-based shrinkage to structured variance allocation. A closely related formulation is the **Group R2D2 (gR2D2) prior**, which extends the original R2D2 prior to grouped variable selection by decomposing explained variance into **group-level** and **within-group** components [2412.15293]. In that construction,
\[
W_g = \sum_{j=1}^{p_g}\lambda_{gj}, \qquad W = \sum_{g=1}^G W_g,
\]
with
\[
R^2 = \frac{W}{W+1}, \qquad
R_g^2 = \frac{W_g}{W+1}, \qquad
\sum_{g=1}^G R_g^2 = R^2.
\]
The paper places a Dirichlet prior on
\[
(R_1^2,\ldots,R_G^2,\,1-R^2)\sim \mathsf{Dirichlet}(a_1,\ldots,a_G,b),
\]
and uses a **double exponential (Laplace)** coefficient prior with a scale-mixture representation. It also develops two within-group variants: **gR2D2-D**, with Dirichlet within-group allocation, and **gR2D2-L**, with logistic-normal within-group allocation. Relative to this formulation, the Group-R2 decomposition prior is best understood as a closely aligned two-stage \(R^2\)-decomposition framework stated directly in terms of \(\tau^2\), \(\phi\), and \(\varphi_g\).

A second adjacent development is the **Generalized Decomposition R2 (GDR2) prior**, which replaces the Dirichlet decomposition on the simplex with a **logistic-normal** prior to allow dependence structures beyond the negative dependence implied by the Dirichlet family [2401.10180]. In that framework,
\[
\phi \sim \mathrm{LogisticNormal}(\mu,\Sigma),
\]
and dependence is specified on the log-ratio scale through the additive log-ratio transform. The paper states that one may assign the same weight to a **group of variables** by setting \(\mu_i=c_i\) for \(i\in I\), and identifies incorporation of **covariate grouping or covariate dependency information** as a promising future direction. This suggests that the Group-R2 decomposition prior occupies the Dirichlet-centered end of a larger design space in which grouped variance decomposition can be made more flexible by replacing simplex priors rather than by changing the \(R^2\)-based hierarchy itself.

## 6. Empirical behavior and practical specification

Simulation results show that grouping helps most when signals are **distributed across multiple predictors within groups** or **mixed/randomly assigned** rather than concentrated in a single coefficient. In the lower-dimensional setting \((n=200,p=100)\), grouped priors improve predictive performance in distributed and mixed-signal scenarios, especially when \(R^2\) is high, and parameter recovery improves broadly, particularly for zero coefficients. In the high-dimensional setting \((n=200,p=500)\), the benefits of grouping become stronger, especially for distributed signals. By contrast, when the truth is **highly concentrated** in a small number of coefficients within each group, grouped priors can over-shrink true nonzero coefficients and may perform worse than non-grouped priors [2507.11833].

The paper gives practical guidance for hyperparameter specification. It recommends:

- \(a_2=0.5\) as a sensible default if heavy tails and robust treatment of large coefficients are desired.
- \(a_1=a_2=1\) for a uniform prior on \(R^2\).
- \(a_1=a_2=0.5\) for a bathtub-shaped prior, favoring either very small or very large \(R^2\).
- \(a_G<1\) when only a few groups are expected to matter.
- \(c_g<1\) when only a few coefficients within each group are expected to matter.
- \(a_G=1\) and \(c_g=1\) as a balanced default if group structure is known but sparsity pattern is not.

The paper further recommends calibrating hyperparameters by simulating the prior distribution of \(m_{\mathrm{eff}}\) or \(m_{\mathrm{eff},g}\), using effective model size as the operative measure of complexity. The reported **uniform prior configuration** was found to be a robust default when little is known about sparsity structure [2507.11833].

## 7. Scope, assumptions, and disambiguation

The prior assumes that **group structure is known in advance**. It is designed for settings with specified groups of predictors, and the paper explicitly notes that if groups are misspecified, variance may be allocated poorly, hurting inference. It also does **not** model unknown within-group dependence; it uses group membership rather than latent group discovery. A limiting case is \(p_g=1\), where the grouped model reduces to the ordinary R2-based coefficient-level prior [2507.11833].

The term should also be distinguished from a separate use of \(R_2\) in **multi-objective optimization**. The paper “Computing the Integral R2 Indicator by Perspective Mapping and Box Decomposition” studies the **continuous integral \(R_2\) indicator**, showing that it can be rewritten as a weighted measure of complements of unions of anchored boxes in reciprocal objective space [2606.30530]. That work provides a **decomposition-based structural interpretation** of integral \(R_2\), but it does **not** introduce a “Group-R2 Decomposition Prior” in a Bayesian or statistical-prior sense. The shared notation therefore masks two distinct literatures: one centered on \(R^2\)-based shrinkage in grouped regression, the other on decomposition methods for the integral \(R_2\) indicator in Pareto optimization.

In the Bayesian regression sense, the Group-R2 decomposition prior is most precisely characterized as a **two-stage variance decomposition prior on \(R^2\)**. Its distinguishing feature is not merely grouped shrinkage, but the fact that group relevance and within-group sparsity are both expressed as allocations of prior explained variance. This suggests an interpretation of grouped regularization in which the primary object is not the coefficient vector itself, but the structured partition of the model’s total explainable signal.

Source: https://www.emergentmind.com/topics/group-r2-decomposition-prior