跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1111新增论文
+874其中 AI 相关
+133已有论文修订
+97新增 AI 导读

arXiv 最近完成扫描:2026-11-20 08:48 · 全站最近入库:2026-11-19 19:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-19 10:37 — 2026-11-20 10:37(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-20 08:48最近发现新增版本:2026-11-19 19:09库内论文最新更新时间:2026-11-19 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

27,982 已收录论文23,249 AI 相关8,559 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 08:46(北京时间)
版本更新 · v2arXiv:2609.13219

Planning as Dynamics Relaxation: Hippocampal Recurrent Network Realizes Optimal Goal-Directed Navigation

Yuhang He, Junfeng Zuo, Tianhao Chu, Si Wu

原文摘要

Neural correlates of the cognitive map are well documented, yet how a neural circuit turns a stored map into an obstacle-avoiding route remains unclear. Here we show that a hippocampal network with appropriate recurrent connections achieves optimal goal-directed navigation through its own relaxation dynamics. The recurrent weights represent the transition probabilities between the locations the neurons encode, walls are reflected by vanishing weights, and behavioral-timescale synaptic plasticity (BTSP) writes this connectivity during goal-free exploration. When a goal is recalled, a top-down current clamps the goal neuron and the population relaxes into a goal-locked activity field. We prove that this field is the desirability field of a linearly-solvable Markov decision process: the relaxed state is the exact optimum of a stated control problem, the KL-regularized objective of Todorov, and the optimal next-step distribution is carried by the branch synaptic currents. The identity extends to directed transitions, and a weak-cost limit returns the Green's function of the recurrent Laplacian. A place-tuned readout converts the field's log-gradient into a direction of travel, and the same synapses answer a predictive query when the source is placed at the current location. Simulations on mazes with complex obstacles show near-shortest routes, an identity that survives a thousand-fold range of recall amplitude, the loss of 80% of place cells, and tens of thousands of states, low-rank updates of every plan after a local change, and a transient that is anytime: the local action is ready long before the field converges. We hope this offers a general circuit principle for planning in abstract cognitive maps beyond spatial navigation.

q-bio.NC · cs.AI

版本更新 · v2arXiv:2611.06932

Oscillatory Phase Coding Emerges in Adaptive RNNs for Flexible Working Memory

Kehan Lu, Tianhao Chu, Aiersi Tuerhong, Yiwen Sun, Huan Luo, Fang Fang, Si Wu

原文摘要

Oscillatory phase coding (OPC) is widely observed in neural systems and has been implicated in cognitive functions such as memory and sequence processing. However, its computational role and neural substrates remain largely unclear. Here, we studied OPC by training recurrent neural networks (RNNs) with adaptation to perform sequence working memory tasks with variable delays. After training, we found that OPC emerges in the RNN spontaneously: the memorized items recur at distinct phases of a shared rhythm, with oscillation amplitude encoding item identity and phase encoding serial order. Ablation studies identified three key elements required for OPC: adaptation in neural dynamics, variable delay in memory retention, and flexibility in reading out information. Neuron-type analysis revealed the emergence of content and time cells in the trained RNN, and they process item identity and sequence order separately. Recurrent connectivity analysis revealed phase-organized connections among time cells and structured connections within digit-selective content-cell groups. Inspired by these findings, we proposed a neural circuit model which reproduces OPC through interactions between content units and an adaptive time ring. Together, this study reveals how OPC arises from network structures and task demands, offers insights into the implementation and computational mechanisms of OPC in biological systems, and inspires us to develop computational models for human-like cognitive functions.

q-bio.NC · cs.AI