atlas

Research map / Probabilistic and scientific modeling / Molecules and proteins

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

NeurIPS 2025 · Probabilistic and scientific modeling › Molecules and proteins · approach: Neuro-symbolic probabilistic layers · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Models place cell populations as non-negative spectral embeddings of multi-step random walk transition kernels, whose inner products reproduce normalized transition probabilities, and uses them for gradient-based path planning across scales.

Problem

Explaining hippocampal place cell population coding (localized fields, multi-scale organization, cognitive maps) and using it for trap-free spatial navigation and path planning in 2D environments with obstacles.

Approach

Learn non-negative position embeddings h(x,tau) whose inner products match normalized multi-step random walk transition kernels q(y|x,tau), with time scale tau setting spatial scale; non-negativity plus orthogonality yields sparse localized fields, and navigation is gradient ascent on q with adaptive scale selection.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use adaptive-scale transition-kernel gradient path planning instead of Bug (without oracle)Path planning · Four-roomSuccess: 14% -> 100%Helped
Use adaptive-scale transition-kernel gradient path planning instead of Bug (without oracle)Path planning · Four-roomSPL: 0.15\pm 0.00 -> 1.00Helped
Use adaptive-scale transition-kernel gradient path planning instead of Bug (with oracle)Path planning · Four-roomSPL: 0.66\pm 0.51 -> 1.00Helped
Use adaptive-scale transition-kernel gradient path planning instead of A* SearchPath planning · Four-roomSPL: 1.08\pm 0.50 -> 1.00Hurt
Use adaptive-scale transition-kernel gradient path planning instead of Random WalkPath planning · Four-roomSuccess: 2% -> 100%Helped
Use adaptive-scale transition-kernel gradient path planning instead of Random WalkPath planning · Four-roomSPL: 0.01\pm 0.00 -> 1.00Helped

Surprising findings

Limitations

Experimental setup

Datasets: simulated 40x40 lattice open field U-shaped, S-shaped, and four-room mazes

Benchmarks: open field U-shape maze S-shape maze four-room maze

Metrics: success rate SPL correlation of inner products with transition kernel

Baselines: Bug algorithm Bug algorithm with oracle A* search Random walk

Builds on: successor representation Horn's theorem AdamW

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy