- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper explains grid-cell representations from an efficient-coding perspective, using the ZZLB to account for both local decoding errors and confusion between distant locations, and obtaining grid-like responses through optimization within a restricted Fourier encoding family. Its main strength is that an error lower bound derived within the efficient-coding framework serves as an optimization objective that unifies several computational principles previously proposed for obtaining grid cells through optimization. This helps simplify our understanding of the field.
My main concern, however, is the gap between the paper’s intended novelty and the evidence provided. Many previous studies have already discussed the efficiency of grid codes, so this paper needs to go further and ask whether grid representations would still win out because of their coding efficiency when a broader range of candidate encodings is allowed to compete. However, the authors ultimately restrict the search to a particular Fourier encoding family, without proving that this restriction does not exclude more efficient codes. The final result is also a numerical solution obtained through gradient-based optimization, rather than a theoretically derived optimal representation, and it is not even guaranteed to be globally optimal within this restricted family. This makes the experiments particularly important: broader comparisons under matched constraints are needed to demonstrate the efficiency advantage of grid representations. Simply showing that grid-like patterns can be obtained by optimizing within a selected encoding family provides limited additional insight beyond existing work.
The organization also needs substantial revision. Sections 2, 3, and 4 could be combined and shortened, with many definitions and standard derivations moved to the appendix, so that the central ideas and the advance over previous work become clear much earlier.
I would currently give this paper a 2. If the authors substantially improve the organization and provide more convincing experiments supporting the paper’s core novelty and coding-efficiency claims, I would consider raising it to a 3.
Critical strengths
I think the main strength of this paper is that it uses an error lower bound within the efficient-coding framework as an optimization objective, accounting for both local decoding errors and confusion between distant locations while connecting several computational principles used in previous work to obtain grid-cell representations through optimization. This provides a unified perspective that helps simplify our understanding of these principles and their relationships.
Critical weaknesses
-
The current experiments mainly answer whether grid-like patterns can be obtained within the chosen encoding family, rather than adequately addressing why grid codes would be more efficient than other candidate encodings. This distinction matters because previous work has already discussed certain efficiency advantages of grid codes. The authors restrict the encoding form and then use gradient-based optimization to find a numerical solution. This neither rules out better performance from more general encodings nor guarantees that the best solution within the chosen family has been found. I would like to see stronger experimental evidence in two complementary directions: direct comparisons between different encoding approaches under matched constraints, and optimization of the same ZZLB objective with the non-negativity constraint in a more general encoding framework, removing the restriction to the prescribed Fourier basis. The latter would test whether grid-like representations still emerge when the search is allowed to explore a broader range of encodings.
-
The paper takes too long to get to the point, and the central contribution gets buried in the mathematical setup. By the end of Sections 2–4, readers have mainly been given the task definition and several standard reductions, while the paper’s most important new insight remains difficult to identify. I suggest combining these sections into one, retaining only the setup, conditions, and conclusions needed to understand the rest of the paper, and moving the detailed derivations to the appendix. This would bring the central idea of unifying the coding principles into focus much earlier.
Questions for authors
-
At the beginning of Section 3, the phrase “prove when” path-independent encoding is optimal led me to expect a further explanation of when path information can be ignored and when it remains important. What is currently provided is mainly a conditional-independence formulation and a Gaussian example in the appendix. Could you explain the scope of these conditions more clearly? I suspect that whether path details are useful may depend on the animal’s movement strategy, and I wonder whether this could be related to distortions in grid representations during goal-directed behavior, such as those reported by Boccara et al. (2019, Science).
-
The Jensen argument in Eq. (19) favors spatial uniformity when the mean squared neural distance is fixed for each displacement magnitude and direction, but these means can themselves vary across encoders. I think translational symmetry is a reasonable structural constraint, but the distinction needs to be clearer: the earlier conditional result motivates spatial uniformity, whereas Section 6 imposes it as an exact constraint on the encoding form. Section 7 already acknowledges that this restriction may exclude more efficient codes. Could this be clarified when introducing Eq. (25), to avoid giving the impression that a lossless reduction follows from Jensen’s inequality?
W1 "I would like to see stronger experimental evidence in two complementary directions: direct comparisons between different encoding approaches under matched constraints, and optimization of the same ZZLB objective with the non-negativity constraint in a more general encoding framework": We thank you for this suggestion and in doing so we believe our paper is now strengthened greatly. We hope we have managed to address both of your directions, through our new non parametric functional optimisation and new our grid vs place cell comparison, the full details and discussions of the results of which can be found in the restructured numerical experiments section.
W2 "The paper takes too long to get to the point" "Sections 2, 3, and 4 could be combined and shortened": We really appreciated this comment and completely agree with your assessment. We have implemented the changes as suggested and think the readability of the paper and clarity of the contributions is much improved. The main changes were combining section 2-4 as suggested which then allowed us more space to give intuition on the ZZLB including adding points touched on by reviewer 9SYc, explicitly writing the Jensen's gaps for clarity, a new numerical section better motivating the role and intention of each experiment alongside the 2 new experiments (which we detail in the general comment) and adding a contributions section.
Q1: "I wonder whether this could be related to distortions in grid representations during goal-directed behavior, such as those reported by Boccara et al. (2019, Science)" Thank you; this is an interesting connection. We see a more direct link through the source distribution than through path invariance. Our uniform source distribution, as mentioned in the paper represents, a large empty circular arena. Introducing rewards could instead motivate greater coding precision near these salient locations, modelled by assigning them greater weight, due to their increased perceived importance. The source distribution can therefore represent expected occupancy or, when interpreted as an effective weighting, the relative coding importance of different locations. As mentioned in the paper we tried to consider the most general simple model, as a next step alongside the consideration of boundaries this would be very interesting!
Q2 "The Jensen argument in Eq. (19) favors spatial uniformity when the mean squared neural distance is fixed for each displacement magnitude and direction, but these means can themselves vary across encoders." Following your organisational comments, we have clarified the intuition behind this term, particularly through the comparison with Dorrell et al. (2022). They constrain the neural update rule to depend only on source displacement, whereas our term encourages the resulting neural distance (which themselves are caused by the update rule, which we do not constrain) to depend only on displacement.
Q2 "the earlier conditional result motivates spatial uniformity, whereas Section 6 imposes it as an exact constraint on the encoding form" "Could this be clarified when introducing Eq. (25)" We agree this should have been made clear earlier, this has been updated, as well as us making the intentions of this experiment more clear.