Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and
Applications

Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applications

20 January 2020

Qing Qu

Papers citing "Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applications"

7 / 7 papers shown

Title
SQ Lower Bounds for Random Sparse Planted Vector Problem Jingqiu Ding Yiding Hua 24 4 0 26 Jan 2023
Neural Collapse with Normalized Features: A Geometric Analysis over the Riemannian Manifold Can Yaras Peng Wang Zhihui Zhu Laura Balzano Qing Qu 25 42 0 19 Sep 2022
On the Optimization Landscape of Neural Collapse under MSE Loss: Global Optimality with Unconstrained Features Jinxin Zhou Xiao Li Tian Ding Chong You Qing Qu Zhihui Zhu 35 101 0 02 Mar 2022
Lattice-Based Methods Surpass Sum-of-Squares in Clustering Ilias Zadik M. Song Alexander S. Wein Joan Bruna 17 35 0 07 Dec 2021
Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation Florian Bernard Daniel Cremers J. Thunberg 42 8 0 30 Sep 2021
A Geometric Analysis of Neural Collapse with Unconstrained Features Zhihui Zhu Tianyu Ding Jinxin Zhou Xiao Li Chong You Jeremias Sulam Qing Qu 40 197 0 06 May 2021
$Depth Descent Synchronization in $\mathrm{SO}(D)$$ Depth Descent Synchronization in $\mathrm{SO}(D)$ Tyler Maunu Gilad Lerman MDE 37 2 0 13 Feb 2020