首页/论文/2011.06710

arXiv 2011.067102020-11-13math.OC

Comments on Efficient Singular Value Thresholding Computation

Zhengyuan Zhou, Yi Ma

英文摘要：

We discuss how to evaluate the proximal operator of a convex and increasing function of a nuclear norm, which forms the key computational step in several first-order optimization algorithms such as (accelerated) proximal gradient descent and ADMM. Various special cases of the problem arise in low-rank matrix completion, dropout training in deep learning and high-order low-rank tensor recovery, although they have all been solved on a case-by-case basis. We provide an unified and efficiently computable procedure for solving this problem.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Adaptive Singular Value Thresholding

In this paper, we propose an Adaptive Singular Value Thresholding (ASVT) for low rank recovery under affine constraints. Unlike previous iterative methods that the threshold level is independent of the iteration number, in our proposed method, the threshold in adaptively decreases during iterations. The simulation results reveal that we get better performance with this thresholding strategy.

2017-07-16math.OC

Generalized singular value thresholding operator to affine matrix rank minimization problem

It is well known that the affine matrix rank minimization problem is NP-hard and all known algorithms for exactly solving it are doubly exponential in theory and in practice due to the combinational nature of the rank function. In this paper, a generalized singular value thresholding operator is generated to solve the affine matrix rank minimization problem. Numerical experiments show that our algorithm performs effectively in finding a low-rank matrix compared with some state-of-art methods.

2018-04-21math.OC

Weighted Singular Value Thresholding and its Application to Background Estimation

Singular value thresholding (SVT) plays an important role in the well-known robust principal component analysis (RPCA) algorithms which have many applications in computer vision and recommendation systems. In this paper, we formulate and study a weighted singular value thresholding (WSVT) problem, which uses a combination of the nuclear norm and a weighted Frobenius norm. We present an algorithm to numerically solve WSVT and establish the convergence of the algorithm. As a proof of concept, we apply WSVT with a simple choice of weight learned from the data to the background estimation problem …

2017-07-01math.OC

Adaptive iterative singular value thresholding algorithm to low-rank matrix recovery

The problem of recovering a low-rank matrix from the linear constraints, known as affine matrix rank minimization problem, has been attracting extensive attention in recent years. In general, affine matrix rank minimization problem is a NP-hard. In our latest work, a non-convex fraction function is studied to approximate the rank function in affine matrix rank minimization problem and translate the NP-hard affine matrix rank minimization problem into a transformed affine matrix rank minimization problem. A scheme of iterative singular value thresholding algorithm is generated to solve the regu…

2020-01-30math.OC

用于张量恢复的迭代奇异管硬阈值算法

Iterative Singular Tube Hard Thresholding Algorithms for Tensor Recovery

本文提出一类基于低管秩张量近似的迭代奇异管硬阈值算法，包括基础、加速确定性和随机版本，用于解决管秩先验已知的低秩张量恢复问题，并提供收敛性保证及在张量压缩感知和彩色图像修复上的实验验证。

2023-12-26math.OC

A Singular Value Thresholding Algorithm for Matrix Completion

This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of recovering a large matrix from a small subset of its entries (the famous Netflix problem). Off-the-shelf algorithms such as interior point methods are not directly amenable to large problems of this kind with over a million unknown entries. This paper develops a simple first-order and easy-to-implement …

2008-10-18math.OC

更多相关论文收起更多论文

通过极分解进行奇异值软阈值处理

Singular value soft-thresholding via the polar decomposition

University of Colorado Boulder（科罗拉多大学波得尔分校）

研究奇异值软阈值处理，核心方法是通过极分解计算，相比标准奇异值分解方法，在GPU上有显著加速，不过因符号函数不连续，该方法可能仅适用于低精度应用。

2026-07-27cs.LGcs.NAmath.NA

Affine matrix rank minimization problem via non-convex fraction function penalty

Affine matrix rank minimization problem is a fundamental problem with a lot of important applications in many fields. It is well known that this problem is combinatorial and NP-hard in general. In this paper, a continuous promoting low rank non-convex fraction function is studied to replace the rank function in this NP-hard problem. Inspired by our former work in compressed sensing, an iterative singular value thresholding algorithm is proposed to solve the regularization transformed affine matrix rank minimization problem. For different $a>0$, we could get a much better result by adjusting th…

2017-04-30math.OC

Transformed Schatten-1 Iterative Thresholding Algorithms for Low Rank Matrix Completion

We study a non-convex low-rank promoting penalty function, the transformed Schatten-1 (TS1), and its applications in matrix completion. The TS1 penalty, as a matrix quasi-norm defined on its singular values, interpolates the rank and the nuclear norm through a nonnegative parameter a. We consider the unconstrained TS1 regularized low-rank matrix recovery problem and develop a fixed point representation for its global minimizer. The TS1 thresholding functions are in closed analytical form for all parameter values. The TS1 threshold values differ in subcritical (supercritical) parameter regime w…

2016-10-18cs.ITmath.ITmath.OC

迭代阈值化与自由间断问题相遇

Iterative thresholding meets free discontinuity problems

Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences（奥地利科学院约翰·拉顿计算与应用数学研究所）；Program in Applied and Computational Mathematics, Princeton University（普林斯顿大学应用与计算数学项目）

本文探索了稀疏恢复中的迭代阈值算法与离散自由间断问题之间的联系，并建立了一种用于求解离散自由间断问题的迭代阈值算法，提供了关于极小化解性质的新见解。

2009-04-28cs.NAmath.FAmath.NA

Tensor-Free Proximal Methods for Lifted Bilinear/Quadratic Inverse Problems with Applications to Phase Retrieval

We propose and study a class of novel algorithms that aim at solving bilinear and quadratic inverse problems. Using a convex relaxation based on tensorial lifting, and applying first-order proximal algorithms, these problems could be solved numerically by singular value thresholding methods. However, a direct realization of these algorithms for, e.g., image recovery problems is often impracticable, since computations have to be performed on the tensor-product space, whose dimension is usually tremendous. To overcome this limitation, we derive tensor-free versions of common singular value thres…

2019-07-10cs.NAmath.NAmath.OC

Enhanced Low-Rank Matrix Approximation

New York University（纽约大学）；Tandon School of Engineering（坦登工程学院）

This letter proposes to estimate low-rank matrices by formulating a convex optimization problem with non-convex regularization. We employ parameterized non-convex penalty functions to estimate the non-zero singular values more accurately than the nuclear norm. A closed-form solution for the global optimum of the proposed objective function (sum of data fidelity and the non-convex regularizer) is also derived. The solution reduces to singular value thresholding method as a special case. The proposed method is demonstrated for image denoising.

2016-04-12cs.CVcs.LGmath.OC