Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2001.06970
Cited By
Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applications
20 January 2020
Qing Qu
Zhihui Zhu
Xiao Li
M. Tsakiris
John N. Wright
René Vidal
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applications"
17 / 17 papers shown
SPEAR++: Scaling Gradient Inversion via Sparsely-Used Dictionary Learning
Alexander Bakarsky
Dimitar I. Dimitrov
Maximilian Baader
Martin Vechev
FedML
134
0
0
28 Oct 2025
Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices
V. Bhattiprolu
Venkatesan Guruswami
Euiwoong Lee
Xuandi Ren
300
1
0
03 Oct 2024
Sparse PCA Beyond Covariance Thresholding
Annual Conference Computational Learning Theory (COLT), 2023
Gleb Novikov
268
2
0
20 Feb 2023
SQ Lower Bounds for Random Sparse Planted Vector Problem
International Conference on Algorithmic Learning Theory (ALT), 2023
Jingqiu Ding
Yiding Hua
267
4
0
26 Jan 2023
Neural Collapse with Normalized Features: A Geometric Analysis over the Riemannian Manifold
Neural Information Processing Systems (NeurIPS), 2022
Can Yaras
Peng Wang
Zhihui Zhu
Laura Balzano
Qing Qu
334
55
0
19 Sep 2022
On the Optimization Landscape of Neural Collapse under MSE Loss: Global Optimality with Unconstrained Features
International Conference on Machine Learning (ICML), 2022
Jinxin Zhou
Xiao Li
Tian Ding
Chong You
Qing Qu
Zhihui Zhu
480
119
0
02 Mar 2022
Implicit Bias of Projected Subgradient Method Gives Provable Robust Recovery of Subspaces of Unknown Codimension
International Conference on Learning Representations (ICLR), 2022
Paris V. Giampouras
B. Haeffele
René Vidal
168
1
0
22 Jan 2022
Lattice-Based Methods Surpass Sum-of-Squares in Clustering
Ilias Zadik
M. Song
Alexander S. Wein
Joan Bruna
407
42
0
07 Dec 2021
Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation
Florian Bernard
Zorah Lähner
J. Thunberg
368
14
0
30 Sep 2021
Optimal Spectral Recovery of a Planted Vector in a Subspace
Cheng Mao
Alexander S. Wein
300
27
0
31 May 2021
A Geometric Analysis of Neural Collapse with Unconstrained Features
Neural Information Processing Systems (NeurIPS), 2021
Zhihui Zhu
Tianyu Ding
Jinxin Zhou
Xiao Li
Chong You
Jeremias Sulam
Qing Qu
356
248
0
06 May 2021
A Riemannian smoothing steepest descent method for non-Lipschitz optimization on submanifolds
Chao Zhang
Xiaojun Chen
Shiqian Ma
167
9
0
09 Apr 2021
Convolutional Normalization: Improving Deep Convolutional Network Robustness and Training
Neural Information Processing Systems (NeurIPS), 2021
Sheng Liu
Xiao Li
Yuexiang Zhai
Chong You
Zhihui Zhu
C. Fernandez‐Granda
Qing Qu
239
28
0
01 Mar 2021
From Symmetry to Geometry: Tractable Nonconvex Problems
Yuqian Zhang
Qing Qu
John N. Wright
421
48
0
14 Jul 2020
Robust Recovery via Implicit Bias of Discrepant Learning Rates for Double Over-parameterization
Chong You
Zhihui Zhu
Qing Qu
Yi-An Ma
188
43
0
16 Jun 2020
Depth Descent Synchronization in
S
O
(
D
)
\mathrm{SO}(D)
SO
(
D
)
International Journal of Computer Vision (IJCV), 2020
Tyler Maunu
Gilad Lerman
MDE
334
2
0
13 Feb 2020
A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution
Neural Information Processing Systems (NeurIPS), 2019
Qing Qu
Xiao Li
Zhihui Zhu
350
31
0
28 Aug 2019
1
Page 1 of 1
