整合信息论(Integrated Information Theory,IIT)是一个理论框架,它提供了一个定量的度量来估计一个物理系统何时是有意识的,它的意识程度,以及系统正在经历的感受质空间的复杂性。形式上,IIT基于这样的假设:如果一个替代的物理系统可以完全嵌入意识的现象学属性,那么系统属性必须受到所体验的感受质属性的约束。根据这个假设,IIT将物理系统表示为互连元素的网络,可以将其视为概率因果图$\mathcal{G}$,其中每个节点具有输入输出函数,并且所有图都编码在转移概率矩阵中。因此,IIT的意识,$Φ$的定量测量,计算相对于转移概率矩阵和当前状态的图形。在本文中,我们提供了一个随机搜索算法,能够优化$Φ$,以调查,随着节点数量的增加,具有较高的$Φ$的图形的结构。我们还提供了参数,显示了应用更复杂的黑盒搜索算法,如贝叶斯优化或元分析,在这个特定的问题的困难。此外,我们建议这些技术的具体研究线,以提高搜索算法,保证最大的$Φ$。
英文摘要:
Integrated information theory (IIT) is a theoretical framework that provides a quantitative measure to estimate when a physical system is conscious, its degree of consciousness, and the complexity of the qualia space that the system is experiencing. Formally, IIT rests on the assumption that if a surrogate physical system can fully embed the phenomenological properties of consciousness, then the system properties must be constrained by the properties of the qualia being experienced. Following this assumption, IIT represents the physical system as a network of interconnected elements that can be thought of as a probabilistic causal graph, $\mathcal{G}$, where each node has an input-output function and all the graph is encoded in a transition probability matrix. Consequently, IIT's quantitative measure of consciousness, $Φ$, is computed with respect to the transition probability matrix and the present state of the graph. In this paper, we provide a random search algorithm that is able to optimize $Φ$ in order to investigate, as the number of nodes increases, the structure of the graphs that have higher $Φ$. We also provide arguments that show the difficulties of applying more complex black-box search algorithms, such as Bayesian optimization or metaheuristics, in this particular problem. Additionally, we suggest specific research lines for these techniques to enhance the search algorithm that guarantees maximal $Φ$.
Tri-institutional Center for Translational Research in Neuroimaging and Data Science (TReNDS)(三机构神经影像与数据科学转化研究中心(TReNDS));Georgia State University(佐治亚州立大学);Georgia Institute of Technology(佐治亚理工学院);Emory University(埃默里大学)
Guided by Trajectories: Repairing and Rewarding Tool-Use Trajectories for Tool-Integrated Reasoning
School of Computer Science and Engineering, Southeast University, Nanjing, China(东南大学计算机科学与工程学院);Key Lab. of Computer Network and Information Integration (Southeast University), MOE, China(计算机网络与信息集成重点实验室(东南大学));State Key Laboratory of Cognitive Intelligence, University of Science and Technology of China, Hefei, China(认知智能国家重点实验室(中国科学技术大学))
Multi-task multi-constraint differential evolution with elite-guided knowledge transfer for coal mine integrated energy system dispatching
School of Information and Control Engineering, China University of Mining and Technology(中国矿业大学信息与控制工程学院);School of Artificial Intelligence and Computer Science, Jiangnan University(江南大学人工智能与计算机学院);School of Information Science and Technology, Qingdao University of Science and Technology(青岛科技大学信息科学与技术学院)
Optimizing LLM Inference: Fluid-Guided Online Scheduling with Memory Constraints
Institute for Data, Systems, and Society, Massachusetts Institute of Technology(数据、系统与社会研究所,麻省理工学院);School of Mathematical Sciences, Peking University(北京大学数学科学学院);Alibaba Group(阿里巴巴集团)
ChipSeek: Optimizing Verilog Generation via EDA-Integrated Reinforcement Learning
SKLP, Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所智能计算机研究中心);University of Chinese Academy of Sciences(中国科学院大学);University of Electronic Science and Technology of China(电子科技大学);Beijing Institute of Technology(北京理工大学)