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 11 of 11 for “"iterative hard thresholding"”.

  1. Lågrangmatriskomplettering: En jämförelse av två algoritmer

    … för långrangmatriskomplettering, singular value thresholding (SVT) och nor malized iterative hard thresholding (NIHT), på slumpmässigt genererad data och ett urval av databasen Netflix prize data. Rapportens syfte är att bestämma vilken av dessa två algoritmer som lämpar sig bättre för …

    chalmers Repository record for Lågrangmatriskomplettering: En jämförelse av två algoritmer (opens in a new tab)

  2. Efficient algorithms for compressed sensing and matrix completion

    … optimal stepsize selection rule for the simplest iterative hard thresholding algorithm for matrix completion, and obtain a simple yet efficient algorithm. It is observed to have average case performance superior in some aspects to other matrix completion algorithms.</p> <p>To balance the fast …

    oxford Repository record for Efficient algorithms for compressed sensing and matrix completion (opens in a new tab)

  3. Topics In Differentially Private Statistical Inference

    … differentially private algorithms such as noisy iterative hard thresholding, and of minimax lower bound techniques such as the score attack.

    penn Repository record for Topics In Differentially Private Statistical Inference (opens in a new tab)

  4. Lågrangkomplettering av matriser: En komparativ studie av tre algoritmer

    … för lågrang matriskomplettering: Singular Value Thresholding (SVT), Iterative Reweighted Least Squares Gradient Projection (IRLS-GP) och Normalized Iterative Hard Thresholding (NIHT). Algoritmernas prestanda utvärderas på både syntetisk och verklig data för att identifiera deras styrkor och …

    chalmers Repository record for Lågrangkomplettering av matriser: En komparativ studie av tre algoritmer (opens in a new tab)

  5. Nonlocal and Randomized Methods in Sparse Signal and Image Processing

    … sparse signal reconstruction, called Randomized Iterative Hard Thresholding (RIHT). This algorithm has applications in compressed sensing, image denoising, and other sparse inverse problems. (2) An extension to the Block-Matching 3D (BM3D) denoising algorithm that matches blocks at different …

    arizona-thes Repository record for Nonlocal and Randomized Methods in Sparse Signal and Image Processing (opens in a new tab)

  6. Distributed sparse signal recovery in networked systems

    … original approximate message passing (AMP) and iterative hard thresholding (IHT) algorithms in the area of compressed sensing (CS), also known as sparse signal recovery. For distributed AMP (DiAMP), we develop a communication-efficient algorithm GCAMP. Numerical results demonstrate that it …

    vcu Repository record for Distributed sparse signal recovery in networked systems (opens in a new tab)

  7. Structured inverse problems in ultrafast optics

    … forward problem to exploit tensor structure via iterative hard thresholding, (iii) the development of a new condensed sensing approach to pulse characterization, and (iv) the demonstration of this technique in a laboratory setting.

    colo-mines Repository record for Structured inverse problems in ultrafast optics (opens in a new tab)

  8. Iterative Algorithms for Sparse and Low-Rank Recovery from Atypical Measurements

    … regime of parameters. We propose and analyze iterative algorithms for sparse and low-rank recovery which are designed to succeed in this setting. The results are accompanied by numerical experiments that study the performance of these algorithms. The analysis is based on a modified restricted …

    tamu Repository record for Iterative Algorithms for Sparse and Low-Rank Recovery from Atypical Measurements (opens in a new tab)

  9. Bayesian coresets: Revisiting the nonconvex optimization perspective

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-11 without embargo terms

    uiuc Repository record for Bayesian coresets: Revisiting the nonconvex optimization perspective (opens in a new tab)

  10. Algorithm robustness and its applications : Frank-Wolfe and factorized gradient

    … to run on a single machine, on asynchronous hardware. For algorithms designed under the assumption of access to pristine gradient information, we often perform quantization for improved computational efficiency, or we infuse artificial noise or truncate the gradient information to preserve …

    texas Repository record for Algorithm robustness and its applications : Frank-Wolfe and factorized gradient (opens in a new tab)