- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
For asymmetric Gaussian tensor inference with a general Tucker core, this paper derived the correct matrix-valued Onsager reaction term for AMP as the derivative of the covariance map and rigorously proved that the entire fixed-time trajectory follows a finite-dimensional Gaussian effective process.
Critical strengths
The resulting theorems hold for a quite general setup, encompassing misspecified priors, misspecified noise, heuristic denoisers, and neural-network denoisers. Lemma D.2 in Appendix D explicitly demonstrates that when , skew-symmetric null directions arise, causing the lower bound to fail. Therefore, the proof goes beyond simply stating that "matrix AMP has been generalized to tensor AMP"; it relies on mathematical structures specific to orders of 3 or higher.
Critical weaknesses
While the concept of a "general core" is clear as a mathematical generalization, the practical motivation for the "known general core" setting is weak; the paper would be more compelling if it could demonstrate a real-world application where this specific setting applies.
Questions for authors
I couldn't quite visualize the types of problems in machine learning or signal processing where the assumed problem setting would arise. Could you provide some concrete examples?
A known non-diagonal core in hyperspectral image denoising
Thank you for highlighting the non-Bayesian denoisers and the skew-symmetric null directions at N=2 in Lemma D.2. Your question helped us clarify the practical motivation for the known-core setting and improve its presentation in the manuscript.
Teal marks new material and purple marks revised discussion in the revised manuscript.
Q1. Where does a known, non-diagonal core arise in practice?
A core can be determined exactly by model structure, as in tensor-ring models for hyperspectral image denoising, or estimated from independent data and then frozen. The latter requires additional control of estimation error beyond Theorem 4.3.
Image denoising. Chen et al. used ring ranks (R1,R2,R3)=(9,3,3) to denoise the Indian Pines hyperspectral image (Fig. 10 of [R1]). For a group of similar patches, let i,j,k index within-patch position, spectral band, and patch, respectively. The tensor-ring factors have dimensions U∈RR1×I1×R2, V∈RR2×I2×R3, and W∈RR3×I3×R1. Expanding Eq. (5) of [R1] gives the signal model [Z]ijk=∑a=1R1∑b=1R2∑c=1R3[U]aib[V]bjc[W]cka. Unfolding these tensor-ring cores along their observation modes, with a fixed ordering of the remaining index pairs, gives our unknown factor matrices A1,A2,A3, with P1=R1R2=27, P2=R2R3=9, and P3=R3R1=27. Our known core is the non-diagonal binary array selecting exactly the triples ((a,b),(b,c),(c,a)). Once the ranks are fixed, none of its entries is fitted.
Independent estimation. A core shared across tensor instances could be estimated by expectation–maximization on independent data and then frozen for a new instance. Theorem 4.3 assumes that AMP uses the data-generating core. If both cores are expressed in the same latent coordinates and their Frobenius distance tends to zero in probability, a possible extension would couple the two AMP paths on the same data and initialization using the fixed-horizon stability bounds in Appendix E. Consistency of the EM estimate would require separate justification.
Revisions: Sec. 1 (p. 1); Appendix A.1 (pp. 18–19).
References
[R1] Chen et al. “Nonlocal Tensor-Ring Decomposition for Hyperspectral Image Denoising.” IEEE TGRS, 2020.