ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be odd and fix an integer ℓ∈[⌊p/2⌋,n−⌈p/2⌉]\ell\in[\lfloor p/2\rfloor,n-\lceil p/2\rceil]. For S⊆[n]S\subseteq[n] with ∣S∣=ℓ|S|=\ell and T⊆[n]T\subseteq[n] with ∣T∣=ℓ+1|T|=\ell+1, define the rectangular symmetric-difference matrix M∈R(nℓ)×(nℓ+1)M\in\mathbb{R}^{\binom{n}{\ell}\times\binom{n}{\ell+1}} by

MS,T={YS△T,∣S△T∣=p,0,otherwise.M_{S,T}=\begin{cases}Y_{S\triangle T},&|S\triangle T|=p,\\0,&\text{otherwise.}\end{cases}

Let uu be a unit-norm top left singular vector of MM, let v=M⊤uv=M^\top u be the corresponding top right singular vector, and define the recovery output x^∈Rn\widehat{x}\in\mathbb{R}^n by x^i=∑S,TuSvT1S△T={i}\widehat{x}_i=\sum_{S,T}u_Sv_T\mathbf{1}_{S\triangle T=\{i\}}. Odd-order Kikuchi Hessian optimality conjecture. In the Rademacher-spiked tensor model with odd p≥3p\ge3, if

λ≫ℓ−(p−2)/4n−p/4,\lambda\gg \ell^{-(p-2)/4}n^{-p/4},

then there is a threshold τ=τ(n,p,ℓ,λ)\tau=\tau(n,p,\ell,\lambda) such that thresholding the top singular value of MM at τ\tau achieves strong detection, and the stated singular-vector algorithm achieves strong recovery. The conjecture asserts that this odd-order Kikuchi Hessian algorithm matches the performance of sum-of-squares; only sub-optimal results for this algorithm are known in the paper, while optimal results are proved for a related algorithm.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.