Base Class for a Collection of Models over a Sparsity Path
Source:R/NormalBlockCollectionSparsity.R
NormalBlockCollectionSparsity.RdShared scaffolding for [NormalBlockVarCollectionSparsity] and [NormalBlockMeanCollectionSparsity]: the warm-started path traversal, the penalty lookup and the criteria plot. Concrete subclasses derive the penalty grid in their `initialize()` and provide their own `get_best_model()` (only the variance-block family offers StARS).
Super class
NormalBlockCollection -> NormalBlockCollectionSparsity
Active bindings
qnumber of blocks
blocksgroup matrix or number of blocks
sparsitylist of sparsity penalties
Methods
Inherited methods
NormalBlockCollectionSparsity$optimize()
optimizes every model in the sparsity path, warm-starting each one (after the first) from the previous, adjacent penalty's converged parameters (see the family's base class's `warm_start_from()`) instead of re-deriving everything from the heuristic clustering, the way the generic [NormalBlockCollection] `optimize()` would. `blocks` (hence q) is fixed across the whole path, only the sparsity penalty changes, so the warm start is always between models of matching shape.
Usage
NormalBlockCollectionSparsity$optimize(
control = list(niter = 500, threshold = 1e-04, verbose = TRUE)
)NormalBlockCollectionSparsity$get_model()
returns the NormalBlockVarKnownClusters model corresponding to given penalty
NormalBlockCollectionSparsity$plot()
Display various outputs (goodness-of-fit criteria, robustness, diagnostic) associated with a collection of network fits (a collection)
Usage
NormalBlockCollectionSparsity$plot(
criteria = c("deviance", "BIC", "EBIC", "ICL"),
log.x = TRUE
)