MMLA-RSI:通过RTT与RTMA实现递归自我改进
MMLA-RSI: Recursive Self-Improvement through RTT and RTMA
AI总结:
本文提出MMLA-RSI递归自我改进方案,通过RTT优化策略状态、RTMA优化权威记忆,经实验验证其在程序选择等任务中可降低误差,相关递归路径的效率仍待评估。
摘要:
智能体可通过调整行为方式与保留的经验,在未解决问题中优化自身表现。本文提出MMLA-RSI,这是一种在记忆介导学习架构(Memory-Mediated Learning Architecture)中实现的递归自我改进方案,包含两种实现方式:推理时间训练(Reasoning-Time Training, RTT)用于优化策略状态Φ,推理时间记忆适配(Reasoning-Time Memory Adaptation, RTMA)用于优化权威记忆M。每条路径还会将自身的适配方法作为改进对象:当前数值更新器训练策略以提出其继任者,当前记忆管理器选择可供该过程使用的记录以提出其继任者;经独立认可的继任者将在下一代接管相同角色。本文提供了有界可执行规则语言、共享任务/提案接口,以及每条路径或其组合的算法。RTT实例在截断动量更新中调整标量调度,RTMA实例则选择NULL或带可能驱逐的完整行写入。固定解释器、可信提交者与独立评估器对可变更内容进行约束,状态版本、读取闭包与条件属性描述因果执行、可接受的转换及有限工作量,现有数值组件研究为该构建提供了支撑。在四候选程序选择任务中,保留LARC反馈更新使两种训练初始化的预期误差分别降低24.65和36.65个百分点;在时序持续集成重放任务中,反馈绑定产生积极效果但保留会增加损失;已完成的SQL研究相比未适配的基础模型有显著提升,但未确立所需的额外在线收益。这些结果对其声明的组件进行了表征,本文明确了两条递归路径及其联合实现,其有益的递归链与发现效率仍待评估。
英文摘要:
An agent can improve its behavior within an unresolved problem by changing how it acts and which experience it retains. We propose MMLA-RSI, a recursive self-improvement scheme with two implementations in Memory-Mediated Learning Architecture: Reasoning-Time Training (RTT) changes the policy state $Φ$, while Reasoning-Time Memory Adaptation (RTMA) changes authoritative memory $M$. Each route also makes its adaptation method an object of improvement. A current numerical updater trains the policy proposing its successor; a current memory manager chooses the records available to the process proposing its successor. An independently admitted successor takes over the same role in the next generation. We give bounded executable rule languages, shared task/proposal interfaces, and one algorithm for either route or their composition. The RTT instance changes scalar schedules in a clipped-momentum update. The RTMA instance chooses NULL or a complete-row write with possible eviction. A fixed interpreter, trusted committer, and independent evaluator bound what can change. State versions, read closures, and conditional properties describe causal execution, accepted transitions, and finite work. Existing numerical-component studies motivate the construction. In four-candidate program selection, retaining LARC feedback updates reduces expected error by 24.65 and 36.65 percentage points for two trained initializations. In chronological continuous-integration replay, feedback binding is positive while retention increases loss. Completed SQL studies improve substantially over an unadapted substrate but do not establish the required additional online benefit. These results characterize their declared components. The two recursive routes and their joint realization are specified here; their beneficial recursive chains and discovery efficiency remain to be evaluated.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。