arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2610.16102cs.NEcs.AI
收藏

当波兰尼遇上伽罗瓦:默会知识作为代数-确定性运算,旨在重新确立AI生成科学的根基

Where Polanyi Meets Galois: Tacit Knowing as an Algebro-Deterministic Operation, Toward Re-rooting AI-Generated Science

Hitotsubashi University(一桥大学);Meisei University(明海大学);Shuhari System(守破离系统)

Hiroyuki Chuma, Kanji Otsuka, Yoichi Sato, Kodo Yamauchi

AI总结:

该研究将默会知识建模为VaCoAl超维记忆的运行机制,区分两类默会性,提出审计-评估互补性,以解决AI生成科学的无根问题,结合LLMs与VaCoAl/PyVaCoAl实现可审计且具置信度的知识生成与评估。

摘要:

我们认为,默会知识更适合被建模为一种记忆基质的运行机制,而非一种内容类型。该基质为VaCoAl,一种基于GF(2)的代数-确定性异或-移位超维记忆,可通过CASRAM(商用SRAM-CAM)和PyVaCoAl(DRAM-CAM)实现。在VaCoAl/PyVaCoAl中,有向无环图(DAG)具备双向读取能力。修复所有冲突(救援模式)可使轨迹完全可审计,但不会对任何路径进行排序;容忍冲突(不关心模式)则会产生路径整合置信度CR₂,其会隐性倾向于直接路径。这种审计-评估互补性是波兰尼关于默会知识与明述知识并非截然二分的主张的形式对应物。它区分了新查询所显现的偶然默会性(如AlphaGo的博弈树)与仅能在其消失的机制中被表述的机制绑定默会性(如AlphaGo的直觉)。(1)波兰尼的“从-到”结构可解读为非交换绑定,“Identikit”(人像拼合系统)可解读为角色-填充者组合,识别可解读为多数投票重合。(2)阐释评估会破坏它,正如关注波兰尼的手指会使他的钢琴家演奏失误,但存在闭式定律可表述该机制。波兰尼、野中郁次郎、Tsoukas和柯林斯各自捕捉到了该机制的一部分但较为片面;即便野中郁次郎和冯·克罗格的连续体也无法区分偶然默会性与机制绑定默会性。(3)柯林斯的三种默会知识成为了层级,其中一种位于基质之外。(4)我们的师生有向无环图是默会传递图。(5)Terence Tao关于AI解决的问题催生的后续研究较少的论断,被诊断为无根明述知识:可核查的结果,其路径无人能追溯,且无人能充分理解以进行扩展、教授或评判。为重新确立这些结果的根基,大型语言模型(LLMs)进行生成,VaCoAl/PyVaCoAl保留带有其置信度的可审计轨迹,而人类进行评估,角色美德认识论表明该评估无法被卸载。可检验的预测随之产生。

英文摘要:

Tacit knowing is an operating regime of memory, not a separate content. In VaCoAl (CASRAM, PyVaCoAl), a deterministic hyperdimensional memory over GF(2), one DAG of bound records is read in two ways. With all collisions repaired (Rescue), the trace is exactly auditable but no path outranks any; with collisions tolerated (Don't Care), a path confidence $CR_2$ ranks direct over circuitous routes unstated. This audit-valuation complementarity formalizes Polanyi's claim that tacit and explicit are not sharply divided. (1) Polanyi's from-to is non-commutative binding. (2) Full explication destroys the valuation (Lemma 1), as with Polanyi's pianist; tacitness is contingent or regime-bound, putting Polanyi, Nonaka, Tsoukas and Collins on one substrate. (3) The lemma answers the popular dual-process moral ("train slow System 2 to tame fast System 1"), mirroring the two-store reading of knowledge Polanyi rejected; Mercier and Sperber's reasoning as intuitive inference about reasons matches his. (4) To know a large DAG is to cull it. Against Polanyi's Meno reading, Simon held that a test and a generator, guided by statable heuristics, suffice. The AlphaGo-to-AlphaProof lineage builds the test, but its strongest systems cull by unstatable valuations: the tacit is relocated, not removed, results are verified yet rootless, and practicable traces must record the cull. (5) Collins's three tacit knowledges are bound structure, substrate valuation and value binding. (6) Our mentor-student DAG maps tacit transmission. (7) AI-solved problems lacking follow-ups (Tao) are rootless explicit knowledge, re-rooted if LLMs generate, VaCoAl traces, the community values. (8) For Mercier and Sperber an LLM is a sophist; truth-seeking lies in collective tacit knowing, Polanyi's conviviality, conjectured to extend beyond humans; machine-only knowledge reaches at most Sosa's animal grade. Testable predictions follow.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑