Fetching the paper…
Reading the bibliography…
Matrix sensing has many real-world applications in science and engineering, such as system control, distance embedding, and computer vision.
Interior-point polynomial algorithms in convex programming
Yurii Nesterov and Arkadii Nemirovskii · 1994
Earlier work this paper cites.
An interior-point method for semidefinite programming
Christoph Helmberg, Franz Rendl, Robert J Vanderbei, and Henry Wolkowicz · 1996
Earlier work this paper cites.
The learnability of quantum states
Scott Aaronson · 2007
Earlier work this paper cites.
Large deviations of vector-valued martingales in 2-smooth normed spaces
Anatoli Juditsky and Arkadii S Nemirovski · 2008
Earlier work this paper cites.
Kiryung Lee and Yoram Bresler · 2009
Earlier work this paper cites.
Guaranteed rank minimization via singular value projection
Prateek Jain, Raghu Meka, and Inderjit Dhillon · 2010
Earlier work this paper cites.
Interior-point method for nuclear norm approximation with application to system identification
Zhang Liu and Lieven Vandenberghe · 2010
Earlier work this paper cites.
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
Benjamin Recht, Maryam Fazel, and Pablo A Parrilo · 2010
Earlier work this paper cites.
Robust principal component analysis?
Emmanuel J. Candès, Xiaodong Li, Yi Ma, and John Wright · 2011
Earlier work this paper cites.
Universal low-rank matrix recovery from pauli measurements
Yi-Kai Liu · 2011
Earlier work this paper cites.
Sparcs: Recovering low-rank and sparse matrices from compressive measurements
Andrew Waters, Aswin Sankaranarayanan, and Richard Baraniuk · 2011
Earlier work this paper cites.
Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
Steven T Flammia, David Gross, Yi-Kai Liu, and Jens Eisert · 2012
Earlier work this paper cites.
Localization from incomplete noisy distance measurements
Adel Javanmard and Andrea Montanari · 2013
Earlier work this paper cites.
Path finding methods for linear programming: Solving linear programs in o (vrank) iterations and faster algorithms for maximum flow
Yin Tat Lee and Aaron Sidford · 2014
Cited alongside, same era.
Rop: Matrix recovery via rank-one projections
T Tony Cai and Anru Zhang · 2015
Cited alongside, same era.
Quantum tomography protocols with positivity are compressed sensing protocols
Amir Kalev, Robert L Kosut, and Ivan H Deutsch · 2015
Cited alongside, same era.
Efficient inverse maintenance and faster algorithms for linear programming
Yin Tat Lee and Aaron Sidford · 2015
Cited alongside, same era.
A faster cutting plane method and its implications for combinatorial and convex optimization
Yin Tat Lee, Aaron Sidford, and Sam Chiu-wai Wong · 2015
Cited alongside, same era.
A deterministic linear program solver in current matrix multiplication time
Jan van den Brand · 2020
Later among the works it cites.
A faster interior point method for semidefinite programming
Haotian Jiang, Tarun Kathuria, Yin Tat Lee, Swati Padmanabhan, and Zhao Song · 2020
Later among the works it cites.
An improved cutting plane method for convex optimization, convex-concave games, and its applications
Haotian Jiang, Yin Tat Lee, Zhao Song, and Sam Chiu-wai Wong · 2020
Later among the works it cites.
A nearly-linear time algorithm for linear programs with small treewidth: A multiscale representation of robust central path
Sally Dong, Yin Tat Lee, and Guanghao Ye · 2021
Later among the works it cites.
Faster dynamic matrix inverse for faster lps
Shunhua Jiang, Zhao Song, Omri Weinstein, and Hengjie Zhang · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Kai Zhong, Prateek Jain, and Inderjit S Dhillon · 2015
Cited alongside, same era.
Low-rank solutions of linear matrix equations via procrustes flow
Stephen Tu, Ross Boczar, Max Simchowitz, Mahdi Soltanolkotabi, and Ben Recht · 2016
Cited alongside, same era.
Low rank matrix recovery from rank one measurements
Richard Kueng, Holger Rauhut, and Ulrich Terstiege · 2017
Cited alongside, same era.
A unified computational and statistical framework for nonconvex low-rank matrix estimation
Lingxiao Wang, Xiao Zhang, and Quanquan Gu · 2017
Cited alongside, same era.
Solving linear programs in the current matrix multiplication time
Michael B. Cohen, Yin Tat Lee, and Zhao Song · 2019
Cited alongside, same era.
Nonconvex matrix factorization from rank-one measurements
Yuanxin Li, Cong Ma, Yuxin Chen, and Yuejie Chi · 2019
Cited alongside, same era.
Solving empirical risk minimization in the current matrix multiplication time
Yin Tat Lee, Zhao Song, and Qiuyi Zhang · 2019
Cited alongside, same era.
Oblivious sketching-based central path method for solving linear programming problems
Zhao Song and Zheng Yu · 2021
Later among the works it cites.
Does preprocessing help training over-parameterized neural networks?
Zhao Song, Shuo Yang, and Ruizhe Zhang · 2021
Later among the works it cites.
Training multi-layer over-parametrized neural network in subquadratic time
Zhao Song, Lichen Zhang, and Ruizhe Zhang · 2021
Later among the works it cites.
A faster small treewidth sdp solver
Yuzhou Gu and Zhao Song · 2022
Later among the works it cites.
Solving sdp faster: A robust ipm framework and efficient implementation
Baihe Huang, Shunhua Jiang, Zhao Song, Runzhou Tao, and Ruizhe Zhang · 2022
Later among the works it cites.
Training overparametrized neural networks in sublinear time
Hang Hu, Zhao Song, Omri Weinstein, and Danyang Zhuo · 2022
Later among the works it cites.
An improved sample complexity for rank-1 matrix sensing
Yichuan Deng, Zhihang Li, and Zhao Song · 2023
Closest in time.
An online and unified algorithm for projection matrix vector multiplication with application to empirical risk minimization
Liank Qin, Zhao Song, Lichen Zhang, and Danyang Zhuo · 2023
Closest in time.