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 19 of 19 for “"nuclear norm minimization"”.

  1. Fixed Point Iteration Algorithms for Low-rank Matrix Completion

    … the recovery of low-rank matrix can be done via nuclear norm minimization, a convex program. Scalable and fast algorithms are essential as the practical matrix completion tasks always occur on a large scale. Here we study two algorithms and generalize the uni ed framework of xed point iteration …

    waterloo Repository record for Fixed Point Iteration Algorithms for Low-rank Matrix Completion (opens in a new tab)

  2. Reconstructing the connectome from an ensemble of measurements

    … can be formulated naturally in terms of nuclear norm minimization techniques. It is our belief that the presented methods will allow the acquisition of future connectomes with an order of magnitude reduction in experimental effort, as well as significantly outperform the simpler inference …

    texas Repository record for Reconstructing the connectome from an ensemble of measurements (opens in a new tab)

  3. Essays in Problems in Sequential Decisions and Large-Scale Randomized Algorithms

    … a central limit theorem (CLT) with a different normalization than Renyi's classical CLT, and in the constricted case we find convergence in distribution to an unbounded random variable. In the second part of this dissertation, we put forward two large-scale randomized algorithms. We propose a …

    penn Repository record for Essays in Problems in Sequential Decisions and Large-Scale Randomized Algorithms (opens in a new tab)

  4. Leveraging Sparsity and Low Rank for Large-Scale Networks and Data Science

    … on every bit of our lives, churning out enormous streams of raw data in a wide variety of formats. While big data may bring ``big blessings," there are formidable challenges in dealing with large-scale datasets. The sheer volume of data makes it often impossible to run analytics using …

    umn Repository record for Leveraging Sparsity and Low Rank for Large-Scale Networks and Data Science (opens in a new tab)

  5. Low-rank matrix recovery: blind deconvolution and efficient sampling of correlated signals

    … using efficient algorithms such as \ell_1-minimization. Recently, the research focus has spun-off to encompass other interesting low-dimensional signal structures such as group-sparsity and low-rank structure. This thesis considers low-rank matrix recovery (LRMR) from various …

    gatech Repository record for Low-rank matrix recovery: blind deconvolution and efficient sampling of correlated signals (opens in a new tab)

  6. Convex and Non-Convex Relaxations for Densest Subgraph and Submatrix Recovery: Theory and Applications in Community Detection and Drug-Target Prediction

    … unsupervised structure recovery. The first uses nuclear norm minimization to construct a convex relaxation of the planted bicluster detection problem, with recovery guarantees when the planted subgraph size scales as the logarithm of the network raised to the 1.5 power. The second introduces a …

    alabama Repository record for Convex and Non-Convex Relaxations for Densest Subgraph and Submatrix Recovery: Theory and Applications in Community Detection and Drug-Target Prediction (opens in a new tab)

  7. Embracing nonuniform samples

    … approximation of the signal via the nuclear norm minimization problem. This result has novel implications for the noisy matrix completion problem by improving known error bounds and providing the first result that is stable when the data matrix is not strictly low-rank.

    ubc Repository record for Embracing nonuniform samples (opens in a new tab) Download PDF for Embracing nonuniform samples (opens in a new tab)

  8. Cooperative Wideband Spectrum Sensing Based on Joint Sparsity

    … matrix completion technique involving matrix nuclear-norm minimization. Motivated by the fact that the spectrum matrix is not only low-rank, but also sparse, a spectrum sensing approach is proposed based on minimizing a mixed-norm of the spectrum matrix instead of low-rank matrix completion to …

    vcu Repository record for Cooperative Wideband Spectrum Sensing Based on Joint Sparsity (opens in a new tab)

  9. High-dimensional Statistical Inference: from Vector to Matrix

    … discusses compressed sensing and affine rank minimization in both noiseless and noisy cases and establishes sharp restricted isometry conditions for sparse signal and low-rank matrix recovery. The analysis relies on a key technical tool which represents points in a polytope by convex …

    penn Repository record for High-dimensional Statistical Inference: from Vector to Matrix (opens in a new tab)

  10. Gauge duality and low-rank spectral optimization

    … approaches. Typical applications give rise to enormous optimization problems that challenge even the very best workhorse algorithms and numerical solvers for semidefinite programming. The work presented in this thesis focuses on the class of low-rank spectral optimization problems and its …

    ubc Repository record for Gauge duality and low-rank spectral optimization (opens in a new tab) Download PDF for Gauge duality and low-rank spectral optimization (opens in a new tab)

  11. LOW RANK AND SPARSE MODELING FOR DATA ANALYSIS

    … many data analysis tasks. Since the general rank minimization problem is computationally NP-hard, the convex relaxation of original problem is often solved. One popular heuristic method is to use the nuclear norm to approximate the rank of a matrix. Despite the success of nuclear norm minimization …

    siu-theses Repository record for LOW RANK AND SPARSE MODELING FOR DATA ANALYSIS (opens in a new tab)

  12. Near-optimal sample complexity for noisy or 1-bit tensor completion

    … is O(rN^{d/2}) which can be obtained by a tensor nuclear-norm minimization problem. This bound is significantly larger than O(rdN), the number of free variables in a rank-r tensor. In this thesis, we prove that when r=O(1), we can achieve optimal sample complexity by constraining either one of two …

    ubc Repository record for Near-optimal sample complexity for noisy or 1-bit tensor completion (opens in a new tab) Download PDF for Near-optimal sample complexity for noisy or 1-bit tensor completion (opens in a new tab)

  13. Multi-GPU Acceleration of Iterative X-ray CT Image Reconstruction

    … implementation of the Alternating Minimization (AM) algorithm of O’Sullivan and Benac [1]. We parallelize the computationally expensive projection and backprojection operations by exploiting the massively parallel hardware architecture of 3 NVIDIA TITAN X Graphical Processing Unit …

    wustl Repository record for Multi-GPU Acceleration of Iterative X-ray CT Image Reconstruction (opens in a new tab)

  14. Convex relaxation for the planted clique, biclique, and clustering problems

    … These problems can be formulated as rank minimization problems and relaxed to convex programming by replacing rank with its convex envelope, the nuclear norm. Both problems are NP-hard yet we show that our relaxation is exact in the case that the input graph contains a large clique or …

    waterloo Repository record for Convex relaxation for the planted clique, biclique, and clustering problems (opens in a new tab)

  15. Sparsity Promoting Off-grid Methods with Applications in Direction Finding

    … model, and propose a block total variation norm minimization approach, which is the analog of Group Lasso in the super-resolution framework and that promotes the group-sparsity. The DoAs can be estimated by solving its dual problem via semidefinite programming. This gridless recovery …

    umn Repository record for Sparsity Promoting Off-grid Methods with Applications in Direction Finding (opens in a new tab)

  16. Robust motion segmentation with subspace constraints

    … we formulate subspace clustering as a Frobenius norm minimization problem, which inherently yields denser connections between data points. While in the noise-free case we rely on the self-expressiveness of the observations, in the presence of noise we recover a clean dictionary to represent the …

    anu Repository record for Robust motion segmentation with subspace constraints (opens in a new tab)

  17. Collaborative ranking from ordinal data

    Personalized recommendation systems have to predict preferences of a user for items that have not seen by the user. For cardinal (ratings) data, personalized preference prediction has been efficiently solved over the past few years using matrix factorization related techniques. Recent studies have …

    uiuc Repository record for Collaborative ranking from ordinal data (opens in a new tab)

  18. Advanced imaging via multiplexed sensing and compressive sensing

    … sampling. In addition, we propose a new L1-norm based total-variation measure TVL1, which enforces the sparsity and the directional continuity in the partial gradient domain. Theoretical and experimental results show that this new TVL1 achieves higher recovery accuracy than the previous TV …

    uiuc Repository record for Advanced imaging via multiplexed sensing and compressive sensing (opens in a new tab)

  19. Public Policy in Italy: An Empirical Analysis on Local Governments and Occupations

    … we use a formulation of the problem known as Nuclear Norm Minimization and we solve it with the Soft Impute Algorithm. We conclude our analysis on social skills in our third paper where we analyse the effects of Covid-19 pandemic on soft skills in the context of Italian occupations, operating …

    alicante Repository record for Public Policy in Italy: An Empirical Analysis on Local Governments and Occupations (opens in a new tab)