Von Neumann entropy penalization and low-rank matrix estimation

DOI10.1214/11-AOS926zbMath1246.62138arXiv1009.2439OpenAlexW2964300712MaRDI QIDQ449975

Vladimir I. Koltchinskii

Publication date: 3 September 2012

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1009.2439

zbMATH Keywords

empirical processesvon Neumann entropyquantum state tomographymatrix regressionnoncommutative Bernstein inequalityPauli basis

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Inequalities; stochastic orderings (60E15) Applications of statistics to physics (62P35) General mathematical topics and methods in quantum theory (81Q99)

Related Items (26)

Minimax nonparametric estimation of pure quantum states ⋮ Optimal large-scale quantum state tomography with Pauli measurements ⋮ Matrix completion via max-norm constrained optimization ⋮ Geometric inference for general high-dimensional linear inverse problems ⋮ A rank-corrected procedure for matrix completion with fixed basis coefficients ⋮ Estimation of low rank density matrices: bounds in Schatten norms and other distances ⋮ Self-calibration and biconvex compressive sensing ⋮ Uniform Hanson-Wright type concentration inequalities for unbounded entries via the entropy method ⋮ Convergence of the exponentiated gradient method with Armijo line search ⋮ Random perturbation of low rank matrices: improving classical bounds ⋮ Sparse and Low-Rank Matrix Quantile Estimation With Application to Quadratic Regression ⋮ On signal detection and confidence sets for low rank inference problems ⋮ Minimax estimation of low-rank quantum states and their linear functionals ⋮ Asymptotic equivalence of quantum state tomography and noisy matrix completion ⋮ Noisy low-rank matrix completion with general sampling distribution ⋮ Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion ⋮ Statistical inference for Bures-Wasserstein barycenters ⋮ Pseudo-Bayesian quantum tomography with rank-adaptation ⋮ Local asymptotic equivalence of pure states ensembles and quantum Gaussian white noise ⋮ Self-Calibration and Bilinear Inverse Problems via Linear Least Squares ⋮ Robust Schatten-\(p\) norm based approach for tensor completion ⋮ Low Rank Estimation of Similarities on Graphs ⋮ Nonparametric estimation of low rank matrix valued function ⋮ Rapid, robust, and reliable blind deconvolution via nonconvex optimization ⋮ Matrix estimation by universal singular value thresholding ⋮ Fast state tomography with optimal error bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimation of high-dimensional low-rank matrices
• Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
• Empirical processes with a bounded \(\psi_1\) diameter
• Sums of random Hermitian matrices and an inequality by Rudelson
• Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
• User-friendly tail bounds for sums of random matrices
• On almost randomizing channels with a short Kraus decomposition
• Majorizing measures and proportional subsets of bounded orthonormal systems
• Sparse recovery in convex hulls via entropy penalization
• A tail inequality for suprema of unbounded empirical processes with applications to Markov chains
• Weak convergence and empirical processes. With applications to statistics
• Empirical processes and random projections
• Exact matrix completion via convex optimization
• Non-asymptotic theory of random matrices: extreme singular values
• Interaction in Quantum Communication
• Strong converse for identification via quantum channels
• The Generic Chaining
• An Invitation to Quantum Tomography
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• A Simpler Approach to Matrix Completion
• Restricted strong convexity and weighted matrix completion: Optimal bounds with noise

This page was built for publication: Von Neumann entropy penalization and low-rank matrix estimation