Computing Proximity Operators of Scale and Signed Permutation Invariant Functions

arxiv(2024)

引用 0|浏览0
暂无评分
摘要
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 ℓ_0 function and the ratios of ℓ_1/ℓ_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 𝐰-step, r-step, and d-step. These steps collectively form a procedure termed as WRD, with the 𝐰-step being of utmost importance and requiring careful treatment. Leveraging this procedure, we present a method for explicitly computing the proximity operator of (ℓ_1/ℓ_2)^2 and introduce an efficient algorithm for the proximity operator of ℓ_1/ℓ_2.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要