Approximation of statistical dimension by distance to the scaled subdifferential

From papers

Let ff be one of the objectives f2f_2, f3f_3, f5f_5, or f6f_6 described in the preceding remark, let x\overline{x} be the signal under consideration, and let XN(0,I)X\sim\mathcal{N}(0,I). For τ0\tau\geq 0, define

J(τ):=E[dist2(X,τf(x))].J(\tau):=\mathbb{E}\left[\operatorname{dist}^2(X,\tau\partial f(\overline{x}))\right].

Approximation conjecture. For these choices of ff, the statistical dimension is well approximated by the squared Euclidean distance to the scaled subdifferential:

minτ0J(τ)δ(f(x)).\min_{\tau\geq 0}J(\tau)\approx\delta(\partial f(\overline{x})).

The claim is motivated by empirical results and is intended to provide an approximation when explicit formulas for JJ and its minimum are unavailable for the constrained objectives. Its validity is not established in the supplied text.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Jan Kuske and Stefania Petra, “Performance Bounds For Co-/Sparse Box Constrained Signal Recovery”, arXiv:1812.10471 (2018).

Solutions 0

No solutions have been posted yet.