| TIENETAug_Solver | R Documentation |
Terminating Informed Elastic Net solver via row augmentation (TIENETAug).
The group-ridge penalty (one augmented row per group, scaled by
sqrt(lambda2)) is encoded in an augmented data system solved by an
inner T-LASSO (or pure T-LARS) path. This is the solver used internally by
TRexGVSSelector for gvs_type = "IEN".
Inherits all common methods from TSolver_Base.
TSolver_Base -> TIENETAug_Solver
TSolver_Base$clear_warnings()TSolver_Base$execute_step()TSolver_Base$get_actions()TSolver_Base$get_active_dummy_indices()TSolver_Base$get_active_predictor_indices()TSolver_Base$get_actives()TSolver_Base$get_beta()TSolver_Base$get_beta_path()TSolver_Base$get_cp()TSolver_Base$get_cp_with_sigma()TSolver_Base$get_dof()TSolver_Base$get_dropped_indices()TSolver_Base$get_dummy_start_index()TSolver_Base$get_inactives()TSolver_Base$get_intercept()TSolver_Base$get_memory_bytes()TSolver_Base$get_num_actives()TSolver_Base$get_num_steps()TSolver_Base$get_num_threads()TSolver_Base$get_r2()TSolver_Base$get_residuals()TSolver_Base$get_rss()TSolver_Base$get_warnings()TSolver_Base$is_connected()TSolver_Base$load()TSolver_Base$restore()TSolver_Base$save()TSolver_Base$set_exchangeable_tie()TSolver_Base$set_num_threads()TSolver_Base$set_tie_seed()TSolver_Base$set_tolerance()TSolver_Base$solver_type_to_string()TIENETAug_Solver$new()Create a new TIENETAug_Solver.
TIENETAug_Solver$new(X, D, y, groups, options = tsolver_options())
XNumeric matrix of predictors in memory, or mmap_matrix
(the handle of a memory-mapped file).
DNumeric matrix of dummies in memory, or mmap_matrix
(the handle of a memory-mapped file).
yNumeric response vector.
groupsInteger vector of 1-based group ids, one per predictor
column of X (contiguous ids starting at 1).
optionsSolver options from tsolver_options; this
solver reads lambda2 (the group-ridge penalty, >= 0) and
tenet_aug_use_lars (run the inner path with a pure-LARS
solver that never drops variables).
TIENETAug_Solver$get_lambda2()Get the group-ridge penalty lambda2 used.
TIENETAug_Solver$get_lambda2()
Scalar numeric lambda2.
TIENETAug_Solver$get_groups()Get the group ids (1-based, one per predictor).
TIENETAug_Solver$get_groups()
Integer vector of group ids.
TIENETAug_Solver$get_num_groups()Get the number of disjoint groups.
TIENETAug_Solver$get_num_groups()
Integer group count.
TIENETAug_Solver$clone()The objects of this class are cloneable with this method.
TIENETAug_Solver$clone(deep = FALSE)
deepWhether to make a deep clone.
J. Machkour, M. Muma, and D. P. Palomar, "The Informed Elastic Net for Fast Grouped Variable Selection and FDR Control in Genomics Research," in Proc. IEEE 9th Int. Workshop Comput. Adv. Multi-Sensor Adapt. Process. (CAMSAP), 2023, pp. 466-470.
H. Zou and T. Hastie, "Regularization and Variable Selection via the Elastic Net," J. R. Stat. Soc. Ser. B Stat. Methodol., vol. 67, no. 2, pp. 301-320, 2005.
B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, "Least Angle Regression," Ann. Statist., vol. 32, no. 2, pp. 407-499, 2004.
J. Machkour, M. Muma, and D. P. Palomar, "The Terminating-Random Experiments Selector: Fast High-Dimensional Variable Selection with False Discovery Rate Control," Signal Process., vol. 231, Art. no. 109894, 2025, doi: 10.1016/j.sigpro.2025.109894.
Other T-solvers:
TACGP_Solver,
TAFS_Solver,
TCDENET_Solver,
TCDIENET_Solver,
TCDLASSO_Solver,
TCDTIKNET_Solver,
TENETAug_Solver,
TENET_Solver,
TGP_Solver,
TIENET_Solver,
TIKNET_Solver,
TLARS_Solver,
TLASSO_Solver,
TMP_Solver,
TNCGMP_Solver,
TOMP_Solver,
TOOLS_Solver,
TSTAGEWISE_Solver,
TSTEPWISE_Solver,
tsolver_options()
set.seed(1)
n <- 20; p <- 4
X <- matrix(rnorm(n * p), n, p)
D <- matrix(rnorm(n * p), n, p)
y <- X[, 1] * 2 + rnorm(n)
groups <- c(1, 1, 2, 2) # 1-based group id per predictor
solver <- TIENETAug_Solver$new(X, D, y, groups = groups,
options = tsolver_options(lambda2 = 0.1))
solver$execute_step(T_stop = 3)
solver$get_beta()
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.