Structured Support Exploration for Multilayer Sparse Matrix Factorization. - Quoc-Tung Le; Rémi Gribonval (ICASSP, 2021)

Spurious Valleys, Spurious Minima and NP-hardness of Sparse Matrix Factorization With Fixed Support. - Quoc-Tung Le; Elisa Riccietti; Rémi Gribonval (CoRR, 2021)

Fast Learning of Fast Transforms, with Guarantees. - Quoc-Tung Le; Léon Zheng; Elisa Riccietti; Rémi Gribonval (ICASSP, 2022)

Does a sparse ReLU network training problem always admit an optimum ? - Quoc-Tung Le; Rémi Gribonval; Elisa Riccietti (NeurIPS, 2023)

Towards Better Bounds for Finding Quasi-Identifiers. - Ryan Hildebrant; Quoc-Tung Le; Duy-Hoang Ta 001; Hoa T. Vu (PODS, 2023)

Sparsity in neural networks can increase their privacy. - Antoine Gonon; Léon Zheng; Clément Lalanne; Quoc-Tung Le; Guillaume Lauga; Can Pouliquen (CoRR, 2023)

Asymptotic nonnegative rank of matrices. - Quoc-Tung Le; Hoang Ta 001 (CoRR, 2023)

Algorithmic and theoretical aspects of sparse deep neural networks. (Aspects algorithmiques et th 'eoriques des r 'eseaux de neurones profonds parcimonieux). - Quoc-Tung Le (2023)

Spurious Valleys, NP-Hardness, and Tractability of Sparse Matrix Factorization with Fixed Support. - Quoc-Tung Le; Elisa Riccietti; Rémi Gribonval (SIAM J. Matrix Anal. Appl., 2023)

On the Asymptotic Nonnegative Rank of Matrices and its Applications in Information Theory. - Yeow Meng Chee; Quoc-Tung Le; Hoang Ta 001 (ISIT, 2024)

Make Inference Faster: Efficient GPU Memory Management for Butterfly Sparse Matrix Multiplication. - Antoine Gonon; Léon Zheng; Pascal Carrivain; Quoc-Tung Le (CoRR, 2024)

Geometric and computational hardness of bilevel programming. - Jérôme Bolte; Quoc-Tung Le; Edouard Pauwels; Samuel Vaiter (CoRR, 2024)