AGENTIC-SYSTEMSJuly 14, 20261 min read

Feedback-Coupled Memory Systems in Continuous Time

The continuous-time Feedback-Coupled Memory Systems (FCMS) architecture achieves global stability by defining its core operators through economic and physical frameworks, establishing a universal principle where memory dissipation must outpace feedback gain.

Computer Science > Artificial Intelligence

Title:Feedback-Coupled Memory Systems in Continuous Time

View PDFAbstract:The Feedback-Coupled Memory Systems (FCMS) architecture formalizes closed-loop coordination through four abstract operators, two of which - the agent update operator $f_i$ and the environmental update operator $\Psi$ - are left axiomatically undefined in the original framework. To address this, $f_i$ is defined by Mechanism-Based Intelligence (MBI), where agents update locally through a decentralized price mechanism and economic principles, and $\Psi$ is defined by the Coupled Memory Graph Process (CMGP), a non-Markovian framework where the environment is treated as a physical substrate that records and responds to trajectory history coherently without external forcing. The resulting continuous-time FCMS instantiation achieves Lyapunov global dissipativity governed by the computable threshold $4\beta^2 < 2\eta\mu\gamma^2$. This generalizes both the discrete FCMS stability condition $4\eta\beta^2 < \gamma$ and CMGP's physical bifurcation threshold $\alpha_c = 1/K$, confirming that memory dissipation must outpace feedback gain as a universal organizing principle. Numerical simulation with $N=2$ agents and mean-field validation at $N=10^6$ confirm the stability threshold and the self-reinforcing coordination cascade that emerges when it is violated.

Source: arXiv cs.AI Recent

More in this category

agentic-systems

BatteryLake: Agentic, Physics-Grounded Curation of Heterogeneous Battery Aging Data and Benchmarking

Researchers have introduced BatteryLake, a governed data lakehouse that automates the curation of heterogeneous battery aging data using LLM agents and physics-grounded rules. This framework aims to accelerate research in battery health management (SOH and RUL) by providing a standardized benchmark of 41 datasets.

agentic-systems

LegalFarePlan: A Label-Setting Framework for Fare-Transparent Urban Rail Route Planning under Non-Additive Fare Rules

Researchers have proposed LegalFarePlan, a route-planning framework that optimizes urban rail fares by leveraging non-additive fare rules through legal exit-and-reentry operations.

agentic-systems

Task-Conditioned Synthetic Data Generation for Improving Machine Learning Performance in Agricultural Prediction Tasks

Researchers have proposed Task-Conditioned Synthetic Data Generation (TCSDG), a novel algorithm that addresses data scarcity in agricultural machine learning. By combining Bayesian Networks with transformer-based models, TCSDG significantly improves the accuracy of crop yield prediction and crop type classification.

NOW LET US Related – A Dynamic Scene Interaction Reasoning Framework for Scene-level Lane-Change Intention and Trajectory Prediction of Multiple Interacting Vehicles

agentic-systems

A Dynamic Scene Interaction Reasoning Framework for Scene-level Lane-Change Intention and Trajectory Prediction of Multiple Interacting Vehicles

Researchers have proposed DSiGAT, a novel dynamic scene graph attention framework that predicts both the lane-change intentions and future trajectories of multiple interacting vehicles simultaneously, significantly improving autonomous driving safety.

agentic-systems

Scaffolding the Strategist: Architecture-Dependent Reasoning Interventions in Hotelling Spatial Markets

A new study reveals a significant crossover interaction between reasoning scaffolding and LLM architecture, showing that interventions helping standard models can degrade reasoning-optimized models.

agentic-systems

Coresets Before Score Sets: Evaluation-Unsupervised Prompt Subset Selection for LLM Benchmarks

Researchers propose an evaluation-unsupervised prompt subset selection method to compress massive LLM benchmarks while preserving evaluation accuracy, significantly reducing computation costs.