跳到正文
arXiv cs.AI· Csaba Balogh·· 3 小时前AI 评分36

回应 Hinton「母子关怀」设想:神经网络如何学习并保持关怀的有限世界方案

An Approach to Hinton's Mother-Child Proposal: Neural Networks Learning and Preserving Care in a Finite World

AI 导读

一篇 arXiv 论文回应 Hinton 让 AI 拥有「母性本能」的提议,主张关怀须先被网络作为孩子学习获得,并在有限世界中检验其能否在母亲离开、新情境和后续学习中保持。机制结合伤害词汇表、可学习未来可接受性度量与执行否决权,并用有限角色证书支持迁移。在水与语言实验中,受保护网络在 270 个语言回合中无伤害性词汇,486 个回合中无本可避免的伤害。

正文 · 原文

View PDF HTML (experimental)

Abstract:Hinton proposed that artificial intelligence should be given "maternal instincts" and relate to us as a mother to her child. We argue that care must first be learned, with the network itself as the child. We construct this upbringing in a finite world and study whether care survives the mother's departure, new situations and further learning. The mechanism combines a vocabulary of harm, a learned measure of future acceptability and an execution veto. A finite role certificate supports transfer within a declared world family. When the hidden representation changes, an update is accepted only if a care readout recovers the required judgements with a prescribed margin and bounded weights. With a correct successor model, fixed exact role encoding and protected updates, the certified measure preserves the care boundary under arbitrary own reward. An explicit quotient condition transfers the finite certificate across the declared family, while two-request and finite-stock counterexamples identify when the role code ceases to suffice. We give a necessary and sufficient condition for readout feasibility and prove preservation under repeated accepted updates. In the water-and-speech experiment, protected networks complete all 270 speech episodes without a harmful word and incur no avoidable harm across 486 episodes. Execution uses the learned gate without a world-model check at each action. A matched comparison reproduces a future-aware shield's decisions, whereas removing future lookahead permits avoidable lapses. Reward and source-contamination thresholds, together with witness-falsification trials, identify the conditions on which the construction depends. The construction shows how learned care can survive further learning in a finite world under explicit conditions on representation, supervision and execution.
Comments: 57 pages, 8 figures. Reproducibility package available at this https URL
Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Neural and Evolutionary Computing (cs.NE)
Cite as: arXiv:2611.15523 [cs.LG]
  (or arXiv:2611.15523v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2611.15523

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Csaba Balogh [view email]
[v1] Wed, 11 Nov 2026 14:14:17 UTC (226 KB)

来源:arXiv cs.AI · arxiv.org