TIENET_Solver: T-IENET Solver (native pathwise)

TIENET_SolverR Documentation

T-IENET Solver (native pathwise)

Description

Terminating Informed Elastic Net solver, native LARS homotopy on the group-ridge penalty (no augmented copies). The solver used internally by TRexGVSSelector for gvs_type = "IEN" with solver = "TIENET". Inherits all common methods from TSolver_Base.

Super class

TSolver_Base -> TIENET_Solver

Methods

Public methods

Inherited methods

TIENET_Solver$new()

Create a new TIENET_Solver.

Usage
TIENET_Solver$new(X, D, y, groups, options = tsolver_options())
Arguments
X

Numeric matrix of predictors in memory, or mmap_matrix (the handle of a memory-mapped file).

D

Numeric matrix of dummies in memory, or mmap_matrix, the handle of a memory-mapped file (a multiple of ncol(X) columns when lambda2 > 0: one group-aligned layer per p).

y

Numeric response vector.

groups

Integer vector of 1-based group ids, one per predictor column of X (contiguous ids starting at 1).

options

Solver options from tsolver_options; this solver reads lambda2 (the group-ridge penalty, >= 0).


TIENET_Solver$get_lambda()

Get the regularization (lambda) path.

Usage
TIENET_Solver$get_lambda()
Returns

Numeric vector of lambda values, one per step.


TIENET_Solver$get_lambda2()

Get the group-ridge penalty lambda2 used.

Usage
TIENET_Solver$get_lambda2()
Returns

Scalar numeric lambda2.


TIENET_Solver$get_groups()

Get the group ids (1-based, one per predictor).

Usage
TIENET_Solver$get_groups()
Returns

Integer vector of group ids.


TIENET_Solver$get_num_groups()

Get the number of disjoint groups.

Usage
TIENET_Solver$get_num_groups()
Returns

Integer count of groups.


TIENET_Solver$clone()

The objects of this class are cloneable with this method.

Usage
TIENET_Solver$clone(deep = FALSE)
Arguments
deep

Whether to make a deep clone.

References

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.

See Also

Other T-solvers: TACGP_Solver, TAFS_Solver, TCDENET_Solver, TCDIENET_Solver, TCDLASSO_Solver, TCDTIKNET_Solver, TENETAug_Solver, TENET_Solver, TGP_Solver, TIENETAug_Solver, TIKNET_Solver, TLARS_Solver, TLASSO_Solver, TMP_Solver, TNCGMP_Solver, TOMP_Solver, TOOLS_Solver, TSTAGEWISE_Solver, TSTEPWISE_Solver, tsolver_options()

Examples

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 <- TIENET_Solver$new(X, D, y, groups = groups,
                            options = tsolver_options(lambda2 = 0.1))
solver$execute_step(T_stop = 3)
solver$get_beta()


TRexSelector documentation built on Nov. 20, 2026, 5:09 p.m.