3 citations · 5 across the 6 of their papers we have counts for
6 papers
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…
Butterfly factorization by algorithmic identification of rank-one blocks
Léon Zheng, Gilles Puy, Elisa Riccietti +2
Many matrices associated with fast transforms posess a certain low-rank property characterized by the existence of several block partitionings of the matrix, where each block is of…
URGLQ: An Efficient Covariance Matrix Reconstruction Method for Robust Adaptive Beamforming
Tao Luo, Peng Chen, Zhenxin Cao +2
The computational complexity of the conventional adaptive beamformer is relatively large, and the performance degrades significantly due to the model mismatch errors and the unwant…
Self-supervised learning with rotation-invariant kernels
Léon Zheng, Gilles Puy, Elisa Riccietti +2
We introduce a regularization loss based on kernel mean embeddings with rotation-invariant kernels on the hypersphere (also known as dot-product kernels) for self-supervised learni…
Identifiability in Two-Layer Sparse Matrix Factorization
Léon Zheng, Elisa Riccietti, Rémi Gribonval
Sparse matrix factorization is the problem of approximating a matrix by a product of sparse factors .…
Efficient Identification of Butterfly Sparse Matrix Factorizations
Léon Zheng, Elisa Riccietti, Rémi Gribonval
Fast transforms correspond to factorizations of the form , where each factor is sparse and possibly st…