Place Cells as Multi-Scale Position Embeddings: Random Walk Transition Kernels for Path Planning

• URL: http://arxiv.org/abs/2505.14806v4
• Date: Fri, 24 Oct 2025 22:28:02 GMT
• Title: Place Cells as Multi-Scale Position Embeddings: Random Walk Transition Kernels for Path Planning
• Authors: Minglu Zhao, Dehong Xu, Deqian Kong, Wen-Hao Zhang, Ying Nian Wu,
• Abstract summary: hippocampus supports spatial navigation by encoding cognitive maps through collective place cell activity.<n>In this framework, inner product or equivalently Euclidean distance between embeddings encode similarity between locations in terms of their transition probability across multiple scales.<n>The combination of non-negativity and inner-product structure naturally induces sparsity, providing a principled explanation for the localized firing fields of place cells.
• Score: 43.129849610367465
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The hippocampus supports spatial navigation by encoding cognitive maps through collective place cell activity. We model the place cell population as non-negative spatial embeddings derived from the spectral decomposition of multi-step random walk transition kernels. In this framework, inner product or equivalently Euclidean distance between embeddings encode similarity between locations in terms of their transition probability across multiple scales, forming a cognitive map of adjacency. The combination of non-negativity and inner-product structure naturally induces sparsity, providing a principled explanation for the localized firing fields of place cells without imposing explicit constraints. The temporal parameter that defines the diffusion scale also determines field size, aligning with the hippocampal dorsoventral hierarchy. Our approach constructs global representations efficiently through recursive composition of local transitions, enabling smooth, trap-free navigation and preplay-like trajectory generation. Moreover, theta phase arises intrinsically as the angular relation between embeddings, linking spatial and temporal coding within a single representational geometry.

Related papers

• GFLAN: Generative Functional Layouts [1.1458853556386797]
  GFLAN is a generative framework that restructures floor plan synthesis through explicit factorization into topological planning and geometric realization.<n>Our approach departs from direct pixel-to-pixel or wall-tracing generation in favor of a principled two-stage decomposition.
  arXiv  Detail & Related papers  (2025-12-18T07:52:47Z)
• Modeling Microenvironment Trajectories on Spatial Transcriptomics with NicheFlow [80.00833033784079]
  Understanding of cellular microenvironment is essential for deciphering tissue development and disease data.<n>NicheFlow is a flow-based generative model that infers the temporal trajectory of cellular microenvironments across spatial slides.
  arXiv  Detail & Related papers  (2025-11-02T15:41:38Z)
• Functional embeddings enable Aggregation of multi-area SEEG recordings over subjects and sessions [0.11083289076967894]
  We propose a representation-learning framework that learns a subject-agnostic functional identity for each electrode from multi-region local field potentials.<n>We evaluate this framework on a 20-subject dataset spanning basal ganglia-thalamic regions collected during flexible rest/movement recording sessions.
  arXiv  Detail & Related papers  (2025-10-31T01:23:05Z)
• Egocentric Visual Navigation through Hippocampal Sequences [0.0]
  We show that hippocampal sequences arise from intrinsic recurrent circuitry that propagates activity without readily available input.<n>We implement a minimal sequence generator inspired by neurobiology and pair it with an actor-critic learner for egocentric visual navigation.
  arXiv  Detail & Related papers  (2025-10-11T01:38:23Z)
• Spline Deformation Field [21.755382164519776]
  inductive biases can hinder canonical spatial coherence in ill-posed scenarios.<n>We introduce a novel low-rank spatial encoding, replacing conventional coupled techniques.<n>It achieves competitive dynamic reconstruction quality compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-07-10T08:11:46Z)
• Multi-Timescale Gradient Sliding for Distributed Optimization [23.311605203774388]
  We propose two first-order methods for convex, non-smooth, distributed optimization problems.<n>Our MT-GS and AMT-GS can take advantage of similarities between (local) objectives to reduce the communication rounds.<n>These three desirable features are achieved through a block-decomposable primal-dual formulation.
  arXiv  Detail & Related papers  (2025-06-18T12:03:34Z)
• GMapLatent: Geometric Mapping in Latent Space [51.317738404571514]
  Cross-domain generative models based on encoder-decoder AI architectures have attracted much attention in generating realistic images.<n>We introduce a canonical latent space representation based on geometric mapping to align the cross-domain latent spaces in a rigorous and precise manner.<n>Experiments on gray-scale and color images validate the efficiency, efficacy and applicability of GMapLatent.
  arXiv  Detail & Related papers  (2025-03-30T12:02:36Z)
• HierRelTriple: Guiding Indoor Layout Generation with Hierarchical Relationship Triplet Losses [52.70183252341687]
  We present a hierarchical triplet-based indoor relationship learning method, coined HierRelTriple, with a focus on spatial relationship learning.<n>We introduce HierRelTriple, a hierarchical relational triplets modeling framework that first partitions functional regions and then automatically extracts three levels of spatial relationships.<n>Experiments on unconditional layout synthesis, floorplan-conditioned layout generation, and scene rearrangement demonstrate that HierRel improves spatial-relation metrics by over 15%.
  arXiv  Detail & Related papers  (2025-03-26T07:31:52Z)
• Displacement-Sparse Neural Optimal Transport [6.968698312185846]
  Optimal transport (OT) aims to find a map $T$ that transports mass from one probability measure to another while minimizing a cost function.<n>Neural OT solvers have gained popularity in high dimensional biological applications such as drug perturbation.<n>We propose an intuitive and theoretically grounded approach to learning emphdisplacement-sparse maps within neural OT solvers.
  arXiv  Detail & Related papers  (2025-02-03T23:44:17Z)
• Demystifying Linear MDPs and Novel Dynamics Aggregation Framework [8.087699764574788]
  In linear MDPs, the feature dimension $d$ is lower bounded by $S/U$ in order to aptly represent transition probabilities. We propose a novel structural aggregation framework based on dynamics, named as the "dynamics aggregation" Our proposed algorithm exhibits statistical efficiency, achieving a regret of $ tildeO ( d_psi3/2 H3/2sqrt T)$, where $d_psi$ represents the feature dimension of aggregated subMDPs.
  arXiv  Detail & Related papers  (2024-10-31T16:21:41Z)
• Adaptive $k$-nearest neighbor classifier based on the local estimation of the shape operator [49.87315310656657]
  We introduce a new adaptive $k$-nearest neighbours ($kK$-NN) algorithm that explores the local curvature at a sample to adaptively defining the neighborhood size. Results on many real-world datasets indicate that the new $kK$-NN algorithm yields superior balanced accuracy compared to the established $k$-NN method.
  arXiv  Detail & Related papers  (2024-09-08T13:08:45Z)
• Projection by Convolution: Optimal Sample Complexity for Reinforcement Learning in Continuous-Space MDPs [56.237917407785545]
  We consider the problem of learning an $varepsilon$-optimal policy in a general class of continuous-space Markov decision processes (MDPs) having smooth Bellman operators. Key to our solution is a novel projection technique based on ideas from harmonic analysis. Our result bridges the gap between two popular but conflicting perspectives on continuous-space MDPs.
  arXiv  Detail & Related papers  (2024-05-10T09:58:47Z)
• Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition [71.33787410075577]
  We study reinforcement learning with linear function approximation, unknown transition, and adversarial losses. We propose a new algorithm that attains an $widetildeO(dsqrtHS3K + sqrtHSAK)$ regret with high probability.
  arXiv  Detail & Related papers  (2024-03-07T15:03:50Z)
• Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path [80.60592344361073]
  We study the Shortest Path (SSP) problem with a linear mixture transition kernel. An agent repeatedly interacts with a environment and seeks to reach certain goal state while minimizing the cumulative cost. Existing works often assume a strictly positive lower bound of the iteration cost function or an upper bound of the expected length for the optimal policy.
  arXiv  Detail & Related papers  (2024-02-14T07:52:00Z)
• On Learning Gaussian Multi-index Models with Gradient Flow [57.170617397894404]
  We study gradient flow on the multi-index regression problem for high-dimensional Gaussian data. We consider a two-timescale algorithm, whereby the low-dimensional link function is learnt with a non-parametric model infinitely faster than the subspace parametrizing the low-rank projection.
  arXiv  Detail & Related papers  (2023-10-30T17:55:28Z)
• Learning optimal integration of spatial and temporal information in noisy chemotaxis [0.0]
  We investigate the boundary between chemotaxis driven by spatial estimation of gradients and chemotaxis driven by temporal estimation. We parameterize a combined chemotactic policy by a recurrent neural network and evaluate it using a minimal theoretical model of a chemotactic cell. We find that the transition between the regimes is continuous, with the combined strategy outperforming in the transition region.
  arXiv  Detail & Related papers  (2023-10-16T15:50:23Z)
• Monge, Bregman and Occam: Interpretable Optimal Transport in High-Dimensions with Feature-Sparse Maps [37.45959537338404]
  We show that choosing a sparsity-inducing norm for $tau$ results in maps that apply Occam's razor to transport. We showcase the ability of our method to estimate meaningful maps for high-dimensional single-cell transcription data.
  arXiv  Detail & Related papers  (2023-02-08T14:02:34Z)
• DADAO: Decoupled Accelerated Decentralized Asynchronous Optimization [0.0]
  DADAO is the first decentralized, accelerated, asynchronous, primal, first-order algorithm to minimize a sum of $L$-smooth and $mu$-strongly convex functions distributed over a given network of size $n$. We show that our algorithm requires $mathcalO(nsqrtchisqrtfracLmulog(frac1epsilon)$ local and only $mathcalO(nsqrtchisqrtfracLmulog(
  arXiv  Detail & Related papers  (2022-07-26T08:47:54Z)
• Supervised Training of Conditional Monge Maps [107.78770597815242]
  Optimal transport (OT) theory describes general principles to define and select, among many possible choices, the most efficient way to map a probability measure onto another. We introduce CondOT, a multi-task approach to estimate a family of OT maps conditioned on a context variable. We demonstrate the ability of CondOT to infer the effect of an arbitrary combination of genetic or therapeutic perturbations on single cells.
  arXiv  Detail & Related papers  (2022-06-28T19:34:44Z)
• Optimal Gradient Sliding and its Application to Distributed Optimization Under Similarity [121.83085611327654]
  We structured convex optimization problems with additive objective $r:=p + q$, where $r$ is $mu$-strong convex similarity. We proposed a method to solve problems master to agents' communication and local calls. The proposed method is much sharper than the $mathcalO(sqrtL_q/mu)$ method.
  arXiv  Detail & Related papers  (2022-05-30T14:28:02Z)
• Fast and Scalable Optimal Transport for Brain Tractograms [4.610968512889579]
  We present a new multiscale algorithm for solving regularized Optimal Transport problems on a linear memory footprint. We show the effectiveness of this approach on brain tractograms modeled either as bundles of fibers or as track density maps.
  arXiv  Detail & Related papers  (2021-07-05T13:28:41Z)
• Continuous and time-discrete non-Markovian system-reservoir interactions: Dissipative coherent quantum feedback in Liouville space [62.997667081978825]
  We investigate a quantum system simultaneously exposed to two structured reservoirs. We employ a numerically exact quasi-2D tensor network combining both diagonal and off-diagonal system-reservoir interactions with a twofold memory for continuous and discrete retardation effects. As a possible example, we study the non-Markovian interplay between discrete photonic feedback and structured acoustic phononovian modes, resulting in emerging inter-reservoir correlations and long-living population trapping within an initially-excited two-level system.
  arXiv  Detail & Related papers  (2020-11-10T12:38:35Z)
• Nearly Minimax Optimal Reward-free Reinforcement Learning [88.75843804630772]
  We study the reward-free reinforcement learning framework, which is particularly suitable for batch reinforcement learning and scenarios where one needs policies for multiple reward functions. We give a new efficient algorithm, textbfStaged textbfSampling + textbfTruncated textbfPlanning (algoname), which interacts with the environment at most $Oleft( fracS2Aepsilon2textpolylogleft(fracSAHepsilon2
  arXiv  Detail & Related papers  (2020-10-12T17:51:19Z)
• Deep Learning Meets Projective Clustering [66.726500395069]
  A common approach for compressing NLP networks is to encode the embedding layer as a matrix $AinmathbbRntimes d$. Inspired by emphprojective clustering from computational geometry, we suggest replacing this subspace by a set of $k$ subspaces.
  arXiv  Detail & Related papers  (2020-10-08T22:47:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.