Some Observations on Lazy FSCA and its Performance Bounds

Seán McLoone*, Federico Zocco

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

26 Downloads (Pure)


Greedy search algorithms are a practical approach to approximating the solution of optimal subset selection problems, such as selecting the optimum model inputs from a set of candidate features. When a submodularity property holds for the feature selection metric, an efficient ‘lazy’ implementation can be employed. Recently, the authors have shown that a lazy implementation of Forward Selection Component Analysis (Lazy FSCA) yields comparable performance to FSCA, even though its selection metric (variance explained) is not submodular. In this paper we empirically investigate the sensitivity of Lazy FSCA to submodularity violations and provide a comparative assessment of a number of theoretical greedy search performance bounds that apply to FSCA. Using a diverse range of real world datasets and extensive Monte Carlo simulations we show that even though violations in submodularity can be frequent, the impact on variance explained tends to be minimal. This is true even when there are large deviations in the sequence of selected variables, which can arise with highly correlated datasets. In addition, the available performance bounds are shown to be very conservative and a poor reflection of the true performance of FSCA/Lazy FSCA.
Original languageEnglish
Number of pages8
Publication statusAccepted - 13 May 2022
Event6th IFAC International Conference on Intelligent Control and Automation Sciences - Cluj-Napoca, Romania
Duration: 13 Jul 202215 Jul 2022
Conference number: 6


Conference6th IFAC International Conference on Intelligent Control and Automation Sciences
Abbreviated titleICONS 2022
Internet address


Dive into the research topics of 'Some Observations on Lazy FSCA and its Performance Bounds'. Together they form a unique fingerprint.

Cite this