有限的积分时间可以将最优灵敏度从临界点移开
Finite integration time can shift optimal sensitivity away from criticality
AI总结:
该研究探讨了有限积分时间如何影响循环神经网络的最优灵敏度,发现其可从临界点移开,强调了有限时间因素在信息处理研究中的重要性。
摘要:
对环境微小变化的敏感性对于许多实际任务至关重要,使生物和人工系统能够做出正确的行为决策。已证明当系统处于相变临界点附近时,这种敏感性达到最大值。然而,接近临界点会引入大的波动和发散的时间尺度。因此,为了利用最大灵敏度,需要不切实际的长积分时间。在这里,我们通过分析和计算证明了在给定有限积分时间下,循环神经网络的最优调优是如何确定的。与最大化理论上可获得的灵敏度不同,我们发现网络根据可用时间获得不同的灵敏度。因此,当积分时间有限时,最优动态制度可以远离临界点,突显了在信息处理研究中纳入有限时间考虑的必要性。
英文摘要:
Sensitivity to small changes in the environment is crucial for many real-world tasks, enabling living and artificial systems to make correct behavioral decisions. It has been shown that such sensitivity is maximized when a system operates near the critical point of a phase transition. However, proximity to criticality introduces large fluctuations and diverging timescales. Hence, to leverage the maximal sensitivity, it would require impractically long integration periods. Here, we analytically and computationally demonstrate how the optimal tuning of a recurrent neural network is determined given a finite integration time. Rather than maximizing the theoretically available sensitivity, we find networks attain different sensitivities depending on the available time. Consequently, the optimal dynamic regime can shift away from criticality when integration times are finite, highlighting the necessity of incorporating finite-time considerations into studies of information processing.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。