TRexSelector R package guide

T-Rex+DA: dependent variables

Why dependent variables need a correction

The false discovery rate (FDR) guarantee of the T-Rex selector rests on the exchangeability of the null variables and the dummies along the solution path. Independent dummies are exchangeable with independent null variables. When the variables are strongly dependent, a null variable that is correlated with an active one enters the path earlier than an independent dummy would, so the dummies no longer mirror the nulls and the false discovery proportion (FDP) estimate becomes anti-conservative. The dependency-aware T-Rex selector (T-Rex+DA) [1] restores the control by estimating the dependency structure and by deflating the vote within groups of dependent variables. It has been applied to sparse index tracking with autoregressive and nearest-neighbour stock dependency models [2], [3].

An autoregressive design

The variables follow a first-order autoregressive (AR(1)) process across the columns with coefficient 0.7, and five of them are active.

set.seed(321)
n <- 100
p <- 100
rho <- 0.7
X <- matrix(0, n, p)
X[, 1] <- rnorm(n)
for (j in 2:p) X[, j] <- rho * X[, j - 1] + sqrt(1 - rho^2) * rnorm(n)
true_support <- c(10, 30, 50, 70, 90)
beta <- numeric(p)
beta[true_support] <- 2
y <- as.numeric(X %*% beta + rnorm(n))

The plain selector and the dependency-aware selector on the same data and the same seed.

plain <- TRexSelector$new(X, y, tFDR = 0.1, seed = 7, verbose = FALSE,
                          control = trex_control(K = 10))
plain$select()
da <- TRexDASelector$new(X, y, tFDR = 0.1, seed = 7, verbose = FALSE,
                         da_control = trex_da_control(da_method = "BT"),
                         control = trex_control(K = 10))
da$select()
data.frame(selector = c("T-Rex", "T-Rex+DA"),
           selected = c(length(plain$selected_indices), length(da$selected_indices)),
           FDP = c(trex_fdp(plain$selected_indices, true_support),
                   trex_fdp(da$selected_indices, true_support)),
           TPP = c(trex_tpp(plain$selected_indices, true_support),
                   trex_tpp(da$selected_indices, true_support)))
#>   selector selected       FDP TPP
#> 1    T-Rex        7 0.2857143 1.0
#> 2 T-Rex+DA        4 0.0000000 0.8

TRexDASelector inherits the fields of TRexSelector (selected_indices, fdp_hat_mat, T_stop, L, …) and adds the record of the dependency estimation.

da$da_method_used
#> [1] "BT"
da$rho_thresh
#> [1] 0.6980528
round(da$rho_grid, 3)
#>  [1] 0.521 0.590 0.609 0.618 0.632 0.654 0.672 0.682 0.688 0.692 0.698 0.701
#> [13] 0.707 0.717 0.722 0.726 0.743 0.758 0.770 1.000

The dependency methods

trex_da_control(da_method = ) chooses how the dependency is handled.

Method Dependency model Parameters
"BT" (default) binary tree: hierarchical clustering of the variables at correlation thresholds, the threshold is calibrated on a grid hc_linkage, hc_grid_length
"NN" nearest neighbours: a correlation-threshold sweep of the same form hc_grid_length
"AR1" first-order autoregressive: a variable is compared with its neighbours inside a window cor_coef (estimated when -2), rho_thr_DA
"EQUI" equi-correlated: a variable is compared with all other variables cor_coef (estimated when -2), rho_thr_DA

Each method stands for the dependency model of its paper and is made for data that follow that model. The binary tree method follows the hierarchical graphical model of [1]. It is made for variables that form disjoint groups of highly correlated variables, and it was studied with one active variable per group. The autoregressive method follows [3]. It is made for variables whose correlation decays with their distance in the column order, as in a first-order autoregressive process, and it does not assume one active variable per group. The nearest-neighbour method follows [2]. It is made for overlapping groups of highly correlated variables, as they are characteristic for stock returns. The equi-correlated method is made for variables that all share one correlation.

The binary tree method clusters the variables by correlation distance with the linkage hc_linkage (single by default), evaluates the FDP estimate at hc_grid_length correlation thresholds (the default 0 lets the core take \(\min(20, p)\) points) and keeps the threshold rho_thresh.

The binary tree method, the nearest-neighbour method and the prior groups evaluate every step on the whole grid of correlation thresholds. The L-loop and the T-loop read the FDP estimate at one of them, the reference threshold, which sits at three quarters of the grid (element 15 of the default 20). The selection then searches all cells of stopping time, voting level and threshold, and rho_thresh is the threshold of the cell it takes. The inherited fields fdp_hat_mat, phi_mat and phi_prime therefore hold the values at the reference threshold, while r_mat, v_thresh and the selection belong to rho_thresh. The values at every threshold are in FDP_hat_array_BT, Phi_array_BT and R_array_BT.

The autoregressive and equi-correlated methods draw the same independent dummies as the other methods and penalize the relative occurrences. The autoregressive method compares a variable with the neighbours inside a window that reaches ceiling(log(rho_thr_DA) / log(abs(cor_coef))) columns to each side, up to the first lag whose correlation abs(cor_coef)^lag has fallen to rho_thr_DA, a threshold in \([0, 1)\). The equi-correlated method compares a variable with all other variables and is skipped when abs(cor_coef) does not exceed rho_thr_DA. Both methods use the magnitude of the coefficient. Setting cor_coef to -2 estimates the coefficient from the data, and any other value outside \([-1, 1]\) gives a warning and is replaced by the estimate.

ar1 <- TRexDASelector$new(X, y, tFDR = 0.1, seed = 7, verbose = FALSE,
                          da_control = trex_da_control(da_method = "AR1"),
                          control = trex_control(K = 10))
ar1$select()
ar1$selected_indices
#> [1] 10 50 70
round(ar1$cor_coef, 3)
#> [1] 0.664

The penalty of the last step

All five methods penalize the relative occurrences in the same way. With \(\Phi_t(j)\) the relative occurrence of variable \(j\) after \(t\) included dummies (step \(t\) of the T-loop) and \(T\) the stopping time at which the path is evaluated, its last step, the selector works with

\[\Phi_t^{\mathrm{DA}}(j) = \Psi_T(j) \, \Phi_t(j), \qquad \Psi_T(j) = \frac{1}{2 - \min_{j'} |\Phi_T(j) - \Phi_T(j')|}, \qquad t = 1, \dots, T,\]

where \(j'\) runs over the variables that \(j\) is compared with, its group, its window or all other variables. A variable without a group gets \(\Psi_T(j) = 1/2\).

This is a deliberate deviation from the papers. Read literally, they recompute the penalty at every step, \(\Psi_t(j)\) from \(\Phi_t\), while the selector takes the penalty of the last step for all steps. The reason is the FDP estimator. It sums over the increments \(\Phi_t^{\mathrm{DA}}(j) - \Phi_{t-1}^{\mathrm{DA}}(j)\) and counts expected false discoveries only while no increment is negative. One penalty per variable keeps the increments non-negative. A penalty per step does not, because the penalty of a variable changes from step to step, and the FDP estimate then becomes too small.

A Monte Carlo comparison of the two constructions with 1,000 runs per setting on block, autoregressive and independent designs supports the choice. With the nearest-neighbour method the per-step penalty exceeded a target FDR of 0.1, with 0.15 on an independent design and 0.13 on a block design, where the last-step penalty gave 0.00 and 0.03. No setting had the last-step penalty above the target and the per-step penalty below it. The per-step penalty selected more variables only where its estimate was invalid, and on autoregressive designs the last-step penalty had the higher true positive rate. The methods "AR1" and "EQUI" used the per-step penalty up to TRexSelector 2.0.1, so their selections can differ slightly from earlier versions, while "BT", "NN" and the prior groups have always used the penalty of the last step.

Prior groups

When the groups of dependent variables are known, pass them as prior_groups, a list of integer vectors of length \(p\) with a group label per variable. The dependency estimation then runs within the given groups: hierarchical clustering inside each group, and the calibration grid is built from the within-group dendrogram heights. The deflation acts on data-driven neighbourhoods inside the known groups, never on the raw groups themselves. Several levels can be supplied, and their finest common refinement is the constraint.

blocks <- rep(1:10, each = 10)
pg <- TRexDASelector$new(X, y, tFDR = 0.1, seed = 7, verbose = FALSE,
                         da_control = trex_da_control(prior_groups = list(blocks)),
                         control = trex_control(K = 10))
pg$select()
pg$selected_indices
#> [1] 10 30 34 50 70 90 91

Greedy solvers under T-Rex+DA

The deflation relies on the spread of occurrences within a group of dependent variables. A greedy solver ("TOMP", "TOOLS", "TGP", "TACGP", "TMP", "TNCGMP" and "TAFS") picks the top candidate of a tie deterministically and removes that spread. The exchangeable-tie band restores it, since statistically indistinguishable top candidates within a correlated cluster are then picked uniformly at random per step. T-Rex+DA therefore runs a greedy solver with a band of 0.25 unless the control sets it. exch_tie_alpha in trex_control() takes another width, and 0 switches the band off. The path solvers ignore the option.

Without the band the greedy solvers can exceed the target FDR at a high correlation. In a Monte Carlo study on AR(1) designs with a correlation of 0.9 (1,000 runs per setting, target FDR 0.2) each of the seven greedy solvers had an FDR of 0.21 to 0.27 without the band and of 0.13 to 0.17 with it, at a true positive rate lower by 0.07 to 0.13. At correlations up to 0.8 the target held without the band as well, and the band cost 0.03 to 0.05 of the true positive rate there.

The study shows the control up to a correlation of 0.9. At 0.95 the target no longer held (500 runs per setting), with an FDR of up to 0.23 for the path solver "TLARS" and of up to 0.30 for "TOMP" with the band.

greedy <- TRexDASelector$new(X, y, tFDR = 0.1, seed = 7, verbose = FALSE,
                             da_control = trex_da_control(da_method = "BT"),
                             control = trex_control(solver = "TOMP", K = 10))
greedy$select()
greedy$selected_indices
#> [1] 10 30 50 70 90

Examples

The TRexSelector_Examples repository holds runnable demos and Monte Carlo studies of T-Rex+DA under autoregressive, block, heavy-tailed, grouped, nearest-neighbour and equi-correlated dependency, with their results and a README per demo, in R, Python and C++.

Bibliography

[1]
J. Machkour, M. Muma, and D. P. Palomar, “High-dimensional false discovery rate control for dependent variables,” Signal Process., vol. 234, 2025, doi: 10.1016/j.sigpro.2025.109990.
[2]
J. Machkour, D. P. Palomar, and M. Muma, “FDR-controlled portfolio optimization for sparse financial index tracking,” in Proc. IEEE int. Conf. Acoust., speech, signal process. (ICASSP), 2025, pp. 1–5. doi: 10.1109/ICASSP49660.2025.10890629.
[3]
J. Machkour, M. Muma, and D. P. Palomar, “FDR-controlled sparse index tracking with autoregressive stock dependency models,” in Proc. Eur. Signal process. Conf. (EUSIPCO), 2024, pp. 2662–2666. doi: 10.23919/EUSIPCO63174.2024.10715329.