Causal Coupled Mechanisms: A Control Method with Cooperation and Competition for Complex System

• URL: http://arxiv.org/abs/2209.07368v1
• Date: Thu, 15 Sep 2022 15:32:16 GMT
• Title: Causal Coupled Mechanisms: A Control Method with Cooperation and Competition for Complex System
• Abstract summary: A novel control method, Causal Coupled Mechanisms, is proposed that explores the cooperation in division and competition in combination. On both synthetic systems and a real-world biological regulatory system, the CCM method achieves robust and state-of-the-art control results even with unpredictable random noise.
• Score: 4.829957501538467
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Complex systems are ubiquitous in the real world and tend to have complicated and poorly understood dynamics. For their control issues, the challenge is to guarantee accuracy, robustness, and generalization in such bloated and troubled environments. Fortunately, a complex system can be divided into multiple modular structures that human cognition appears to exploit. Inspired by this cognition, a novel control method, Causal Coupled Mechanisms (CCMs), is proposed that explores the cooperation in division and competition in combination. Our method employs the theory of hierarchical reinforcement learning (HRL), in which 1) the high-level policy with competitive awareness divides the whole complex system into multiple functional mechanisms, and 2) the low-level policy finishes the control task of each mechanism. Specifically for cooperation, a cascade control module helps the series operation of CCMs, and a forward coupled reasoning module is used to recover the coupling information lost in the division process. On both synthetic systems and a real-world biological regulatory system, the CCM method achieves robust and state-of-the-art control results even with unpredictable random noise. Moreover, generalization results show that reusing prepared specialized CCMs helps to perform well in environments with different confounders and dynamics.

Related papers

• Beyond Individual Intelligence: Surveying Collaboration, Failure Attribution, and Self-Evolution in LLM-based Multi-Agent Systems [65.90791804095561]
  Multi-agent systems address this through structured collaboration among specialized agents, but tighter coordination amplifies a less explored risk.<n>Existing surveys cover individual agent capabilities, multi-agent collaboration, or agent self-evolution separately, leaving the causal dependencies among them unexamined.<n>This survey provides a unified review organized around four causally linked stages, which we term the LIFE progression: Lay the capability foundation, Integrate agents through collaboration, Find faults through attribution, and Evolve through autonomous self-improvement.
  arXiv  Detail & Related papers  (2026-05-14T14:36:13Z)
• Do Agent Societies Develop Intellectual Elites? The Hidden Power Laws of Collective Cognition in LLM Multi-Agent Systems [5.867974734829712]
  We present the first large-scale empirical study of coordination dynamics in multi-agent systems.<n>We analyze over 1.5 Million interactions across tasks, topologies, and scales.<n>We uncover three coupled laws: coordination follows heavy-tailed cascades, concentrates via preferential attachment into intellectual elites, and produces increasingly frequent extreme events as system size grows.
  arXiv  Detail & Related papers  (2026-04-03T03:08:07Z)
• Guided Collaboration in Heterogeneous LLM-Based Multi-Agent Systems via Entropy-Based Understanding Assessment and Experience Retrieval [35.96356869281219]
  We describe a counterintuitive phenomenon in the strong-weak system: a strong-weak collaboration may under-perform weak-weak combinations.<n>We propose an Entropy-Based Adaptive Guidance Framework that dynamically aligns the guidance with the cognitive state of each agent.<n>Our approach consistently enhances the effectiveness and stability of heterogeneous collaboration.
  arXiv  Detail & Related papers  (2026-02-14T07:10:04Z)
• Social World Model-Augmented Mechanism Design Policy Learning [58.739456918502704]
  We introduce SWM-AP (Social World Model-Augmented Mechanism Design Policy Learning), which learns a social world model hierarchically to enhance mechanism design.<n>We show that SWM-AP outperforms established model-based and model-free RL baselines in cumulative rewards and sample efficiency.
  arXiv  Detail & Related papers  (2025-10-22T06:01:21Z)
• Diagnose, Localize, Align: A Full-Stack Framework for Reliable LLM Multi-Agent Systems under Instruction Conflicts [75.20929587906228]
  Large Language Model (LLM)-powered multi-agent systems (MAS) have rapidly advanced collaborative reasoning, tool use, and role-specialized coordination in complex tasks.<n>However, reliability-critical deployment remains hindered by a systemic failure mode: hierarchical compliance under instruction conflicts.
  arXiv  Detail & Related papers  (2025-09-27T08:43:34Z)
• Q-Learning-Driven Adaptive Rewiring for Cooperative Control in Heterogeneous Networks [0.0]
  We propose a Q-learning-based variant of adaptive rewiring that builds on mechanisms studied in the literature.<n>We show that fully adaptive rewiring enhances cooperation levels through systematic exploration of favorable network configurations.<n>Our results establish a new paradigm for understanding intelligence-driven cooperation pattern formation in complex adaptive systems.
  arXiv  Detail & Related papers  (2025-09-01T01:52:56Z)
• A Neuroscience-Inspired Dual-Process Model of Compositional Generalization [4.575444193827658]
  We present MIRAGE, a framework that achieves systematic generalization on compositional tasks.<n>MIRAGE has two interacting modules mirroring the brain's deliberative HPC-PFC loop and intuitive neocortical pattern recognition.<n>This approach demonstrates systematic compositional generalization on the SCAN benchmark, achieving > 99% accuracy on all task splits with only 1.19M parameters in the transformer module.
  arXiv  Detail & Related papers  (2025-07-25T01:02:07Z)
• Compositional Learning for Modular Multi-Agent Self-Organizing Networks [0.7122137885660501]
  Self-organizing networks face challenges from complex parameter interdependencies and conflicting objectives.<n>This study introduces two compositional learning approaches-Compositional Deep Reinforcement Learning (CDRL) and Compositional Predictive Decision-Making (CPDM)<n>We propose a modular, two-tier framework with cell-level and cell-pair-level agents to manage heterogeneous agent granularities while reducing model complexity.
  arXiv  Detail & Related papers  (2025-06-03T08:33:18Z)
• Contraction Actor-Critic: Contraction Metric-Guided Reinforcement Learning for Robust Path Tracking [0.0]
  Control contraction metrics ( CCMs) provide a framework to co-synthesize a controller and a corresponding contraction metric.<n>We propose to integrate CCMs into reinforcement learning (RL), where CCMs provide dynamics-informed feedback for learning control policies.<n>We show that our algorithm, called contraction actor-critic (CAC), formally enhances the capability of CCMs to provide a set of contracting policies.
  arXiv  Detail & Related papers  (2025-05-28T22:26:23Z)
• Multi-Agent Collaboration via Evolving Orchestration [61.93162413517026]
  Large language models (LLMs) have achieved remarkable results across diverse downstream tasks, but their monolithic nature restricts scalability and efficiency in complex problem-solving.<n>We propose a puppeteer-style paradigm for LLM-based multi-agent collaboration, where a central orchestrator dynamically directs agents in response to evolving task states.<n> Experiments on closed- and open-domain scenarios show that this method achieves superior performance with reduced computational costs.
  arXiv  Detail & Related papers  (2025-05-26T07:02:17Z)
• Beyond Frameworks: Unpacking Collaboration Strategies in Multi-Agent Systems [29.924868489451327]
  This study systematically investigates four dimensions of collaboration strategies.<n>We quantify the impact of these strategies on both task accuracy and computational efficiency.<n>This work establishes a foundation for designing adaptive, scalable multi-agent systems.
  arXiv  Detail & Related papers  (2025-05-18T15:46:14Z)
• A Cascading Cooperative Multi-agent Framework for On-ramp Merging Control Integrating Large Language Models [26.459779380808587]
  We introduce the Cascading Cooperative Multi-agent ( CCMA) framework, integrating RL for individual interactions, a fine-tuned Large Language Model (LLM) for regional cooperation, a reward function for global optimization, and the Retrieval-augmented Generation mechanism to dynamically optimize decision-making across complex driving scenarios. Our experiments demonstrate that the CCMA outperforms existing RL methods, demonstrating significant improvements in both micro and macro-level performance in complex driving environments.
  arXiv  Detail & Related papers  (2025-03-11T09:08:04Z)
• Causal Mean Field Multi-Agent Reinforcement Learning [10.767740092703777]
  A framework named mean-field reinforcement learning (MFRL) could alleviate the scalability problem by employing the Mean Field Theory. This framework lacks the ability to identify essential interactions under nonstationary environments. We propose an algorithm called causal mean-field Q-learning (CMFQ) to address the scalability problem.
  arXiv  Detail & Related papers  (2025-02-20T02:15:58Z)
• Towards the Structure and Mechanisms of Complex Systems, the Approach of the Quantitative Theory of Meaning [0.0]
  We study analysis of complex systems using a Quantitative Theory of Meaning developed as an extention of Shannon's Communication Theory. The dynamics of the system are provided by reflexive communication between heterogenious agents.
  arXiv  Detail & Related papers  (2024-12-12T07:18:47Z)
• Do Not Marginalize Mechanisms, Rather Consolidate! [0.0]
  Structural causal models (SCMs) are a powerful tool for understanding the complex causal relationships that underlie many real-world systems. As these systems grow in size, the number of variables and complexity of interactions between them does, too. We show consolidation is a powerful method for simplifying SCM, discuss reduction of computational complexity and give a perspective on generalizing abilities of consolidated SCM.
  arXiv  Detail & Related papers  (2023-10-12T14:47:51Z)
• On the Complexity of Multi-Agent Decision Making: From Learning in Games to Partial Monitoring [105.13668993076801]
  A central problem in the theory of multi-agent reinforcement learning (MARL) is to understand what structural conditions and algorithmic principles lead to sample-efficient learning guarantees. We study this question in a general framework for interactive decision making with multiple agents. We show that characterizing the statistical complexity for multi-agent decision making is equivalent to characterizing the statistical complexity of single-agent decision making.
  arXiv  Detail & Related papers  (2023-05-01T06:46:22Z)
• Learning Reward Machines in Cooperative Multi-Agent Tasks [75.79805204646428]
  This paper presents a novel approach to Multi-Agent Reinforcement Learning (MARL) It combines cooperative task decomposition with the learning of reward machines (RMs) encoding the structure of the sub-tasks. The proposed method helps deal with the non-Markovian nature of the rewards in partially observable environments.
  arXiv  Detail & Related papers  (2023-03-24T15:12:28Z)
• DMAP: a Distributed Morphological Attention Policy for Learning to Locomote with a Changing Body [126.52031472297413]
  We introduce DMAP, a biologically-inspired, attention-based policy network architecture. We show that a control policy based on the proprioceptive state performs poorly with highly variable body configurations. DMAP can be trained end-to-end in all the considered environments, overall matching or surpassing the performance of an oracle agent.
  arXiv  Detail & Related papers  (2022-09-28T16:45:35Z)
• Investigation of Machine Learning-based Coarse-Grained Mapping Schemes for Organic Molecules [0.0]
  Coarse-graining (CG) allows to establish a link between different system resolutions. We explore the application of a Machine Learning strategy, based on Variational Autoencoders, for the development of suitable mapping schemes.
  arXiv  Detail & Related papers  (2022-09-26T18:30:51Z)
• Efficient Model-Based Multi-Agent Mean-Field Reinforcement Learning [89.31889875864599]
  We propose an efficient model-based reinforcement learning algorithm for learning in multi-agent systems. Our main theoretical contributions are the first general regret bounds for model-based reinforcement learning for MFC. We provide a practical parametrization of the core optimization problem.
  arXiv  Detail & Related papers  (2021-07-08T18:01:02Z)
• A Formal Framework for Reasoning about Agents' Independence in Self-organizing Multi-agent Systems [0.7734726150561086]
  This paper proposes a logic-based framework of self-organizing multi-agent systems. We show that the computational complexity of verifying such a system remains close to the domain of standard ATL. We also show how we can use our framework to model a constraint satisfaction problem.
  arXiv  Detail & Related papers  (2021-05-17T07:32:43Z)
• Structured Diversification Emergence via Reinforced Organization Control and Hierarchical Consensus Learning [48.525944995851965]
  We propose a structured diversification emergence MARL framework named scRochico based on reinforced organization control and hierarchical consensus learning. scRochico is significantly better than the current SOTA algorithms in terms of exploration efficiency and cooperation strength.
  arXiv  Detail & Related papers  (2021-02-09T11:46:12Z)
• Compositionality of Linearly Solvable Optimal Control in Networked Multi-Agent Systems [27.544923751902807]
  We discuss the methodology of generalizing the optimal control law from learned component tasks to unlearned composite tasks on Multi-Agent Systems (MASs) The proposed approach achieves both the compositionality and optimality of control actions simultaneously within the cooperative MAS framework in both discrete- and continuous-time in a sample-efficient manner.
  arXiv  Detail & Related papers  (2020-09-28T20:21:48Z)
• F2A2: Flexible Fully-decentralized Approximate Actor-critic for Cooperative Multi-agent Reinforcement Learning [110.35516334788687]
  Decentralized multi-agent reinforcement learning algorithms are sometimes unpractical in complicated applications. We propose a flexible fully decentralized actor-critic MARL framework, which can handle large-scale general cooperative multi-agent setting. Our framework can achieve scalability and stability for large-scale environment and reduce information transmission.
  arXiv  Detail & Related papers  (2020-04-17T14:56:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.