__ Summary and Contributions__: This paper studies the sharp phase transition phenomenon in the Gaussian additive model. A near-orthogonality condition is proposed under which the all-or-nothing phenomenon always holds. Then authors use sparse tensor PCA as an application to illustrate the effectiveness of the findings.

__ Strengths__: The paper is theoretically sound. The theory improves the existing works in terms of the sparsity level.

__ Weaknesses__: The content of this work seems to be on the light side. It would improve the quality of the paper if authors can study more machine learning applications to show the importance of the main theorem.
In addition, it would be good to include some numerical simulations to validate the theoretical findings.

__ Correctness__: I believe them to be correct.

__ Clarity__: The paper is well written and easy to read.

__ Relation to Prior Work__: The paper gives a nice review of and comparison with existing works.

__ Reproducibility__: Yes

__ Additional Feedback__:

__ Summary and Contributions__: The paper consider the problem of estimating a rank-1 sparse tensor of any order d>=2 in the presence of Gaussian additive noise. It shows that when the signal is Bernoulli or Rademacher then the sparse tensor PCA problem exhibits the "all-or-nothing phenomenon". This curious phenomenon means that it is statistically impossible to get constant non-zero correlation with the signal below a certain SNR, and above this SNR it is possible to get perfect correlation with the signal. To show this result for the tensor PCA problem, the authors study an interesting problem of estimating a signal with a discrete prior in the presence of Gaussian additive noise. They show that the all-or-nothing phenomenon follows from a near-orthogonality property of vectors sampled from the discrete prior.

__ Strengths__: 1. The paper considers a basic problem, and shows interesting results about it. I quite like the Gaussian additive model, it is something many people should be able to understand and appreciate.
2. The paper also appears to be able to develop a more general machinery for showing these results, which could perhaps be useful beyond this work.
3. The paper ends with an interesting set of open problems, particularly those related to computational efficiency.

__ Weaknesses__: 1. One could make the argument that some of the key messages in the paper have been demonstrated to an extent in prior work. For instance, the problem has been studied in the regime of sparsity Omega(p) and sparsity Omega(p^{2/3}). The current work extends these results to any sparsity.
2. The authors express that their results are shown via a much simpler argument. I do think this is the case, and as mentioned above the Gaussian additive model setup is quite nice. However, I think the exposition of the technical part and the proof could be better. This would help the authors make a better case that their argument is cleaner and simpler. I discuss this in some more detail later.

__ Correctness__: The paper appears to be technically sound.

__ Clarity__: The first few pages of the paper mostly read well. However, about half the paper is spent on the proofs, and this part could be made much more accessible. I also think the authors should spend more space on Section 2. It would be helpful to provide more examples and intuition here, most readers will appreciate that more than the detailed proofs. For instance, maybe provide a some more examples of distributions which will satisfy the overlap property, and distributions which will not satisfy this property. Would M_N=exp(N) randomly sampled vectors from the unit sphere satisfy this? It appears not, since the rate function should be t^2 in that case. Should one expect the all-or-nothing phenomenon in this case? I think examples like this will help the reader develop intuition and interest.
I also think the detailed proofs in Section 3 and 4 should be accompanied by informal high-level sketches.

__ Relation to Prior Work__: Overall, the authors do a decent job at discussing prior work, but I have two remarks.
One point is that in line 70 the authors say the results prove a conjecture implied in several prior works, it would be good to be a bit more specific here, to put the contribution in context. Also, I felt that it would be good to compare the techniques in the paper with the previous papers in some more detail, since one of the claims of the paper is that it offers a simpler argument.

__ Reproducibility__: Yes

__ Additional Feedback__: 1. If the techniques were extendable to maybe one more setup than the sparse tensor PCA problem then that would greatly strengthen the argument that the techniques are more general.
2. Could the all-or nothing phenomena be demonstrated for continuous priors? Is there a limitation on all the current techniques which prevents them for extending to the continuous case?
3. The authors mention that Banks et al. and Perry et al. show that constant correlation with the signal is possible above a certain SNR ("partial recovery"). Is "almost perfect" recovery also possible in the same regime, or is the result in these previous works tight in these regards?
4. Is Theorem 2 tight, if not, is there a simple counterexample? Also, r(t)>=3*t should probably also be a sufficient condition for the Theorem, it is perhaps simpler to understand it as it is linear.
Some minor remarks:
1. Line 107, say that this is the Bayes-opt estimator.
2. Line 110, maybe remind the reader that X is normalized to unit norm and hence 1 is the worst possible MSE.
-----Post author response------
I thank the authors for the feedback. The feedback clarified a mistake in my review, I thought that the all-or-nothing phenomenon were already known for sparse *tensor* PCA in certain sparsity regimes. I also appreciate the commitment of the authors to revise the writing, which would make the paper much stronger. Therefore, I my improving my score for the paper.

__ Summary and Contributions__: This paper studies the question of recovering a planted "structure" in the presence of additive Gaussian noise. This is an important class of signal recovery problems capturing examples such as sparse PCA and tensor PCA. The main question in such questions is determining the minimum signal strength required to (exactly or approximately) recover the added signal. This paper is focused on a certain "all-or-nothing" phenomenon - this means that there's a SNR threshold above which, the Bayes' optimal estimator achieves almost-perfect recovery while below it, almost nothing of the signal can be recovered.
The framework seems general and appealing and is applied to obtain a threshold for the reasonably well-studied problem of sparse Tensor PCA. Prior works showed a similar phenomenon but proved a all-or-nothing type result for recovering a vector correlated with the additive "spike". This work shows the stronger result with almost-perfect recovery replacing the approximate one above.

__ Strengths__: Appealing characterization of when all-or-nothing phenomenon holds for additive Gaussisan models.
Improved result for sparse Tensor PCA.

__ Weaknesses__: Proofs themselves are largely uninsighful and follow the standard outline present in prior works. IMO, the main contribution is the conceptual abstraction of a condition (in terms of KL distance to the "null" distribution) that governs the all-or-nothing phenomenon.

__ Correctness__: Yes.

__ Clarity__: Yes.

__ Relation to Prior Work__: yes.

__ Reproducibility__: Yes

__ Additional Feedback__: