Estimation of low rank density matrices: bounds in Schatten norms and other distances
暂无分享,去创建一个
[1] Gene H. Golub,et al. Matrix computations , 1983 .
[2] J. Aubin,et al. Applied Nonlinear Analysis , 1984 .
[3] C. Michelot. A finite algorithm for finding the projection of a point onto the canonical simplex of ∝n , 1986 .
[4] K. Audenaert,et al. Continuity bounds on the quantum relative entropy -- II , 2005, 1105.2656.
[5] Yoram Singer,et al. Efficient Learning of Label Ranking by Soft Projections onto Polyhedra , 2006, J. Mach. Learn. Res..
[6] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[7] Hartmut Klauck,et al. Interaction in Quantum Communication , 2006, IEEE Transactions on Information Theory.
[8] A. Fiacco. A Finite Algorithm for Finding the Projection of a Point onto the Canonical Simplex of R " , 2009 .
[9] Emmanuel J. Candès,et al. A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..
[10] Stephen Becker,et al. Quantum state tomography via compressed sensing. , 2009, Physical review letters.
[11] V. Koltchinskii,et al. Nuclear norm penalization and optimal rates for noisy low rank matrix completion , 2010, 1011.6256.
[12] V. Koltchinskii. Von Neumann Entropy Penalization and Low Rank Matrix Estimation , 2010, 1009.2439.
[13] Martin J. Wainwright,et al. Estimation of (near) low-rank matrices with noise and high-dimensional scaling , 2009, ICML.
[14] Emmanuel J. Candès,et al. The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.
[15] Emmanuel J. Candès,et al. Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements , 2011, IEEE Transactions on Information Theory.
[16] Karim Lounici. Optimal spectral norm rates for noisy low-rank matrix completion , 2011, 1110.5346.
[17] V. Koltchinskii,et al. Oracle inequalities in empirical risk minimization and sparse recovery problems , 2011 .
[18] Yi-Kai Liu,et al. Universal low-rank matrix recovery from Pauli measurements , 2011, NIPS.
[19] David Gross,et al. Recovering Low-Rank Matrices From Few Coefficients in Any Basis , 2009, IEEE Transactions on Information Theory.
[20] Yunmei Chen,et al. Projection Onto A Simplex , 2011, 1101.6081.
[21] Joel A. Tropp,et al. User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..
[22] Steven T. Flammia,et al. Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators , 2012, 1205.2300.
[23] Vladimir Koltchinskii. Sharp Oracle Inequalities in Low Rank Estimation , 2013, Empirical Inference.
[24] Pierre Alquier,et al. Rank penalized estimation of a quantum system , 2012, 1206.1711.
[25] V. Koltchinskii. A remark on low rank matrix recovery and noncommutative Bernstein type inequalities , 2013 .
[26] Yihong Wu,et al. Volume ratio, sparsity, and minimaxity under unitarily invariant norms , 2013, 2013 IEEE International Symposium on Information Theory.
[27] O. Klopp. Noisy low-rank matrix completion with general sampling distribution , 2012, 1203.0108.
[28] Dong Xia,et al. Optimal estimation of low rank density matrices , 2015, J. Mach. Learn. Res..