__ Summary and Contributions__: This paper presents minimax bounds on sample complexity to learn changes in a network are the same as learning the network directly when the change is small enough.

__ Strengths__: Soundness: The minimax proof follows the traditional LeCam approach. The proof is based on a lifting idea that appears novel.
Significance and novelty: this work is novel in that it seems to contradict other results in the literature stating that learning changes is easier than learning the network directly.
Relevance to NeurIPS: network learning is relevant to NeurIPS community.

__ Weaknesses__: Soundness: no weakness that I can see
Significance and novelty: it would be good if the authors could discuss potential generalizations to networks beyond the Ising model.
Relevance to NeurIPS: no weakness

__ Correctness__:
The proofs appear correct.

__ Clarity__:
This paper is clearly written.

__ Relation to Prior Work__:
Prior work is discussed.

__ Reproducibility__: Yes

__ Additional Feedback__:

__ Summary and Contributions__: This paper considers the problems of testing and learning differences in the edge structures between two degree bounded Ising models from an information theoretic perspective. The lower bounds on the sample complexities of three problems are established:
1. a testing problem to test if two Ising models are s-separated (differ in at least s edges)
2. a learning problem to approximately learn the difference between the edge structures of two s-separated Ising models
3. structure learning of an Ising model with approximate recovery criterion.
The bounds for the aforementioned problems are compared against an achievability bound on the sample complexity of approximate structure learning using an ML decoder. The paper also provides results for a specific case of forest structured Ising models.

__ Strengths__: The problems studied in this paper are well motivated as the statistical limits on the sample complexity of functional inference over two or more graph models have not been established for a wide class of problems. This paper tries to make a contribution in that direction by considering the detection and learning of changes between Ising models. The analysis primarily uses standard information theoretic workhorses like Le Camâ€™s method and Chi-squared based bounds with novel and non-trivial ensemble constructions to derive the results.
The paper establishes theoretically that the lower bounds on the detection and learning of changes in the Ising models have approximately the same scaling behavior as that of structure learning for a wide range of regimes. This is in contrast to the claims in several existing algorithmic approaches that imply that recovery of sparse changes is possible with smaller sample complexity than structure learning of the complete graphs. For forest structured graphs, it is theoretically established that detecting large changes has lower sample complexity than that for learning the changes and structure learning in Ising models, which is of practical significance.

__ Weaknesses__: Overall I like the paper technically, but there is scope for elaboration on some aspects.
1. Proposition 1 is not intuitive to me from the exposition provided in the paper. Essentially, SL, EoF and GoF are separate problems with different inputs (for instance , SL takes the samples from only one graph as an input in contrast to EoF and GoF) and the argument that solving one of those problems leads to the solution to another problem is not very convincing for establishing the order of difficulties of the problems.
2. The paper lacks any experimental validation of its results. Specifically, experiments on forest structured graphs to illustrate the deviation between the sample complexities of testing problem and the learning problems would have been informative.

__ Correctness__: The theoretical claims are correct to the best of my knowledge.

__ Clarity__: The paper is very well written with great emphasis on the interpretation of different results. The sample complexity results are elaborated upon in different regimes. The novelties in the proof techniques are also emphasized upon in the paper.

__ Relation to Prior Work__: There are not many information-theoretic works in this domain. The authors discuss the existing works on detection of sparse changes in Ising models and compare their results against them.

__ Reproducibility__: Yes

__ Additional Feedback__:

__ Summary and Contributions__: This paper considers goodness-of-fit testing and error-of-fit testing for Ising graphical models. The test is meant to discover whether there are s edges that are different. It is shown, somewhat surprisingly, that the sample complexity result for these two tests, in some regimes of s, is just as high as that for learning the entire structure itself.

__ Strengths__: The main result is encapsulated in Theorem 3 where lower bounds on n_{GoF} and n_{EoF} are obtained. It is shown that in some regimes of s, these lower bounds match the ML one of Santhanam and Wainwright.
I did not go through all of the long supplementary material. However, what I did go through looks interesting and novel. In particular, the use of information-theoretic techniques (Le Cam's method), the construction of different instances (e.g., based on Emmenthaler cliques) to compute the lower bounds is interesting and non-trivial.

__ Weaknesses__: I do not see any major limitations of this work.
However, one aspect that could improve this work is to add some numerical experiments to check whether the dependencies on the various parameters is sharp. This can be done for, for example, Theorem 7. This would add to the value and impact of the paper.

__ Correctness__: I didn't have time to go through all the material in the supplementary material. However, what I did go through looks correct. I am not an expert in this area.

__ Clarity__: Yes.

__ Relation to Prior Work__: This is fine.

__ Reproducibility__: No

__ Additional Feedback__: NIL