Original: Conformal Isometry of Lie Group Representation in Recurrent Network of Grid Cells
Revised: Conformal Isometry of Lie Group Representation in Recurrent Network of Grid Cells

Original: Editors: Sophia Sanborn, Christian Shewmake, Simone Azeglio, Arianna Di Bernardo, Nina Miolane
Revised: Editors: Sophia Sanborn, Christian Shewmake, Simone Azeglio, Arianna Di Bernardo, Nina Miolane

Original: Abstract
Revised: Abstract

Original: The activity of the grid cell population in the medial entorhinal cortex (MEC) of the mammalian brain forms a vector representation of the self-position of the animal.
Revised: The activity of the grid cell population in the medial entorhinal cortex (MEC) of the mammalian brain forms a vector representation of the self-position of the animal.

Original: Recurrent neural networks have been proposed to explain the properties of the grid cells by updating the neural activity vector based on the velocity input of the animal.
Revised: Recurrent neural networks have been proposed to explain the properties of the grid cells by updating the neural activity vector based on the velocity input of the animal.

Original: In doing so, the grid cell system effectively performs path integration.
Revised: In doing so, the grid cell system effectively performs path integration.

Original: In this paper, we investigate the algebraic, geometric, and topological properties of grid cells using recurrent network models.
Revised: In this paper, we investigate the algebraic, geometric, and topological properties of grid cells using recurrent network models.

Original: Algebraically, we study the Lie group and Lie algebra of the recurrent transformation as a representation of self-motion.
Revised: Algebraically, we study the Lie group and Lie algebra of the recurrent transformation as a representation of self-motion.

Original: Geometrically, we study the conformal isometry of the Lie group representation where the local displacement of the activity vector in the neural space is proportional to the local displacement of the agent in the 2D physical space.
Revised: Geometrically, we study the conformal isometry of the Lie group representation where the local displacement of the activity vector in the neural space is proportional to the local displacement of the agent in the 2D physical space.

Original: Topologically, the compact  abelian Lie group representation automatically leads to the torus topology commonly assumed and observed in neuroscience.
Revised: Topologically, the compact and connected abelian Lie group representation automatically leads to the torus topology commonly assumed and observed in neuroscience.

Original: We then focus on a simple non-linear recurrent model that underlies the continuous attractor neural networks of grid cells.
Revised: We then focus on a simple non-linear recurrent model that underlies the continuous attractor neural networks of grid cells.

Original: Our numerical experiments show that conformal isometry leads to hexagon periodic patterns in the grid cell responses and our model is capable of accurate path integration.
Revised: Our numerical experiments show that conformal isometry leads to hexagon periodic patterns in the grid cell responses and our model is capable of accurate path integration.

Revised: Code is available at https://github.com/DehongXu/grid-cell-rnn .

Original: 1. Introduction
Revised: 1. Introduction

Original: Grid cells (Hafting et al., 2005; Fyhn et al., 2008; Yartsev et al., 2011; Killian et al., 2012; Jacobs et al., 2013; Doeller et al., 2010) in the mammalian dorsal medial entorhinal cortex (MEC) exhibit striking hexagon grid patterns when the agent (e.g., a rodent) navigates in 2D open environments (Fyhn et al., 2004; Hafting et al., 2005; Fuhs and Touretzky, 2006; Burak and Fiete, 2009; Sreenivasan and Fiete, 2011; Blair et al., 2007; Couey et al., 2013; de Almeida et al., 2009; Pastoll et al., 2013; Agmon and Burak, 2020).
Revised: Grid cells (Hafting et al., 2005; Fyhn et al., 2008; Yartsev et al., 2011; Killian et al., 2012; Jacobs et al., 2013; Doeller et al., 2010) in the mammalian dorsal medial entorhinal cortex (MEC) exhibit striking hexagon grid patterns when the agent (e.g., a rodent) navigates in 2D open environments (Fyhn et al., 2004; Hafting et al., 2005; Fuhs and Touretzky, 2006; Burak and Fiete, 2009; Sreenivasan and Fiete, 2011; Blair et al., 2007; Couey et al., 2013; de Almeida et al., 2009; Pastoll et al., 2013; Agmon and Burak, 2020).

Original: It has been hypothesized that grid cell system performs path integration (Darwin, 1873; Etienne andJeffery, 2004;
Revised: It has been hypothesized that grid cell system performs path integration (Darwin, 1873; Etienne and

Original:  Hafting et al., 2005; Fiete et al., 2008; McNaughton et al., 2006; Gil et al., 2018; Ridler et al., 2019; Horner et al., 2016).
Revised: Jeffery, 2004; Hafting et al., 2005; Fiete et al., 2008; McNaughton et al., 2006; Gil et al., 2018; Ridler et al., 2019; Horner et al., 2016).

Original: That is, the grid cells integrate the self-motion of the animal over time to keep track of the animal’s own location in space.
Revised: That is, the grid cells integrate the self-motion of the animal over time to keep track of the animal’s own location in space.

Original: This can be implemented by a recurrent neural network that takes the velocity of the self-motion as input, and transforms the activities of the grid cells based on the velocity inputs.
Revised: This can be implemented by a recurrent neural network that takes the velocity of the self-motion as input, and transforms the activities of the grid cells based on the velocity inputs.

Original: The animal’s self-position can then be decoded from the activities of the grid cells.
Revised: The animal’s self-position can then be decoded from the activities of the grid cells.

Original: Collectively, the activities of the grid cell population form a vector in the high-dimensional neural activity space.
Revised: Collectively, the activities of the grid cell population form a vector in the high-dimensional neural activity space.

Original: This provides a representation of the self-position of the agent in space.
Revised: This provides a representation of the self-position of the agent in space.

Original: The recurrent network transforms the activity vector based on the movement velocity of the agent, so that the transformation is a representation of self-motion, when considered from the perspective of representational learning.
Revised: The recurrent network transforms the activity vector based on the movement velocity of the agent, so that the transformation is a representation of self-motion, when considered from the perspective of representational learning.

Original: The vector and the transformation together form a representation of the 2D Euclidean group, which is an abelian additive Lie group.
Revised: The vector and the transformation together form a representation of the 2D Euclidean group, which is an abelian additive Lie group.

Original: In a recent paper, Gao et al.
Revised: In a recent paper, Gao et al.

Original: (2021) studied the group representation property and the isotropic scaling or conformal isometry property for the general transformation model.
Revised: (2021) studied the group representation property and the isotropic scaling or conformal isometry property for the general transformation model.

Original: In the context of linear transformation models, they connected this property to the hexagon periodic patterns of the grid cell response maps.
Revised: In the context of linear transformation models, they connected this property to the hexagon periodic patterns of the grid cell response maps.

Original: With the conformal isometry property of the transformation of the recurrent neural network, the change of the activity vector in the neural space is proportional to the input velocity of the self-motion in the 2D physical space.
Revised: With the conformal isometry property of the transformation of the recurrent neural network, the change of the activity vector in the neural space is proportional to the input velocity of the self-motion in the 2D physical space.

Original: Gao et al.

Original: (2021) justified this condition in terms of robustness to errors or noises in the neurons.

Original: Although Gao et al.
Revised: Although Gao et al.

Original: (2021) studied general transformation model theoretically, they focused on a prototype model of linear recurrent network numerically, which has an explicit algebraic and geometric structure in the form of a matrix group of rotations.
Revised: (2021) studied general transformation model theoretically, they focused on a prototype model of linear recurrent network numerically, which has an explicit algebraic and geometric structure in the form of a matrix group of rotations.

Original: In this paper, we study conformal isometry in the context of the non-linear recurrent model that underlies the hand-crafted continuous attractor neural network (CANN) (Burak and Fiete, 2009; Couey et al., 2013; Pastoll et al., 2013; Agmon and Burak, 2020).
Revised: In this paper, we study conformal isometry in the context of the non-linear recurrent model that underlies the hand-crafted continuous attractor neural network (CANN) (Burak and Fiete, 2009; Couey et al., 2013; Pastoll et al., 2013; Agmon and Burak, 2020).

Original: In particular, we will focus on the vanilla version of the recurrent network that is linear in the vector representation of self-position and is additive in the input velocity, followed by an element-wise non-linear rectification (such as ReLU non-linearity).
Revised: In particular, we will focus on the vanilla version of the recurrent network that is linear in the vector representation of self-position and is additive in the input velocity, followed by an element-wise non-linear rectification (such as ReLU).

Original: This model has the simplicity that it is additive in input velocity before rectification.
Revised: This model has the simplicity that it is additive in input velocity before rectification.

Original: We also explore more complex variants for non-linear recurrent networks, such as the long short-term memory network (LSTM) (Hochreiter and Schmidhuber, 1997).
Revised: We also explore more complex variants for nonlinear recurrent networks, such as the long short-term memory network (LSTM) (Hochreiter and Schmidhuber, 1997).

Original: Such models have been studied in recent work (Cueva and Wei, 2018;
Revised: Such models have been studied in recent works (Cueva and Wei, 2018;

Original: Banino et al., 2018; Sorscher et al., 2019; Cueva et al., 2020).
Revised: Banino et al., 2018; Sorscher et al., 2019; Cueva et al., 2020).

Original: Our numerical experiments show that our conformal isometry condition is able to learn highly structured multi-scale hexagon grid code, consistent with the properties of experimentally observed grid cells of rodents.
Revised: Our numerical experiments show that our conformal isometry condition is able to learn highly structured multi-scale hexagon grid code, consistent with the properties of experimentally observed grid cells of rodents.

Original: In addition, our learned model is capable of accurate path integration over a long distance.
Revised: In addition, our learned model is capable of accurate path integration over a long distance.

Original: Our results generalize previous results of linear network models in Gao et al.
Revised: Our results generalize previous results of linear network models in Gao et al.

Original: to an important class of non-linear neural network models in theoretical neuroscience that are more physiologically realistic.
Revised: to an important class of non-linear neural network models in theoretical neuroscience that are more physiologically realistic.

Original: The main contributions of our paper are as follows.

Original: (1) We investigate the algebraic, geometric, and topological properties of the transformation models of grid cells.

Original: (2) We study a simple non-linear recurrent network that underlies the hand-crafted continuous attractor networks for grid cells, and our numerical experiments suggest that conformal isometry is linked to hexagonal periodic patterns of grid cells.

Original: 2. Lie group representation and conformal isometry 2.1. Representations of self-position and self-motion
Revised: 2. Lie group representation and conformal isometry 2.1. Representations of self-position and self-motion

Original: We start by introducing the basic components of our model.
Revised: We start by introducing the basic components of our model.

Original: x = ( x 1 , x 2 ) ∈
Revised: x = ( x 1 , x 2 ) ∈

Original: R 2 denotes the position of the agent.
Revised: R 2 denotes the agent’s position.

Original: Let ∆ x = ( ∆ x 1 , ∆ x 2 ) be the input velocity of the self-motion, i.e., displacement of the agent within a unit time, so that the agent moves from x to x + ∆ x after the unit time.
Revised: Let ∆ x = (∆ x 1 , ∆ x 2 ) be the input velocity of the self-motion, i.e., displacement of the agent within a unit time, after which the agent moves from x to x + ∆ x .

Original: We assume v ( x ) =
Revised: We assume v ( x ) =

Original: ( v i ( x ) , i = 1 ,..., D ) to be the vector representation of self-position x , where each element v i ( x ) can be interpreted as the activity of a grid cell when the agent is at position x .
Revised: ( v i ( x ) , i = 1 , ..., D ) to be the vector representation of self-position x , where each element v i ( x ) can be interpreted as the activity of a grid cell when the agent is at position x .

Original: ( v i ( x ) , ∀ x ) corresponds to the response map of grid cell i .
Revised: ( v i ( x ) , ∀ x ) corresponds to the response map of grid cell i .

Original: D is the dimensionality of v , i.e., the number of grid cells.
Revised: D is the dimensionality of v , i.e., the number of grid cells.

Original: We refer to the space of v as the “neural space”.
Revised: We refer to the space of v as the “neural space”.

Original: We normalize ∥ v ( x ) ∥ = 1 in our experiments.
Revised: We normalize ∥ v ( x ) ∥ = 1 in our experiments.

Original: The set ( v ( x ) , x ∈ R 2 ) forms a 2D manifold, or an embedding of R 2 , in the D -dimensional neural space.
Revised: The set ( v ( x ) , x ∈ R 2 ) forms a 2D manifold, or an embedding of R 2 , in the D -dimensional neural space.

Original: We will refer to ( v ( x ) , x ∈ R 2 ) as the “coding manifold”.
Revised: We will refer to ( v ( x ) , x ∈ R 2 ) as the “coding manifold”.

Original: With self-motion ∆ x , the vector representation v ( x ) is transformed to v ( x + ∆ x ) by a general transformation model:
Revised: With self-motion ∆ x , the vector representation v ( x ) is transformed to v ( x + ∆ x ) by a general transformation model:

Original: [Equation]
Revised: [Equation]

Original: where by simplifying F ( · , ∆ x ) as F ∆ x ( · ) in notation, we emphasize that the transformation F is dependent on ∆ x .
Revised: where by simplifying F ( · , ∆ x ) as F ∆ x ( · ) in notation, we emphasize that the transformation F is dependent on ∆ x .

Original: While v ( x ) is a representation of x , F ∆ x is a representation of ∆ x .
Revised: While v ( x ) is a representation of x , F ∆ x is a representation of ∆ x .

Original: ( v ( x ) , ∀ x ) and ( F ∆ x ( · ) , ∀ ∆ x ) together form a representation of the 2D additive Euclidean group R 2 , which is an abelian Lie group.
Revised: ( v ( x ) , ∀ x ) and ( F ∆ x ( · ) , ∀ ∆ x ) together form a representation of the 2D additive Euclidean group R 2 , which is an abelian Lie group.

Original: Specifically, we have the following group representation condition for the transformation model:
Revised: Specifically, we have the following group representation condition for the transformation model:

Original: Condition 1.
Revised: Condition 1.

Original: (Algebraic condition on Lie group representation).
Revised: (Algebraic condition on Lie group representation).

Original: For any x , we have (1) F 0 ( v ( x ))
Revised: For any x , we have (1) F 0 ( v ( x ))

Original: = v ( x ) , and (2) F ∆ x 1 + ∆ x 2 ( v ( x ))
Revised: = v ( x ) , and (2) F ∆ x 1 +∆ x 2 ( v ( x ))

Original: =
Revised: =

Original: F ∆ x 2 ( F ∆ x 1 ( v ( x )))
Revised: F ∆ x 2 ( F ∆ x 1 ( v ( x )))

Original: =
Revised: =

Original: F ∆ x 1 ( F ∆ x 2 ( v ( x ))) for any ∆ x 1 and ∆ x 2 .
Revised: F ∆ x 1 ( F ∆ x 2 ( v ( x ))) for any ∆ x 1 and ∆ x 2 .

Original: Condition 1(1) requires that the coding manifold ( v ( x ) , ∀ x ) are fixed points of F 0 with ∆ x = 0.
Revised: Condition 1(1) requires that the coding manifold ( v ( x ) , ∀ x ) are fixed points of F 0 with ∆ x = 0 .

Original: If F 0 is further a contraction off the coding manifold, then ( v ( x ) , ∀ x ) are the attractor points of F 0 .
Revised: If F 0 is further a contraction off the coding manifold, then ( v ( x ) , ∀ x ) are the attractor points of F 0 .

Original: Condition 1(2) requires that moving in one step with displacement ∆ x 1 + ∆ x 2 should be the same as moving in two steps with displacements ∆ x 1 and ∆ x 2 respectively.
Revised: Condition 1(2) requires that moving in one step with displacement ∆ x 1 + ∆ x 2 should be the same as moving in two steps with displacements ∆ x 1 and ∆ xrespectively.

Original: The group representation condition is the necessary condition for any valid transformation model (Equation (1)) of grid cells.
Revised: The group representation condition is the necessary condition for any valid transformation model (Equation (1)) of grid cells.

Original: Group representation is a central theme in modern mathematics and physics (Zee, 2016).
Revised: Group representation is a central theme in modern mathematics and physics (Zee, 2016).

Original: However, most of the transformations studied in mathematics and physics are linear transformations that form matrix groups, and the coding manifold ( v ( x ) , ∀ x ) is often made implicit.
Revised: However, most of the transformations studied in mathematics and physics are linear transformations that form matrix groups, and the coding manifold ( v ( x ) , ∀ x ) is often made implicit.

Original: Gao et al.
Revised: Gao et al.

Original: (2019) focused on matrix groups, with F ∆ x ( v ( x )) =
Revised: (2019) focused on matrix groups, with F ∆ x ( v ( x )) =

Original: M ( ∆ x ) v ( x ) , so that M ( ∆ x 1 + ∆ x 2 ) v ( x ) = M ( ∆ x 1 ) M ( ∆ x 2 ) v ( x ) = M ( ∆ x 2 ) M ( ∆ x 1 ) v ( x ) .
Revised: M (∆ x ) v ( x ) , so that M (∆ x 1 + ∆ x 2 ) v ( x ) = M (∆ x 1 ) M (∆ x 2 ) v ( x ) = M (∆ x 2 ) M (∆ x 1 ) v ( x ) .

Original: Gao et al.
Revised: Gao et al.

Original: (2021) studied general transformation model theoretically, but then focused on the linear transformation model in their numerical experiments.
Revised: (2021) studied general transformation model theoretically, but then focused on the linear transformation model in their numerical experiments.

Original: Since the transformations in recurrent neural networks are usually non-linear, we will focus on non-linear transformation models in this paper.
Revised: Since the transformations in RNN are usually non-linear, we will focus on non-linear transformation models in this paper.

Original: 2.2. Conformal embedding and conformal isometry
Revised: 2.2. Conformal embedding and conformal isometry

Original: For an infinitesimal self-motion δ x , it is straightforward to derive a first-order Taylor expansion of the transformation model in Equation (1) with respect to δ x
Revised: For an infinitesimal self-motion δ x , it is straightforward to derive a first-order Taylor expansion of the transformation model in Equation (1) with respect to δ x

Original: [Equation]
Revised: [Equation]

Original: where f ( v ( x ))
Revised: where f ( v ( x ))

Original: = ∂ F ∆ x ∂ ∆ x ⊤ ( v ( x ))
Revised: = ∂F ∆ x ∂ ∆ x ⊤ ( v ( x ))

Original: | ∆ x = 0 is a D × 2 matrix.
Revised: | ∆ x =0 is a D × 2 matrix.

Original: While ( F ∆ x , ∀ ∆ x ∈ R 2 ) forms an abelian Lie group, its derivative of ∆ x at 0, i.e., f , spans its Lie algebra.
Revised: While ( F ∆ x , ∀ ∆ x ∈ R 2 ) forms an abelian Lie group, its derivative of ∆ x at 0 , i.e., f , spans its Lie algebra.

Original: Both F ∆ x and f are transformations acting on the coding manifold ( v ( x ) , ∀ x ) .
Revised: Both F ∆ x and f are transformations acting on the coding manifold ( v ( x ) , ∀ x ) .

Original: We identify the conformal isometry condition of the Lie group representation as follows:
Revised: We identify the conformal isometry condition of the Lie group representation as follows:

Original: Condition 2.
Revised: Condition 2.

Original: (Geometric condition on conformal embedding and conformal isometry).
Revised: (Geometric condition on conformal embedding and conformal isometry).

Original: [Equation]
Revised: [Equation]

Original: where I 2 is the 2-dimensional identity matrix.
Revised: where I 2 is the 2-dimensional identity matrix.

Original: That is, the two column vectors of f ( v ( x )) are of equal norm s, and are orthogonal to each other.
Revised: That is, the two column vectors of f ( v ( x )) are of equal norm s , and are orthogonal to each other.

Original: Under the condition above, v ( x + δ x ) − v ( x ) ≈ f
Revised: Under the condition above, v ( x + δ x ) − v ( x ) ≈ f

Original: ( v ( x ))
Revised: ( v ( x ))

Original: δ x is conformal to δ x , i.e., the 2D local Euclidean space of ( δ x ) in the physical space is embedded conformally as another 2D local Euclidean space f
Revised: δ x is conformal to δ x , i.e., the 2D local Euclidean space of ( δ x ) in the physical space is embedded conformally as another 2D local Euclidean space f

Original: ( v ( x ))
Revised: ( v ( x ))

Original: δ x in the neural activity space.
Revised: δ x in the neural activity space.

Original: We only need to replace the two orthogonal axes for δ x in the 2D physical space by the two column vectors of f ( v ( x )) in the neural activity space.
Revised: We only need to replace the two orthogonal axes for δ x in the 2D physical space by the two column vectors of f ( v ( x )) in the neural activity space.

Original: An equivalent statement for the above condition is
Revised: An equivalent statement for the above condition is

Original: [Equation]
Revised: [Equation]

Original: [Equation]

Original: That is, the displacement in the neural space is proportional to the displacement in the 2D physical space.
Revised: That is, the displacement in the neural space is proportional to that in the 2D physical space.

Original: Note that since our analysis is local, s may depend on x .
Revised: Note that since our analysis is local, s may depend on x .

Original: If s is a global constant, then the coding manifold ( v ( x ) , ∀ x ) has a flat intrinsic geometry (imagining folding a piece of paper without stretching it).
Revised: If s is a global constant, then the coding manifold ( v ( x ) , ∀ x ) has a flat intrinsic geometry (imagining folding a piece of paper without stretching it).

Original: Gao et al.

Original: (2021) studied the conformal isometry property in a local polar coordinate system.

Original: In our definition above, we use 2D cartesian coordinate system, which is more convenient for the non-linear recurrent model where ∆ x enters the model additively.

Original: In the context of linear recurrent networks, Gao et al.

Original: (2021) linked the conformal isometry to the hexagon grid patterns of grid cells.

Original: 2.3. 2D torus, 2D periodicity, and hexagon grid patterns
Revised: 2.3. 2D torus, 2D periodicity, and hexagon grid patterns

Original: The 2D torus topology is commonly assumed a priori in the continuous attractor neural networks (CANN) for grid cells (Burak and Fiete, 2009; Couey et al., 2013; Pastoll et al., 2013; Agmon and Burak, 2020).
Revised: The 2D torus topology is commonly assumed a priori in the continuous attractor neural networks (CANN) for grid cells (Burak and Fiete, 2009; Couey et al., 2013; Pastoll et al., 2013; Agmon and Burak, 2020).

Original: The torus topology has been recently supported by analyzing data from population of simultaneously recorded grid cells (Gardner et al., 2022).
Revised: The torus topology has been recently supported by analyzing data from population of simultaneously recorded grid cells (Gardner et al., 2022).

Original: Within our framework, we find that such a topology is in fact a theoretical consequence of the group representation condition (Condition 1) due to a theorem in Lie group theory.
Revised: Within our framework, we find that such a topology is in fact a theoretical consequence of the group representation condition (Condition 1) due to a theorem in Lie group theory.

Original: Specifically, since the elements of v ( x ) represent  neuron activities,which are bounded biologically, the coding manifold ( v ( x ) , ∀ x ) is bounded and compact, and therefore the group of ( F ∆ x , ∀ ∆ x ) is also compact.
Revised: Specifically, since the elements of v ( x ) represent biologically bounded neuron activities, the coding manifold ( v ( x ) , ∀ x ) is bounded and compact, and therefore the group of ( F ∆ x , ∀ ∆ x ) is also compact.

Original: The Lie group ( F ∆ x , ∀ ∆ x ) is also connected since the 2D environment is connected.
Revised: The Lie group ( F ∆ x , ∀ ∆ x ) is also connected since the 2D environment is connected.

Original: According to Lie group theory (Dwyer and Wilkerson, 1998), if the abelian Lie group ( F ∆ x , ∀ ∆ x )is compact and connected, then it has a topology of 2D torus, i.e., it is isomorphic to S 1 × S 1 , where Sis a circle.
Revised: According to Lie group theory (Dwyer and Wilkerson, 1998), a compact and connected abelian Lie group ( F ∆ x , ∀ ∆ x ) has a topology of 2D torus, i.e., it is isomorphic to S 1 × S 1 , where S 1 is a circle.

Original: Thus ( v ( x ) =
Revised: Thus ( v ( x ) =

Original: F x ( v ( 0 )) , ∀ x ∈ R 2 ) also forms a 2D torus.
Revised: F x ( v (0)) , ∀ x ∈ R 2 ) also forms a 2D torus.

Original: While the group representation condition only gives us an algebraic structure, the conformal isometry condition (Condition 2) further fixes the geometry.
Revised: While the group representation condition only gives us an algebraic structure, the conformal isometry condition (Condition 2) further fixes the geometry.

Original: Under the conformal isometry condition, if we further assume that the scaling factor s is a constant globally for all x , then the intrinsic geometry of the coding manifold ( v ( x ) , ∀ x ) remains Euclidean, and the coding manifold is a flat torus.
Revised: Under the conformal isometry condition, if we further assume that the scaling factor s is a constant globally for all x , then the intrinsic geometry of the coding manifold ( v ( x ) , ∀ x ) remains Euclidean, and the coding manifold is a flat torus.

Original: That is, the coding manifold is not only isomorphic to S 1 × S 1 , but is also conformally isometric to S 1 × S 1 .
Revised: That is, the coding manifold is not only isomorphic to S 1 × S 1 , but is also conformally isometric to S 1 × S 1 .

Original: While isomorphism is defined by mapping between two spaces, isometry concerns about the metric properties.
Revised: While isomorphism is defined by mapping between two spaces, isometry concerns about the metric properties.

Original: This leads to the periodic pattern in ( v ( x ) , ∀ x ) over x 
Revised: This leads to the periodic pattern in ( v ( x ) , ∀ x ) over x .

Original: According to the theory of 2D Bravais lattice for 2D periodic patterns (Ashcroft et al., 1976), we can find two primitive vectors ∆ x 1 and ∆ x 2 , with ∥ ∆ x 1 ∥ = ∥
Revised: According to the theory of 2D Bravais lattice for 2D periodic patterns (Ashcroft et al., 1976), we can find two primitive vectors ∆ x 1 and ∆ x 2 , with ∥ ∆ x 1 ∥ = ∥

Original: ∆ x 2 ∥ , and v ( x + k 1 ∆ x 1 + k 2 ∆ x 2 ) = v ( x ) for arbitrary integers k 1 and k 2 .
Revised: ∆ x 2 ∥ , and v ( x + k 1 ∆ x 1 + k 2 ∆ x 2 ) = v ( x ) for arbitrary integers k 1 and k 2 .

Original: Along each primitive vector, for each period, ( v ( x + c ∆ x i ) , c ∈ [ 0 , 1 ]) traces out a circle in the neural space for i = 1 , 2, causing the periodicity in v ( x ) .
Revised: Along each primitive vector, for each period, ( v ( x + c ∆ x i ) , c ∈ [0 , 1]) traces out a circle in the neural space for i = 1 , 2 , causing the periodicity in v ( x ) .

Original: According to the theory of 2D Bravais lattice, the angle between ∆ x 1 and ∆ x 2 can either be π / 2 for square lattice or 2 π / 3 for hexagon lattice.
Revised: According to the theory of 2D Bravais lattice, the angle between ∆ x 1 and ∆ x 2 can either be π/ 2 for square lattice or 2 π/ 3 for hexagon lattice.

Original: It is likely that the hexagon periodicity provides a better fit to place cells, in that the hexagon lattice provides denser packing of discrete Fourier components.
Revised: It is likely that the hexagon periodicity provides a better fit to place cells, in that the hexagon lattice provides denser packing of discrete Fourier components.

Original: While this seems to be intuitive, currently we have not been able to prove this point rigorously.
Revised: While this seems to be intuitive, currently we have not been able to prove this point rigorously.

Original: It seems that hexagonal periodicity emerges under the general conditions of group representation and conformal isometry, independent of a specific form of the transformation model, as we observe empirically in our numerical experiments (Section 5).
Revised: It seems that hexagonal periodicity emerges under the general conditions of group representation and conformal isometry, independent of a specific form of the transformation model, as we observe empirically in our numerical experiments (Section 5).

Original: 3. Non-linear recurrent neural network 3.1. Model
Revised: 3. Non-linear recurrent neural network 3.1. Model

Original: In this paper, we mainly focus on studying transformations F ∆ x ( · ) that are locally approximated by non-linear recurrent neural networks, as studied in recent work (Cueva and Wei, 2018; Banino et al., 2018;
Revised: In this paper, we mainly focus on studying transformations F ∆ x ( · ) that are locally approximated by non-linear recurrent neural networks, as studied in recent work (Cueva and Wei, 2018; Banino et al., 2018;

Original: Sorscher et al., 2019; Cueva et al., 2020).
Revised: Sorscher et al., 2019; Cueva et al., 2020).

Original: We start by assuming the following vanilla version of a non-linear recurrent network:
Revised: We start by assuming the following vanilla version of a non-linear recurrent network:

Original: [Equation]
Revised: [Equation]

Original: where ReLU ( a ) = max ( 0 , a ) is applied element-wise, W is a D × D weight matrix of recurrent connections, U is a D × 2 matrix, and the self-motion ∆ x = ( ∆ x 1 , ∆ x 2 ) ⊤ is treated as 2 × 1 vector.
Revised: where ReLU( a ) = max(0 , a ) is applied element-wise, W is a D × D weight matrix of recurrent connections, U is a D × 2 matrix, and the self-motion ∆ x = (∆ x 1 , ∆ x 2 ) ⊤ is treated as 2 ×vector.

Original: Note that the above model is an accurate approximation to F ∆ x ( · ) only for small ∆ x , as it may not satisfy Condition 1 in general for large ∆ x .
Revised: Note that the above model is an accurate approximation to F ∆ x ( · ) only for small ∆ x , as it may not satisfy Condition 1 in general for large ∆ x .

Original: Following Condition 1(1), for ∆ x = 

Revised: Following Condition 1(1), for ∆ x =

Original: we have v ( x ) =
Revised: we have v ( x ) =

Original: ReLU ( W v ( x )) .
Revised: ReLU( W v ( x )) .

Original: That is, the coding manifold ( v ( x ) , ∀ x ) consists of the fixed points of F 0 ( · ) .
Revised: That is, the coding manifold ( v ( x ) , ∀ x ) consists of the fixed points of F 0 ( · ) .

Original: Compared to the matrix group in Gao et al.
Revised: Compared to the matrix group in Gao et al.

Original: (2019) where F ∆ x ( v ( x ))
Revised: (2019) where F ∆ x ( v ( x ))

Original: =
Revised: =

Original: M ( ∆ x ) v ( x ) , and M ( ∆ x ) is further derived in Gao et al.
Revised: M (∆ x ) v ( x ) , and M (∆ x ) is further derived in Gao et al.

Original: (2021) as an exponential map that is highly non-linear in ∆ x , the above model (5) is much simpler and more biologically plausible in that, before ReLU, we have a single recurrent weight matrix W that is independent of ∆ x , and ∆ x enters the equation additively.
Revised: (2021) as an exponential map that is highly non-linear in ∆ x , the above model (5) is much simpler and more biologically plausible. Before ReLU, we have a single recurrent weight matrix W that is independent of ∆ x , and ∆ x enters the equation additively.

Original: The ReLU rectification plays a critical role for the overall non-linear effect of ∆ x .
Revised: The ReLU rectification plays a critical role for the overall non-linear effect of ∆ x .

Original: The non-linear rectification in neural networks makes the transformations much more expressive than matrix representations in modern mathematics and physics.
Revised: The non-linear rectification in neural networks makes the transformations much more expressive than matrix representations in modern mathematics and physics.

Original: For this model, we can derive f ( v ( x )) as
Revised: For this model, we can derive f ( v ( x )) as

Original: [Equation]
Revised: [Equation]

Original: (6) where 1 ( · ) is a vector of binary indicators calculated element-wise, and ⊙ is row-wise product.
Revised: where 1 ( · ) is a vector of binary indicators calculated element-wise, and ⊙ is row-wise product.

Original: The indicator vector 1 ( W v ( x ) > 0 ) changes as x changes, and it controls the change of v in the neural space according to ∆ x .
Revised: The indicator vector 1 ( W v ( x ) > 0 ) changes as x changes, and it controls the change of v in the neural space according to ∆ x .

Original: Since 1 ( · ) is not differentiable, we propose to define the loss function to enforce the conformal isometry condition based on the equivalent statement in Equation (4), as discussed in Section 4.3.
Revised: Since 1 ( · ) is not differentiable, we propose to define the loss function to enforce the conformal isometry condition based on the equivalent statement in Equation (4), as discussed in Section 4.3.

Original: In Appendix C, we also discuss a possible mechanism where conform isometry can be automatically satisfied by design.
Revised: In Appendix C, we also discuss a possible mechanism where conform isometry can be automatically satisfied by design.

Original: Modules.
Revised: Modules.

Original: Sinceit is well-known that biological grid cells are organized in discrete modules with different spatial scales (Stensola et al., 2012; Barry et al., 2007),we assume that in our model, the vector representations v ( x ) are divided into sub-vectors analogous to modules.
Revised: Since biological grid cells are organized in discrete modules with different spatial scales (Stensola et al., 2012; Barry et al., 2007), our model assumes that the vector representations v ( x ) are divided into sub-vectors analogous to modules.

Original: Accordingly,we assume that the transformation is also module-wise by assuming W is block-diagonal and U is divided into sub-blocks by row.
Revised: Accordingly, the transformation should also be module-wise: W is block-diagonal and U is divided into sub-blocks by row.

Original: To address the point that the module-wise transformation construction is just to keep the consistency with isometry assumption but not the reason for the emergence of hexagonal periodicity, we have performed an ablation study (see Appendix A.3).
Revised: To address the point that the module-wise transformation construction is just to keep the consistency with isometry assumption but not the reason for the emergence of hexagonal periodicity, we have performed an ablation study (see Appendix A.3).

Original: More complex transformations.
Revised: More complex transformations.

Original: We also explore the Long Short-Term Memory network (LSTM) (Hochreiter and Schmidhuber, 1997), a more complex variant of recurrent networks, as the local transformation model.
Revised: For local transformation models, we also explore the Long Short-Term Memory network (LSTM) (Hochreiter and Schmidhuber, 1997), a more complex variant of recurrent networks.

Original: In the experiments, we observed that hexagonal grid patternscan emerge in both types of transformation models, implying that the emergence of hexagonal periodicity under the conformal isometry condition is not specific to the particular form of the transformation model, at least empirically.
Revised: We observed the hexagonal grid patterns in both types of transformation models: empirically, hexagonal periodicity under the conformal isometry condition is not specific to the particular form of the transformation model.

Original: 3.2. Eigen analysis
Revised: 3.2. Eigen analysis

Original: Next, we will deepen our theoretical understanding of the model (5) by conducting eigen analysis under the conformal isometry condition.
Revised: Next, we will deepen our theoretical understanding of the model (5) by conducting eigen analysis under the conformal isometry condition.

Original: Theorem 1.
Revised: Theorem 1.

Original: Under conformal isometry condition, for every x , the two columns of 1 ( W v ( x ) > 0 ) ⊙ U are orthogonal, and they are eigenvectors of 1 ( W v ( x ) > 0 ) ⊙ W with eigenvalue 1.
Revised: Under conformal isometry condition, for every x , the two columns of 1 ( W v ( x ) > 0 ) ⊙ U are orthogonal, and they are eigenvectors of 1 ( W v ( x ) > 0 ) ⊙ W with eigenvalue 1.

Original: See Appendix B for proof.
Revised: See Appendix B for proof.

Original: If the magnitudes of all the other eigenvalues of 1 ( W v ( x ) > 0 ) ⊙ W are less than 1, the recurrent network is a contraction off the coding manifold, which is similar to the eigen structures of general continuous attractor neural networks as shown in Fung et al.
Revised: If the magnitudes of all the other eigenvalues of 1 ( W v ( x ) > 0 ) ⊙ W are less than 1, the recurrent network is a contraction off the coding manifold, which is similar to the eigen structures of general continuous attractor neural networks as shown in Fung et al.

Original: 4. Reconstructing place cells and learning by numerical optimization 4.1. Place cells and decoding
Revised: 4. Reconstructing place cells and learning by numerical optimization 4.1. Place cells and decoding

Original: For open fields, wecan model place cells (O’Keefe, 1979) by Gaussian kernels and connect them to grid cells by thefollowing basis expansion model (Dordek et al., 2016;
Revised: For open fields, we model place cells (O’Keefe, 1979) by Gaussian kernels and connect them to grid cells by the basis expansion model (Dordek et al., 2016;

Original: Sorscher et al., 2019):
Revised: Sorscher et al., 2019):

Original: [Equation]
Revised: [Equation]

Original: where A ( x , p ) represent the place field centered at position p .
Revised: where A ( x , p ) represent the place field centered at position p .

Original: A ( x , p ) measures the adjacency of x to p .
Revised: A ( x , p ) measures the adjacency of x to p .

Original: q ( p ) is the query vector ofthe place cell p , which can be interpreted as connection weights between the grid cells andthe place cell p .
Revised: q ( p ) is the query vector of place cell p , which can be interpreted as connection weights between the grid cells and place cell p .

Original: Fora vector v , we can decode its position ˆ x by
Revised: For vector v , we can decode its position ˆ x by

Original: [Equation]
Revised: [Equation]

Original: 8) i.e., we choose the position p that is closest to the position encoded by v .
Revised: i.e., we choose the position p that is closest to the position encoded by v .

Original: In our experiments, we learn the query vectors ( q ( p ) , ∀ p ) together with ( v ( x ) , ∀ x ) , W , U .
Revised: In our experiments, we learn the query vectors ( q ( p ) , ∀ p ) together with ( v ( x ) , ∀ x ) , W , U .

Original: 4.2. Peter-Weyl theory
Revised: 4.2. Peter-Weyl theory

Original: In the model defined by Equation (7), v ( x ) generated by the transformation model serves as a set of basis functions to reconstruct the set of functions
Revised: In the model defined by Equation (7), v ( x ) generated by the transformation model serves as a set of basis functions to reconstruct the set of functions

Original: A ( x , p ) , ∀ p .
Revised: A ( x , p ) , ∀ p .

Original: This is related to the Peter-Weyl theory (Taylor, 2002), which generalizes the Fourier analysis to Lie group and shows that the basis functions arise from Lie group representation.
Revised: This is related to the Peter-Weyl theory (Taylor, 2002), which generalizes the Fourier analysis to Lie group and shows that the basis functions arise from Lie group representation.

Original: v ( x ) can be used to reconstruct and interpolate value functions of x in general.
Revised: v ( x ) can be used to reconstruct and interpolate value functions of x in general.

Original: Peter-Weyl theory is about matrix Lie groups and irreducible representations.
Revised: Peter-Weyl theory is about matrix Lie groups and irreducible representations.

Original: In our work, we focus on non-linear transformation groups which can still generate basis functions.
Revised: In our work, we focus on non-linear transformation groups which can still generate basis functions.

Original: Peter-Weyl theory naturally connects two roles of grid cells: (1) path integration, and (2) basis expansion.
Revised: Peter-Weyl theory naturally connects two roles of grid cells: (1) path integration, and (2) basis expansion.

Original: It can be interesting to generalize Peter-Weyl theory to non-linear transformations.
Revised: It can be interesting to generalize Peter-Weyl theory to non-linear transformations.

Original: 4.3. Loss function
Revised: 4.3. Loss function

Original: Assuming the kernel A ( x , p ) is given as in Equation (7), we can learn the model by minimizing the following loss term:
Revised: Assuming the kernel A ( x , p ) is given as in Equation (7), we can learn the model by minimizing the following loss term:

Original: [Equation]
Revised: [Equation]

Original: [Equation]
Revised: [Equation]

Original: The learnable parameters includes ( v ( x ) , ∀ x ) , ( q ( p ) , ∀ p ) , and parameters in F ∆ x .
Revised: The learnable parameters includes ( v ( x ) , ∀ x ) , ( q ( p ) , ∀ p ) , and parameters in F ∆ x .

Original: The expectations are estimated by Monte Carlo samples from simulated trajectories.
Revised: The expectations are estimated by Monte Carlo samples from simulated trajectories.

Original: A ( x , p ) are Gaussian kernels with predefined σ .
Revised: A ( x , p ) are Gaussian kernels with predefined σ .

Original: In practice, we add an additional zero-step version of L 1 , i.e. the expectation term changes to [ A ( x , p ) − ⟨ v ( x ) , q ( p ) ⟩ ] 2 .
Revised: In practice, we add an additional zero-step version of L 1 , i.e. the expectation term changes to [ A ( x , p ) − ⟨ v ( x ) , q ( p ) ⟩ ] 2 .

Original: To ensure that the conformal isometry condition is satisfied, we add an extra loss term based on the equivalent statement of conformal isometry.
Revised: To ensure that the conformal isometry condition is satisfied, we add an extra loss term based on the equivalent statement of conformal isometry.

Original: Following Equation (4), for simplicity, we first denote s ( x , ∆ [Equation]
Revised: Following Equation (4), for simplicity, we first denote s ( x , ∆ x ) =

Original: =
Revised: ( ∥ v ( x ) − v ( x + ∆ x ) ∥ / ∥

Original: [Equation]
Revised: ∆ x ∥ ) 2 .

Original: Then we propose a conformal isometry loss:
Revised: Then we propose a conformal isometry loss:

Original: [Equation]
Revised: [Equation]

Original: where ∆ x 1 and ∆ x 2 are sampled such that they have the same length ∆ r but with different directions, i.e. ∆ x 1 = ( ∆ r cos θ 1 , ∆ r sin θ 1 ) , ∆ x 2 = ( ∆ r cos θ 2 , ∆ r sin θ 2 ) .
Revised: where ∆ x 1 and ∆ x 2 are sampled such that they have the same length ∆ r but with different directions, i.e. ∆ x 1 = (∆ r cos θ 1 , ∆ r sin θ 1 ) , ∆ x 2 = (∆ r cos θ 2 , ∆ r sin θ 2 ) .

Original: Moreover, we add another regularization term to penalize ∥ q ( p ) ∥ 2 .
Revised: Moreover, we add another regularization term to penalize ∥ q ( p ) ∥ 2 .

Original: 5. Experiments
Revised: 5. Experiments

Original: We optimized the model using simulated trajectories as training data.
Revised: We optimized the model using simulated trajectories as training data.

Original: The environment was assumed to be a 1m × 1m squared open field, discretized into a 40 × 40 lattice.
Revised: The environment was assumed to be a 1 m × 1 m squared open field, discretized into a 40 × 40 lattice.

Original: v ( x ) is of 1800 dimensions, which was partitioned into 150 modules with module size 12.
Revised: v ( x ) is of 1800 dimensions, which was partitioned into 150 modules with module size 12 .

Original: For A ( x , p ) , we used a Gaussian adjacency kernel with σ = 0 .
Revised: For A ( x , p ) , we used a Gaussian adjacency kernel with σ = 0 .

Original: We trained a 10-step recurrent network as the transformation model, i.e., T = 10 in the loss term L 1 .
Revised: We trained a 10-step recurrent network as the transformation model, i.e., T = 10 in the loss term L 1 .

Original: For L 1 , the displacement of ∆ x t was restricted to be smaller than 3 grids.
Revised: For L 1 , the displacement of ∆ x t was restricted to be smaller than 3 grids.

Original: For the range of ∆ r in L 2 , we hypothesize that it can be proportional to the scale of the module (i.e., s in Equation (4)), which is also reflected as the scale of the learned hexagon patterns.
Revised: For the range of ∆ r in L 2 , we hypothesize that it can be proportional to the scale of the module (i.e., s in Equation (4)), which is also reflected as the scale of the learned hexagon patterns.

Original: Thus we adaptively adjusted the upper bound of ∆ r for each module during training, based on the scale of the learned hexagon patterns at the current training stage.
Revised: Thus we adaptively adjusted the upper bound of ∆ r for each module during training, based on the scale of the learned hexagon patterns at the current training stage.

Original: We averaged the scales of the learned patterns within each module to represent the scale of that module.
Revised: We averaged the scales of the learned patterns within each module to represent the scale of that module.

Original: We set the upper bound of ∆ r for the module with the largest average scale to be 15 grids.
Revised: We set the upper bound of ∆ r for the module with the largest average scale to be 15 grids.

Original: The ranges of ∆ r for the remaining modules are adjusted according to their scales.
Revised: The ranges of ∆ r for the remaining modules are adjusted according to their scales.

Original: 5.1. Hexagon patterns
Revised: 5.1. Hexagon patterns

Original: Figure 1 shows the learned firing patterns of v ( x )
Revised: Figure 1 shows the learned firing patterns of v ( x )

Original: = ( v i ( x ) , i = 1 ,..., d ) over the 40 × 40 lattice of x .
Revised: = ( v i ( x ) , i = 1 , ..., d ) over the 40 ×lattice of x .

Original: We randomly selected 16 modules out of 150 modules for visualization purposes.
Revised: We randomly selected 16 modules out of 150 modules for visualization purposes.

Original: Each image corresponds to the response map of a grid cell.
Revised: Each image corresponds to the response map of a grid cell.

Original: Every row shows the learned units that belong to the same module.
Revised: Every row shows the learned units that belong to the same module.

Original: The hexagonal patterns in the emerging activity patterns are evident.
Revised: The hexagonal patterns in the emerging activity patterns are evident.

Original: We found that the loss term for imposing the conformal isometry was critical.
Revised: We found that the loss term for imposing the conformal isometry was critical.

Original: Without it, the learned response maps showed stripe-like patterns (see Appendix A.3 for ablation results).
Revised: Without it, the learned response maps showed stripe-like patterns (see Appendix A.3 for ablation results).

Original:  To quantitatively evaluate whether the learned patterns match regular hexagon grids, in Table 1, we report the gridness scores that are adopted from the literature of grid cells (Langston et al., 2010; Sargolini et al., 2006), as well as the valid percentage of grid cells with gridness score > 0 .
Revised: [Table] Ours (LSTM) 0. To quantitatively evaluate whether the learned patterns match regular hexagon grids, in Table 1, we report the gridness scores that are adopted from the literature of grid cells (Langston et al., 2010; Sargolini et al., 2006), as well as the valid percentage of grid cells with gridness score > 0 .

Original: 37 being the criteria.
Revised: 37 being the criteria.

Original: Figure 2 shows the histogram of the spatial scales of the learned hexagon patterns.
Revised: Figure 2 shows the histogram of the spatial scales of the learned hexagon patterns.

Original: The multi-modal distribution is fitted by a mixture of three Gaussians, which are centered at 0 .
Revised: The multi-modal distribution is fitted by a mixture of three Gaussians, which are centered at 0 .

Original: 41, 0 .and 0 .
Revised: 64 and 0 .

Original: 86 respectively.
Revised: 86 respectively.

Original: The ratios between adjacent centers are 1 .
Revised: The ratios between adjacent centers are 1 .

Original: 55 and 1 . 35, which are in the range of the data from rodent grid cells (Stensola et al., 2012).[Table]
Revised: 55 and 1 . 35 , which are in the range of the data from rodent grid cells (Stensola et al., 2012).

Original: 5.2. Path integration
Revised: 5.2. Path integration

Original: We further evaluate whether the learned model is capable of accurate path integration.
Revised: We further evaluate whether the learned model is capable of accurate path integration.

Original: We perform path integration in two scenarios.
Revised: We perform path integration in two scenarios.

Original: First, for path integration with re-encoding, we decode v t → x t to physical space and then apply encoder v ( x t ) → v ′ t back to neuron space every few steps.
Revised: First, for path integration with re-encoding, we decode v t → x t to physical space and then apply encoder v ( x t ) → v ′ t back to neuron space every few steps.

Original: This re-encoding strategy helps correct the errors accumulated in the neural space along the transformation.
Revised: This re-encoding strategy helps correct the errors accumulated in the neural space along the transformation.

Original: In the case without re-encoding, we apply transformation purely using neuron vector v t .
Revised: In the case without re-encoding, we apply transformation purely using neuron vector v t .

Original: As shown in the left panel of Figure 3, the model can perform near exact path integration for 30 steps (short distance) without re-encoding.
Revised: As shown in the left panel of Figure 3, the model can perform near exact path integration for 30 steps (short distance) without re-encoding.

Original: For long-distance path integration, we train a 20-step recurrent network model, and evaluate the model for 500 steps over 1000 trajectories.
Revised: For long-distance path integration, we train a 20-step recurrent network model, and evaluate the model for 500 steps over 1000 trajectories.

Original: As shown in the right subfigure of Figure 3, if we re-encode every 20 steps, the path integration error for the last step is 0 .
Revised: As shown in the right subfigure of Figure 3, if we re-encode every 20 steps, the path integration error for the last step is 0 .

Original: 028, while the average error over the 500 steps trajectory is 0 .
Revised: 028 , while the average error over the 500 steps trajectory is 0 .

Original: Without re-encoding, the error is relatively larger, where the average error is around 0 .
Revised: Without re-encoding, the error is relatively larger, where the average error is around 0 .

Original: 03 along the whole trajectory, and 0 .
Revised: 03 along the whole trajectory, and 0 .for

Original: 08 for the last step.
Revised: the last step.

Original: To check if the model can apply precise encoding and decoding between physical space and neuron space, we also examine the fixed point condition by applying v ( x ) → v t → x ′ .
Revised: To check if the model can apply precise encoding and decoding between physical space and neuron space, we also examine the fixed point condition by applying v ( x ) → v t → x ′ .

Original: Ideally, the learned model can figure out the physical location x t purely from v t .
Revised: Ideally, the learned model can figure out the physical location x t purely from v t .

Original: The L 2 error between x and x ′ is nearly zero ( < 0 .005).
Revised: The Lerror between x and x ′ is nearly zero ( < 0 .

Original: 5.3. Model with LSTM units
Revised: 5.3. Model with LSTM units

Original: In this section, we evaluate the LSTM transformation model.
Revised: In this section, we evaluate the LSTM transformation model.

Original: The model is still trained by the same loss functions as the vanilla RNN model.
Revised: The model is still trained by the same loss functions as the vanilla RNN model.

Original: Meanwhile, we force q ( p ) > 0 in training.
Revised: Meanwhile, we force q ( p ) > 0 in training.

Original: Examples of the learned patterns are visualized in Figure 4.
Revised: Examples of the learned patterns are visualized in Figure 4.

Original: Clear hexagon patterns are also evident.
Revised: Clear hexagon patterns are also evident.

Original: Different from the learned units from the vanilla recurrent network which are all nonnegative, the learned v ( x ) from the LSTM model can be either positive or negative, resulting in the color shift of the learned patterns.
Revised: Different from the learned units from the vanilla recurrent network which are all non-negative, the learned v ( x ) from the LSTM model can be either positive or negative, resulting in the color shift of the learned patterns.

Original: As shown in Table 1, the average gridness score for the LSTM model is 0 .
Revised: As shown in Table 1, the average gridness score for the LSTM model is 0 .

Original: 73, and 68 .
Revised: 73 , and 68 .

Original: 8% of the model units are classified as grid cells.
Revised: 8% of the model units are classified as grid cells.

Original: We also evaluated the LSTM model on path integration still using 1000 trajectories and each trajectory is 500 steps long.
Revised: We also evaluated the LSTM model on path integration still using 1000 trajectories and each trajectory is 500 steps long.

Original: With re-encoding every 10 steps, the average decoding error over the whole trajectory was 0 . 027, and the error at the 500 th step still remained as low as 0 .
Revised: With re-encoding every 10 steps, the average decoding error over the whole trajectory was 0 . 027 , and the error at the 500 th step still remained as low as 0 .

Original: 6. Conclusion and discussion
Revised: 6. Conclusion and discussion

Original: This paper investigates the algebraic, geometric, and topological properties of the generic transformation model of grid cells.
Revised: This paper investigates the algebraic, geometric, and topological properties of the generic transformation model of grid cells.

Original: We focus on non-linear recurrent neural networks under the conformal isometry condition.
Revised: In particular, we focus on non-linear recurrent neural networks under the conformal isometry condition.

Original: Our numerical experiments demonstrated that hexagon periodic patterns emerged in the response maps of grid cells under the conformal isometry condition.
Revised: Our numerical experiments demonstrated that hexagon periodic patterns emerged in the response maps of grid cells under the conformal isometry condition.

Original: Our experiments also showed that the learned model was capable of accurate path integration.
Revised: Our experiments also showed that the learned model was capable of accurate path integration.

Original: The conformal isometry property seems to be related to the difference of Gaussian kernel assumed for place cells in Dordek et al.
Revised: The conformal isometry property seems to be related to the difference of Gaussian kernel assumed for place cells in Dordek et al.

Original: ; Sorscher et al.
Revised: ; Sorscher et al.

Original: (2019), which constrains the frequency components within a ring in the frequency domain.
Revised: (2019), which constrains the frequency components within a ring in the frequency domain.

Original: It remains to be determined whether the hexagon patterns of grid cells were caused by the recurrent network itself or by interaction with place cells, an important issue that should be investigated further.
Revised: It remains to be determined whether the hexagon patterns of grid cells were caused by the recurrent network itself or by interaction with place cells, an important issue that should be investigated further.

Original: A limitation of our work is that we did not pursue specially designed recurrent neural networks where conformal isometry is automatically satisfied.
Revised: A limitation of our work is the lack of specially designed recurrent neural networks where conformal isometry is automatically satisfied.

Original: We leave it to future investigation.
Revised: We leave it to future investigation.

Original: In the Appendix C, we provide a discussion of a possible design inspired by the hand-crafted continuous attractor neural networks of grid cells where conformal isometry is satisfied.
Revised: In the Appendix C, we provide a discussion of a possible design inspired by the hand-crafted continuous attractor neural networks of grid cells where conformal isometry is satisfied.

Original: Acknowledgments
Revised: Acknowledgments

Original: The work was supported by NSF DMS-2015577 and XSEDE grant ASC170063.
Revised: The work was supported by NSF DMS-2015577 and XSEDE grant ASC170063.

Original: We thank the reviewers for their valuable comments and suggestions.
Revised: We thank the reviewers for their valuable comments and suggestions

Original: Appendix A. More experimental details A.1. Training details
Revised: Appendix A. More experimental details A.1. Training details

Original: We train the model for 200 , 000 iterations and learn the model by minimizing L 1 + λ L 2 , where λ = 0 .
Revised: We train the model for 200 , 000 iterations and learn the model by minimizing L 1 + λL 2 , where λ = 0 .

Original: For the extra zero-step version of L 1 , the weight is set as 10.
Revised: For the extra zero-step version of L 1 , the weight is set as 10 .

Original: The regularization of ∥ q ( p ) ∥ 2 is added to the loss in the first 10 , 000 iterations, where we linearly decay the weight of the regularization from 0 .
Revised: The regularization of ∥ q ( p ) ∥ 2 is added to the loss in the first 10 , 000 iterations, where we linearly decay the weight of the regularization from 0 .

Original: 1 to 0.
Revised: 1 to 0 .

Original: During training, the normalization of ∥ v ( x ) ∥ is done for every position x at the end of each epoch.
Revised: During training, the normalization of ∥ v ( x ) ∥ is done for every position x at the end of each epoch.

Original: For each module, we normalize the value of ∥ v ( x ) ∥ to be 1 / √ m , where m is the number of modules.
Revised: For each module, we normalize the value of ∥ v ( x ) ∥ to be 1 / √ m , where m is the number of modules.

Original: For isometry loss ( L 2 ), we fix the upper bounds of displacements as 15 grids for all modules for the first 10 , 000 iterations, and start to adaptively adjust the upper bounds afterwards every 2000 iterations.
Revised: For isometry loss ( L 2 ), we fix the upper bounds of displacements as 15 grids for all modules for the first 10 ,iterations, and start to adaptively adjust the upper bounds afterwards every 2000 iterations.

Original: All the learned parameters are updated by Adam (Kingma and Ba, 2014) optimizer.
Revised: All the learned parameters are updated by Adam (Kingma and Ba, 2014) optimizer.

Original: The learning rate is linearly decayed from 0 .
Revised: The learning rate is linearly decayed from 0 .

Original: 006 to 0 .
Revised: 006 to 0 .

Original: 0003 for the first 10 , 000 iterations, fixed at 0 .
Revised: 0003 for the first 10 , 000 iterations, fixed at 0 .

Original: until 120 , 000 iterations, and then linearly decayed to 0 afterwards.
Revised: until 120 , 000 iterations, and then linearly decayed to 0 afterwards.

Original: For batch sizes, we use 8000 for zero-step transformation loss and isometry loss ( L 1 ), and 100 for multi-step transformation loss.
Revised: For batch sizes, we use 8000 for zero-step transformation loss and isometry loss ( L 1 ), and 100 for multi-step transformation loss.

Original: We trained all the models on a single 2080 Ti GPU.
Revised: We trained all the models on a single 2080 Ti GPU.

Original: A.2. Learned patterns
Revised: A.2. Learned patterns

Original: In Figure 5, we show the autocorrelograms of the learned grid patterns from the vanilla recurrent network.
Revised: In Figure 5, we show the autocorrelograms of the learned grid patterns from the vanilla recurrent network.

Original: A.3. Ablation studies
Revised: A.3. Ablation studies

Original: In this section, we present part of our ablation results to examine whether certain components of our model are empirically important for the emergence of hexagon grid patterns.
Revised: In this section, we present part of our ablation results to examine whether certain components of our model are empirically important for the emergence of hexagon grid patterns.

Original: Here are some key observations: (1) hexagon patterns do not emerge without conformal isometry loss.
Revised: Here are some key observations: (1) hexagon patterns do not emerge without conformal isometry loss.

Original: That is, the conformal isometry condition is crucial for the emergence of grid-like patterns.
Revised: That is, the conformal isometry condition is crucial for the emergence of grid-like patterns.

Original:  Regularization of ∥ q ( p ) ∥ 2 is not necessary, but the patterns are less clear without it.
Revised: (2) Regularization of ∥ q ( p ) ∥ 2 is not necessary, but the patterns are less clear without it.

Original:  Without zero-step transformation loss, the learned model is unable to path integrate accurately, although hexagon grid patterns still emerge.
Revised: (3) Without zero-step transformation loss, the learned model is unable to path integrate accurately, although hexagon grid patterns still emerge.

Original: We further try different module sizes.
Revised: We further try different module sizes.

Original: Figure 8 visualizes the learned patterns when we fix the total number of grid cells and change the module size to 24.
Revised: Figure 8 visualizes the learned patterns when we fix the total number of grid cells and change the module size to 24 .

Original: It shows hexagonal grid firing patterns can emerge with a larger module size.
Revised: It shows hexagonal grid firing patterns can emerge with a larger module size.

Original: In Figure 9, we show the path integration error based on different lengths (5-step, 10-step, 15-step, and 30-step) of RNN models.
Revised: In Figure 9, we show the path integration error based on different lengths (5-step, 10-step, 15-step, and 30-step) of recurrent neural network models.

Original: Path integration for 30-step trajectories is performed for settings with and without re-encoding.
Revised: Path integration for 30-step trajectories is performed for settings with and without re-encoding.

Original: Finally, we try to remove the block-diagonal assumption in the transformation model, i.e. we change W to be a full matrix instead of a block-diagonal one.
Revised: Finally, we try to remove the block-diagonal assumption in the transformation model, i.e. we change W to be a full matrix instead of a block-diagonal one.

Original: But we still impose conformal isometry on the modules.
Revised: But we still impose conformal isometry on the modules.

Original: In this setting, we can still learn multi-scale patterns as in Figure 7, while the path integration also works well.
Revised: In this setting, we can still learn multi-scale patterns as in Figure 7, while the path integration also works well.

Original: For a learned 10-step vanilla RNN without block-diagonal construction, the average error of 500 step path integration is around 0.02 with re-encoding everysteps and 0.046 without re-encoding over the whole trajectory.
Revised: For a learned 10-step vanilla RNN without block-diagonal construction, the average error of 500 step path integration is around 0.02 with re-encoding every 10 steps and 0.046 without re-encoding over the whole trajectory.

Original: This suggests that the emergence of the hexagon patterns is not from block-diagonal construction but the isometry condition.
Revised: This suggests that the emergence of the hexagon patterns is not from block-diagonal construction but the isometry condition.

Original: [Figure]
Revised: [Figure]

Original: Appendix B. Eigen analysis
Revised: Appendix B. Eigen analysis

Original: Proof With ∆ x = 0, we have the following fixed point property:
Revised: Proof With ∆ x = 0 , we have the following fixed point property:

Original: [Equation]
Revised: [Equation]

Original: Thus
Revised: Thus

Original: [Equation]
Revised: [Equation]

Original: Thus for any x , the matrix 1 ( W v ( x ) > 0 ) ⊙ W has an eigenvalue 1 with geometric multiplicity 2.
Revised: Thus for any x , the matrix 1 ( W v ( x ) > 0 ) ⊙ W has an eigenvalue 1 with geometric multiplicity 2.

Original: Meanwhile,
Revised: Meanwhile,

Original: [Equation]
Revised: [Equation]

Original: Under conformal isometry, the two column vectors of 1 ( W v ( x ) > 0 ) ⊙ U are orthogonal with equal norm, and they span the eigen-subspace of 1 ( W v ( x ) > 0 ) ⊙ W .
Revised: Under conformal isometry, the two column vectors of 1 ( W v ( x ) > 0 ) ⊙ U are orthogonal with equal norm, and they span the eigen-subspace of 1 ( W v ( x ) > 0 ) ⊙ W .

Original: Appendix C. Constructive conformal isometry
Revised: Appendix C. Constructive conformal isometry

Original: In our experiment, we impose conformal isomtry with a loss term based on Equation (4).
Revised: In our experiment, we impose conformal isomtry with a loss term based on Equation (4).

Original: In this section, we discuss a special case of the recurrent network that satisfies Condition 2 by design.
Revised: In this section, we discuss a special case of the recurrent network that satisfies Condition 2 by design.

Original: Specifically, we divide v into low-dimensional sub-vectors, v = ( v k , k = 1 ,..., K ) , where each v k is a sub-vector of dimension d , e.g., d = 4 so that each sub-vector consists of4 neurons.
Revised: Specifically, we divide v into low-dimensional sub-vectors, v = ( v k , k = 1 , ..., K ) , where each v k is a sub-vector of dimension d , e.g., d = 4 so that each sub-vector consists of neurons.

Original: We call each sub-vector a mini-block.
Revised: We call each sub-vector a mini-block.

Original: Then the total dimension D =
Revised: Then the total dimension D =

Original: Kd .
Revised: Kd .

Original: Such mini-blocks are commonly assumed in handcrafted continuous attractor neural networks (Burak and Fiete, 2009; Couey et al., 2013; Pastoll et al., 2013; Agmon and Burak, 2020).
Revised: Such mini-blocks are commonly assumed in handcrafted continuous attractor neural networks (Burak and Fiete, 2009; Couey et al., 2013; Pastoll et al., 2013; Agmon and Burak, 2020).

Original: Correspondingly, we divide the D × 2 matrix U into K mini-blocks, with each being d × 2, so that U =
Revised: Correspondingly, we divide the D × 2 matrix U into K mini-blocks, with each being d × 2 , so that U =

Original: ( U k , k = 1 ,..., K ) .
Revised: ( U k , k = 1 , ..., K ) .

Original: The indicator vector 1 ( W v ( x ) > 0 ) is also divided into K mini-blocks, each of dimension d .
Revised: The indicator vector 1 ( W v ( x ) > 0 ) is also divided into K mini-blocks, each of dimension d .

Original: We assume the following two conditions for the mini-blocks:
Revised: We assume the following two conditions for the mini-blocks:

Original: Condition 3.
Revised: Condition 3.

Original: (Orthogonality condition).
Revised: (Orthogonality condition).

Original: Each U k has two column vectors that are of equal norm s k and are orthogonal to each other, i.e., U ⊤ k U k
Revised: Each U k has two column vectors that are of equal norm s k and are orthogonal to each other, i.e., U ⊤ k U k

Original: = s 2 k
Revised: = s 2 k

Original: I 2 .
Revised: I 2 .

Original: The above condition can be easily satisfied, e.g., for d = 4, we let the first column ofU k be [ 1 , 0 , − 1 , 0 ]
Revised: The above condition can be easily satisfied, e.g., for d = 4 , we let the first column of

Original:  ⊤ and the second column be [ 0 , 1 , 0 , − 1 ] ⊤ .
Revised: U k be [1 , 0 , − 1 , 0] ⊤ and the second column be [0 , 1 , 0 , − 1] ⊤ .

Original: The idea is that within each mini-block, the cells are sensitive to different directions of self-motion.
Revised: The idea is that within each mini-block, the cells are sensitive to different directions of self-motion.

Original: Condition 4.
Revised: Condition 4.

Original: (Synchronicity condition).
Revised: (Synchronicity condition).

Original: Each mini-block of 1 ( W v ( x ) > 0 ) is synchronized, i.e., all its elements are either all 0 or all 1.
Revised: Each mini-block of 1 ( W v ( x ) > 0 ) is synchronized, i.e., all its elements are either all 0 or all 1.

Original: For mini-block k, define a k = 1 if all the elements of 1 ( W v ( x ) > 0 ) are 1, and a k = 0 if all the elements of 1 ( W v ( x ) > 0 ) are 0.
Revised: For mini-block k , define a k = 1 if all the elements of 1 ( W v ( x ) > 0 ) are 1, and a k = 0 if all the elements of 1 ( W v ( x ) > 0 ) are 0.

Original: We call the mini-blocks that satisfy the above two conditions the conformal mini-blocks.
Revised: We call the mini-blocks that satisfy the above two conditions the conformal mini-blocks.

Original: Given those two conditions, we have the following result.
Revised: Given those two conditions, we have the following result.

Original: Theorem 2.
Revised: Theorem 2.

Original: Under the orthogonality condition and the synchronicity condition, the mini-block-wise recurrent network satisfies the conformal isometry condition (Condition 2).
Revised: Under the orthogonality condition and the synchronicity condition, the miniblock-wise recurrent network satisfies the conformal isometry condition (Condition 2).

Original: Proof The change of the vector
Revised: Proof The change of the vector

Original: [Equation]
Revised: [Equation]

Original: Thus
Revised: Thus

Original: [Equation]
Revised: [Equation]

Original: where s 2 = 
Revised: where s 2 = (cid:80)

Original: ∑ k a k s 2 k .
Revised: k a k s 2 k .

Original: Define the activation pattern of 1 ( W v ( x ) > 0 ) be a ( x ) =
Revised: Define the activation pattern of 1 ( W v ( x ) > 0 ) be a ( x ) =

Original: ( a k , k = 1 ,..., K ) .
Revised: ( a k , k = 1 , ..., K ) .

Original: a ( x ) controls the change of the vector v ( x + δ x ) − v ( x ) .
Revised: a ( x ) controls the change of the vector v ( x + δ x ) − v ( x ) .

Original: At different x , a ( x ) are different.
Revised: At different x , a ( x ) are different.

Original: Thus the direction of the change v ( x + δ x ) − v ( x ) depends on x , and it is possible for the model to create rotation of the vector v ( x ) .
Revised: Thus the direction of the change v ( x + δ x ) − v ( x ) depends on x , and it is possible for the model to create rotation of the vector v ( x ) .

Original: It is an interesting problem to construct simple recurrent networks that satisfy conformal isometry automatically.
Revised: It is an interesting problem to construct simple recurrent networks that satisfy conformal isometry automatically.