If these two assumptions were to be met, features can be removed in larger batches without affecting their ranking and the highest mean validation score can be found using a line search method, such as dichotomous search, the golden section method or the Fibonacci method [1]}. Given the above, one can select the same number of features as RFE without having to remove one feature at a time. The FRFE and \(k\) -SRFE algorithms described below rely on these assumptions and offer two alternatives to determining the number of features to select.
