Adapting Regularized Low-Rank Models for Parallel Architectures
نویسندگان
چکیده
منابع مشابه
Laplacian regularized low rank subspace clustering
The problem of fitting a union of subspaces to a collection of data points drawn from multiple subspaces is considered in this paper. In the traditional low rank representation model, the dictionary used to represent the data points is chosen as the data points themselves and thus the dictionary is corrupted with noise. This problem is solved in the low rank subspace clustering model which deco...
متن کاملRegularized structured low-rank approximation with applications
We consider the problem of approximating an affinely structured matrix, for example a Hankel matrix, by a low-rank matrix with the same structure. This problem occurs in system identification, signal processing and computer algebra, among others. We impose the low-rank by modeling the approximation as a product of two factors with reduced dimension. The structure of the low-rank model is enforc...
متن کاملOptimal regularized low rank inverse approximation
Article history: Received 5 September 2013 Accepted 19 July 2014 Available online 5 August 2014 Submitted by C. Greif MSC: 65F22 15A29
متن کاملRegularized reduced rank growth curve models
The growth curve model (GCM), also known as GMANOVA, is a useful technique for investigating patterns of change in repeated measurement data over time and examining the effects of predictor variables on temporal trajectories. The reduced rank feature had been introduced previously to GCM for capturing redundant information in the criterion variables in a parsimonious way. In this paper, a ridge...
متن کاملSpatial Design for Knot Selection in Knot-Based Low-Rank Models
Analysis of large geostatistical data sets, usually, entail the expensive matrix computations. This problem creates challenges in implementing statistical inferences of traditional Bayesian models. In addition,researchers often face with multiple spatial data sets with complex spatial dependence structures that their analysis is difficult. This is a problem for MCMC sampling algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2019
ISSN: 1064-8275,1095-7197
DOI: 10.1137/17m1147342