Optimal Schatten-q and Ky-Fan-k Norm Rate of Low Rank Matrix Estimation

03/25/2014
∙
by   Dong Xia, et al.
∙
0
∙

In this paper, we consider low rank matrix estimation using either matrix-version Dantzig Selector Â_λ^d or matrix-version LASSO estimator Â_λ^L. We consider sub-Gaussian measurements, i.e., the measurements X_1,...,X_n∈R^m× m have i.i.d. sub-Gaussian entries. Suppose rank(A_0)=r. We proved that, when n≥ Cm[r^2∨ r(m)(n)] for some C>0, both Â_λ^d and Â_λ^L can obtain optimal upper bounds(except some logarithmic terms) for estimation accuracy under spectral norm. By applying metric entropy of Grassmann manifolds, we construct (near) matching minimax lower bound for estimation accuracy under spectral norm. We also give upper bounds and matching minimax lower bound(except some logarithmic terms) for estimation accuracy under Schatten-q norm for every 1≤ q≤∞. As a direct corollary, we show both upper bounds and minimax lower bounds of estimation accuracy under Ky-Fan-k norms for every 1≤ k≤ m.

READ FULL TEXT

Please sign up or login with your details

Continue with:
Or login with email
Enter Password
Re-enter Password

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro

Subscribe to DeepAI Pro
DeepAI Pro
Provides a limited generation allowance each month. When exceeded, you are charged overage rates available at deepai.org/pricing. Also includes an ad-free experience and API access. Renews automatically until canceled. Non-refundable.
Subtotal
Total due today

Payment

Add DeepAI credits
DeepAI credits
One-time purchase. Credits are added to your wallet after payment.
Subtotal
Total due today

Payment