activity
20212024
most citedSpurious Valleys, NP-hardness, and Tractability of Sparse Matrix Factorization With Fixed Support

2 citations · 2 across the 7 of their papers we have counts for

collaborators

7 papers

math.OC2024

Butterfly factorization with error guarantees

Quoc-Tung Le, Léon Zheng, Elisa Riccietti +1

In this paper, we investigate the butterfly factorization problem, i.e., the problem of approximating a matrix by a product of sparse and structured factors. We propose a new forma…

cs.LG2024

Fast Inference with Kronecker-Sparse Matrices

Antoine Gonon, Léon Zheng, Pascal Carrivain +1

Kronecker-sparse (KS) matrices -- whose supports are Kronecker products of identity and all-ones blocks -- underpin the structure of Butterfly and Monarch matrices and offer the pr…

cs.NE2023

Does a sparse ReLU network training problem always admit an optimum?

Quoc-Tung Le, Elisa Riccietti, Rémi Gribonval

Given a training set, a loss function, and a neural network architecture, it is often taken for granted that optimal network parameters exist, and a common practice is to apply ava…

cs.LG2023

Sparsity in neural networks can improve their privacy

Antoine Gonon, Léon Zheng, Clément Lalanne +3

This article measures how sparsity can make neural networks more robust to membership inference attacks. The obtained empirical results show that sparsity improves the privacy of t…

cs.CR2023

Can sparsity improve the privacy of neural networks?

Antoine Gonon, Léon Zheng, Clément Lalanne +3

Sparse neural networks are mainly motivated by ressource efficiency since they use fewer parameters than their dense counterparts but still reach comparable accuracies. This articl…

cs.DS2022

Towards Better Bounds for Finding Quasi-Identifiers

Ryan Hildebrant, Quoc-Tung Le, Duy-Hoang Ta +1

We revisit the problem of finding small -separation keys introduced by Motwani and Xu (2008). In this problem, the input is -dimensional tuples . The goa…

cs.CC2021★ 2 cited

Spurious Valleys, NP-hardness, and Tractability of Sparse Matrix Factorization With Fixed Support

Quoc-Tung Le, Elisa Riccietti, Rémi Gribonval

The problem of approximating a dense matrix by a product of sparse factors is a fundamental problem for many signal processing and machine learning tasks. It can be decomposed into…