arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.00713math.OC
收藏

尺度与带符号置换不变函数的邻近算子计算

Computing Proximity Operators of Scale and Signed Permutation Invariant Functions

Jianqing Jia, Ashley Prater-Bennette, Lixin Shen

AI总结:

本文针对尺度与带符号置换不变函数,提出将邻近算子计算分解为w、r、d三步的WRD过程,并据此给出(ℓ1/ℓ2)^2的显式计算方法及ℓ1/ℓ2的高效算法,服务于稀疏信号恢复。

摘要:

本文研究了尺度与带符号置换不变函数的邻近算子计算问题。尺度不变函数在均匀缩放下保持不变,而带符号置换不变函数即使对其输入变量施加置换和符号变化仍保持其结构。值得注意的例子包括 $\ell_0$ 函数以及 $\ell_1/\ell_2$ 及其平方的比值,它们的邻近算子在稀疏信号恢复中尤为关键。我们深入探讨了尺度与带符号置换不变函数的性质,将其邻近算子的计算划分为三个顺序步骤:$\mathbf{w}$-步骤、$r$-步骤和 $d$-步骤。这些步骤共同构成一个称为 WRD 的过程,其中 $\mathbf{w}$-步骤最为重要,需要仔细处理。利用这一过程,我们提出了一种显式计算 $(\ell_1/\ell_2)^2$ 邻近算子的方法,并为 $\ell_1/\ell_2$ 的邻近算子引入了一种高效算法。

英文摘要:

This paper investigates the computation of proximity operators for scale and signed permutation invariant functions. A scale-invariant function remains unchanged under uniform scaling, while a signed permutation invariant function retains its structure despite permutations and sign changes applied to its input variables. Noteworthy examples include the $\ell_0$ function and the ratios of $\ell_1/\ell_2$ and its square, with their proximity operators being particularly crucial in sparse signal recovery. We delve into the properties of scale and signed permutation invariant functions, delineating the computation of their proximity operators into three sequential steps: the $\mathbf{w}$-step, $r$-step, and $d$-step. These steps collectively form a procedure termed as WRD, with the $\mathbf{w}$-step being of utmost importance and requiring careful treatment. Leveraging this procedure, we present a method for explicitly computing the proximity operator of $(\ell_1/\ell_2)^2$ and introduce an efficient algorithm for the proximity operator of $\ell_1/\ell_2$.

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

↑