Sparse zero-sum games as stable functional feature selection Sokolovska, N. Teytaud, O. Rizkalla, S. Consortium, M. Clement, K. /Zucker, Jean-Daniel In large-scale systems biology applications, features are structured in hidden functional categories whose predictive power is identical. Feature selection, therefore, can lead not only to a problem with a reduced dimensionality, but also reveal some knowledge on functional classes of variables. In this contribution, we propose a framework based on a sparse zero-sum game which performs a stable functional feature selection. In particular, the approach is based on feature subsets ranking by a thresholding stochastic bandit. We provide a theoretical analysis of the introduced algorithm. We illustrate by experiments on both synthetic and real complex data that the proposed method is competitive from the predictive and stability viewpoints. 2015 text https://www.documentation.ird.fr/hor/fdi:010065259 fdi:010065259 Sokolovska N., Teytaud O., Rizkalla S., Consortium M., Clement K., Zucker Jean-Daniel. Sparse zero-sum games as stable functional feature selection. 2015, 10 (9), e0134683 [16 p.] EN