Lower Bounds on the Mean-Squared Error of Low-Rank Matrix Reconstruction

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower bounds for the low-rank matrix approximation

Low-rank matrix recovery is an active topic drawing the attention of many researchers. It addresses the problem of approximating the observed data matrix by an unknown low-rank matrix. Suppose that A is a low-rank matrix approximation of D, where D and A are [Formula: see text] matrices. Based on a useful decomposition of [Formula: see text], for the unitarily invariant norm [Formula: see text]...

متن کامل

Root Mean Squared Error

• Predictive Accuracy Measures. These measures evaluate how close the recommender system came to predicting actual rating/utility values. • Classification Accuracy Measures. These measures evaluate the frequency with which a recommender system makes correct/incorrect decisions regarding items. • Rank Accuracy Measures. These measures evaluate the correctness of the ordering of items performed b...

متن کامل

Upper Bounds on the Error of Sparse Vector and Low-Rank Matrix Recovery

Suppose that a solution x̃ to an underdetermined linear system b = Ax is given. x̃ is approximately sparse meaning that it has a few large components compared to other small entries. However, the total number of nonzero components of x̃ is large enough to violate any condition for the uniqueness of the sparsest solution. On the other hand, if only the dominant components are considered, then it wi...

متن کامل

Competitive Mean-Squared Error Beamforming

Beamforming methods are used extensively in a variety of different areas, where one of their main goals is to estimate the source signal amplitude s(t) from the array observations y(t) = s(t)a + i(t) + e(t), t = 1,2,..., where a is the steering vector, i(t) is the interference, and e(t) is a Gaussian noise vector [1, 2]. To estimate s(t), we may use a beamformer with weights w so that s(t) = w*...

متن کامل

Optimal Mean Squared Error Imaging

The problem of forming images that are optimal with respect to a Mean Square Error (MSE) criterion, based on nite data, is considered. First, it is shown that the MSE criterion is consistent with the general goal of classifying images, in that decreasing the MSE guarantees a decrease in the probability of misclassifying an image. The problem of choosing sampling locations for image formation th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2011

ISSN: 1053-587X,1941-0476

DOI: 10.1109/tsp.2011.2161471