Blockwise & Grouped Patterns: Regression & Combinatorics

• Blockwise and grouped patterns are a framework combining structural sparsity in regression with symmetry in combinatorial patterns to enhance model interpretability.
• They use hierarchical priors and smooth surrogate optimization to achieve simultaneous inter- and intra-group sparsity, reducing false positives in high-dimensional data.
• Group actions in pattern theory enable tractable analysis of cyclic and symmetric structures, facilitating applications like wait-time analysis and nontransitive game strategies.

Blockwise and grouped patterns represent a foundational paradigm for structuring and analyzing both statistical models (notably in high-dimensional regression) and combinatorial objects (notably in the study of pattern-generating systems with symmetry). Two principal lines of research exemplify this paradigm: (1) the use of block-structured priors for grouped variable selection in regression models via nested spike-and-slab constructions, and (2) the study of patterns arising from group actions on words, particularly as applied to nontransitive games and wait-time analysis. These approaches exploit blockwise or group-level symmetries and constraints, often yielding substantial advantages in model selection, interpretability, and analytic tractability.

1. Blockwise Patterns in Grouped Variable Selection

In regression with grouped covariates, suppose $p$ features are partitioned into $m$ nonoverlapping groups $G_1, \dots, G_m$ of cardinalities $q_1, \dots, q_m$, with regression coefficients $\beta_g \in \mathbb{R}^{q_g}$. To model both between- and within-group sparsity, a nested spike-and-slab prior is introduced (Yen et al., 2011):

• Group-level prior: For each group $g$, a Bernoulli indicator $\gamma_g \sim \mathrm{Bern}(\theta_g)$ determines whether the group is active. Marginally, $\beta_g$ follows

$$f(\beta_g) = \theta_g\, \text{(slab density)} + (1-\theta_g)\, \delta_0(\|\beta_g\|_2),$$

where, with probability $1-\theta_g$, the entire subvector $m$0 is exactly zero.

• Within-group prior: Conditional on $m$1, each coordinate $m$2 receives its own spike-and-slab prior via a Bernoulli $m$3, i.e.,

$m$4

with $m$5.

This hierarchical construction can induce both exact block sparsity (entire groups zeroed out) and within-group sparsity (individual zeros within active blocks).

2. MAP Objective and Surrogate Optimization

The posterior mode estimation problem leads to an objective comprising both block- and coordinate-level penalties. For Gaussian regression $m$6, the negative log-posterior (up to additive constants) is:

$m$7

To render the problem tractable, each indicator is approximated by a smooth log-sum surrogate:

$m$8

which majorizes to weighted $m$9 and group-$G_1, \dots, G_m$0 penalties. The resulting surrogate, at iterate $G_1, \dots, G_m$1, is convex in $G_1, \dots, G_m$2:

$G_1, \dots, G_m$3

where $G_1, \dots, G_m$4 and $G_1, \dots, G_m$5.

3. Blockwise Coordinate-Descent Algorithms

The surrogate objective facilitates minimization via blockwise coordinate descent. For each group $G_1, \dots, G_m$6:

1. Zero-block test: The KKT subgradient at $G_1, \dots, G_m$7 yields the criterion

$G_1, \dots, G_m$8

where $G_1, \dots, G_m$9 and $q_1, \dots, q_m$0.

If true, set $q_1, \dots, q_m$1.

2. Nonzero-block update: Otherwise, a strictly convex quadratic problem yields

$q_1, \dots, q_m$2

with $q_1, \dots, q_m$3.

This two-stage procedure ensures exact block zeros and soft-thresholded updates within active blocks. Majorization-minimization is iterated until convergence.

4. Theoretical Guarantees and Label-Invariance

Under standard regularity on the design matrix $q_1, \dots, q_m$4 (e.g., restricted eigenvalue conditions) and appropriate growth rates for $q_1, \dots, q_m$5, key properties can be established (Yen et al., 2011):

• Estimation error bound: If the true support lies in $q_1, \dots, q_m$6 blocks covering $q_1, \dots, q_m$7 coordinates,

$q_1, \dots, q_m$8

with high probability. When $q_1, \dots, q_m$9 and $\beta_g \in \mathbb{R}^{q_g}$0, this can improve upon the lasso rate $\beta_g \in \mathbb{R}^{q_g}$1.

• Label-invariance: Provided $\beta_g \in \mathbb{R}^{q_g}$2, the estimator becomes asymptotically invariant to the choice of grouping as $\beta_g \in \mathbb{R}^{q_g}$3.
• Sign-consistency: Under Gaussian errors and $\beta_g \in \mathbb{R}^{q_g}$4, with no irrepresentable-type condition, $\beta_g \in \mathbb{R}^{q_g}$5.

These results indicate that block-structured priors can induce simultaneous inter- and intra-group sparsity with favorable finite-sample and asymptotic guarantees.

5. Pattern Formation by Group Action: Blockwise Reductions

A parallel formalism emerges in the combinatorics of patterns under group action (Khovanova et al., 2020). Let $\beta_g \in \mathbb{R}^{q_g}$6 be an alphabet of size $\beta_g \in \mathbb{R}^{q_g}$7, and $\beta_g \in \mathbb{R}^{q_g}$8 a group acting on $\beta_g \in \mathbb{R}^{q_g}$9 by permuting letters, which extends letterwise to words $g$0: $g$1.

• The orbit $g$2 and its stabilizer $g$3.
• The set of patterns of length $g$4 is identified with the set of orbits.

When $g$5 factors as a product or acts on blocks, there is often a bijection between patterns of length $g$6 and words of reduced length. The cyclic group $g$7 acting on $g$8 under Caesar shift exemplifies this principle: every pattern of length $g$9 is determined by its adjacency signature $\gamma_g \sim \mathrm{Bern}(\theta_g)$0. Thus, analysis of avoidance, generating functions, and waiting times for blockwise group patterns can be reduced to lower-dimensional classical problems.

6. Statistical and Combinatorial Consequences

Blockwise and grouped structures in both regression and pattern theory enforce structural constraints that shape model selection and pattern occurrence statistics:

• In regression, simulation [(Yen et al., 2011), Table 1] shows that the grouped variable selection via nested spike-and-slab (gvsnss) outperforms lasso and group lasso when support lies within a few groups, particularly when needing to detect within-group zeros. Specifically, in a scenario with $\gamma_g \sim \mathrm{Bern}(\theta_g)$1, $\gamma_g \sim \mathrm{Bern}(\theta_g)$2, $\gamma_g \sim \mathrm{Bern}(\theta_g)$3 active groups, and five within-group nonzeros per active group, gvsnss yields lower false positive rates (7.8%) and $\gamma_g \sim \mathrm{Bern}(\theta_g)$4 error (0.95), with 68% correct detection of within-group zeros, compared to higher false positive rates and lower within-group specificity for standard lasso and group lasso.
• In combinatorial pattern matching, blockwise group actions enable explicit calculation of pattern-based Conway leading numbers, expected wait times, and non-transitive game strategies, especially under cyclic and symmetric group action (see, e.g., Section 8 and 9 of (Khovanova et al., 2020)).

Method	FPR (%)	$\gamma_g \sim \mathrm{Bern}(\theta_g)$5	Within-group zero detections
lasso	24.5	1.04	0.21
group lasso	9.2	1.07	0.00
gvsnss	7.8	0.95	0.68

A plausible implication is that methodologies exploiting blockwise or grouped patterns, whether via hierarchical priors or group actions, support refined inference and analytic tractability in structured high-dimensional or symmetric settings.

7. Synthesis and Broader Implications

Blockwise and grouped patterns, manifested as either hierarchical priors in regression or as group actions partitioning word spaces, provide a unifying abstraction for imposing and exploiting structural constraints. In both settings, algorithms and theoretical results leverage block structure to improve selection specificity, estimation accuracy, and enable tractable computation or exact enumeration. These principles, demonstrated respectively by the gvsnss estimator for regression and group-action pattern theory in combinatorics, suggest broad applicability for model selection, symmetry exploitation, and the design of algorithms that require discrimination at multiple hierarchical or group levels (Yen et al., 2011, Khovanova et al., 2020).