Fixed-weight-matrix conjecture for spurious local minima

From papers

Let ϵ[0,1]\epsilon\in[0,1], let CC be a fixed weight matrix satisfying Cij{0}[ϵ,1]C_{ij}\in\{0\}\cup[\epsilon,1], and let uu^* be a solution. Define

DC(u):=(min(C,u~)Duu~1)1.\mathbb{D}_C(u^*):= \left(\min_{(C,\tilde{u}^*)\in\overline{\mathcal{D}}}\|u^* - \tilde{u}^*\|_1\right)^{-1}.

Here D\overline{\mathcal{D}} is the closure of the set of desired instances, and a spurious local minimum is a local minimum that is not a desired solution.

Fixed-weight-matrix conjecture. There exists a large constant Γ(ϵ)>0\Gamma(\epsilon)>0 such that every instance MC(C,u)\mathcal{MC}(C,u^*) satisfying

Cij{0}[ϵ,1],DC(u)Γ(ϵ)C_{ij}\in\{0\}\cup[\epsilon,1],\qquad \mathbb{D}_C(u^*)\geq\Gamma(\epsilon)

has spurious local minima.

The conjecture gives a necessary-condition-type prediction for spurious local minima using the modified complexity metric for a fixed weight matrix. The preceding theorem establishes an analogous result for Dα,ϵ\mathbb{D}_{\alpha,\epsilon}, but the supplied text does not establish this fixed-weight formulation.

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

Haixiang Zhang, Baturalp Yalcin, Javad Lavaei and Somayeh Sojoudi, “A New Complexity Metric for Nonconvex Rank-one Generalized Matrix Completion”, arXiv:2204.02364 (2023).

Solutions 0

No solutions have been posted yet.