Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 38 for “"Low Rank matrix completion"”.
-
Fixed Point Iteration Algorithms for Low-rank Matrix Completion
A lot of applications can be formulated as matrix completion problems. In order to address such problems, a common assumption is that the underlying matrix is (approximately) low-rank. Under certain conditions, the recovery of low-rank matrix can be done via nuclear norm minimization, a convex …
-
Cooperative Wideband Spectrum Sensing Based on Joint Sparsity
… of the spectrum by the PUs, the spectrum matrix has only a small number of non-zero rows. In existing state-of-the-art approaches, the spectrum sensing problem was solved using the low-rank matrix completion technique involving matrix nuclear-norm minimization. Motivated by the fact that …
-
IMAGE AND VIDEO ENHANCEMENT USING SPARSE CODING, BELIEF PROPAGATION AND MATRIX COMPLETION
… I describe a denoising method using low-rank matrix completion. In the proposed denoising approach, I present a patch-based video denoising algorithm by grouping similar patches and then formulating the problem of removing noise using a decomposition approach for low-rank matrix …
-
Optimization Methods for Semi-Supervised Learning
… on problems where an underlying structure allows us to leverage the large amounts of unlabeled data, while only requiring small amounts of labeled data. In particular, we consider low-rank matrix completion problems with applications to recommender systems, and semi-supervised support vector …
-
Representations of Polytopes
… an abstract polytope is equivalent to solving a low rank matrix completion problem. For any given polytope, we provide a new construction for the known result that there is a combinatorial polytope with a specified ridge that is always projectively equivalent to the given polytope, and we show …
-
Provable alternating minimization for non-convex learning problems
… the other is held fixed (and vice versa). This allows for alternating between optimally updating one set of variables, and then the other. AltMin methods typically do not have associated global consistency guarantees; even though they are empirically observed to perform better than methods (e.g. …
-
Matrix Completion Models with Fixed Basis Coefficients and Rank Regularized Problems with Hard Constraints
The problems with embedded low-rank structures arise in diverse areas such as engineering, statistics, quantum information, finance and graph theory. This thesis is devoted to dealing with the low-rank structure via techniques beyond the widely-used nuclear norm for achieving better performance. In …
-
Secure federated learning for low rank matrix models
… algorithms for solving three federated low rank matrix learning problems that share common features: multi task representation learning, robust low rank matrix completion (R-LRMC), and robust principal component analysis (RPCA). These problems appear in many modern machine learning and …
-
New Guassian Process Modeling for Low-Rank and Simulated Data
… with the multi-fidelity framework and how matrix-variate Gaussian distribution is utilized to avail matrix completion problems. The thesis is composed of the contributions made in these two directions, which include four research topics: (i) a new experimental design approach to …
-
Overlapped Community Detection in Multiplex Networks
… namely belief propagation and cluster-driven low-rank matrix completion, in order to generalize them to the case of multiplex networks. These extensions include a flattening technique that converts the multiplex network into a mono-layered network by projecting the edges of each layer onto a …
-
Dimension Reduction for Spatially-Misaligned and Multi-Pollutant Data with Missing Observations
… analysis (PCA) can be incorporated to obtain lower-dimensional representative scores of the multi-pollutant data. Spatial prediction models can then be used to estimate these scores at new locations. Recently developed predictive PCA (PredPCA) modifies the traditional algorithm to improve the …
-
Inertial iterative thresholding with applications to sparse and low-rank signal recovery
… than the dimension of the signal. Another is low-rank matrix completion where one wants to recover a low-rank matrix from a subset of revealed entries. A third example is robust principle component analysis (RPCA) where one is given a data matrix and would like to decompose it into a low-rank …
-
lq sparse signal estimation with applications
… of sparsity; sparse linear regression, low rank matrix completion and sparse inverse covariance selection. In the first and third topic, sparsity refers to having a small number of nonzero vector and matrix entries respectively, while in the second topic it is associated with low matrix …
-
Policy evaluation in offline reinforcement learning with low-rank structure
… the policy evaluation guarantees by assuming the low-rank structure on Markov decision process (MDP). Towards this, to bridge the theory and practice, this work provides a practically feasible target policy evaluation algorithm by using the fast and robust low-rank matrix completion algorithm …
-
Correctness results for on-line robust principal components analysis
… problems - online robust PCA (RPCA) and online low-rank matrix completion (MC). In recent work by Candes et al., RPCA has been defined as a problem of separating a low-rank matrix (true data), L:=[ℓ₁, ℓ₂, ... ℓt, ... , ℓtmax and a sparse matrix (outliers), S:=[x₁, x₂, ... xt, ..., xtmax] from …
-
Iterative matrix completion and topic modeling using matrix and tensor factorizations
… reweighted least squares algorithm for low-rank matrix completion to take into account sparsity-based structure in the missing entries. We also propose an iterative gradient-projection-based implementation of the algorithm, and present numerical experiments showcasing the performance of …
-
Low rank methods for optimizing clustering
… often have the majority of information in a low rank subspace. By careful exploitation of these low rank structures in clustering problems, we find new optimization approaches that reduce the memory and computational cost. We discuss two cases where this arises. First, we consider the …
-
Poisson matrix completion and change-point detection
… touch the above two aspects. The first topic is low-rank matrix completion. Because many survey data is capable of being represented approximately as a low-rank matrix, this model can apply to many applications such as sensor network, network traffic analysis, sensor localization, recommender …
-
Structured Statistical Estimation via Optimization
This thesis shows how we can exploit low-dimensional structure in high-dimensional statistics and machine learning problems via optimization. We show several settings where, with an appropriate choice of optimization algorithm, we can perform useful estimation with a complexity that scales not with …
-
Matrix completion with structure
Often, data organized in matrix form contains missing entries. Further, such data has been observed to exhibit effective low-rank, and has led to interest in the particular problem of low-rank matrix-completion: Given a partially-observed matrix, estimate the missing entries such that the output …
Page 1 of 2