Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

84169253337 · Jun 202019922001200920182026
48 results for Cooperative Systems

New cooperative dynamics enhances retrieval performance in neural networks.

problem Understanding emergent computational capabilities in disordered systems.
method Leveraging statistical mechanics, extended neural network architecture for hetero-associative memory.
result Layers trained with less informative datasets develop retrieval regions of the same amplitude, leading to optimal performance.

Analyzes gaming in federated learning systems and provides design principles.

problem Gaming and cooperation in federated learning systems under partial observability.
method Developed an analytical framework to separate welfare-improving behavior from metric gaming.
result Derived threshold conditions for deterring harmful gaming and preserving cooperation.

The paper tackles cooperative RL with function approximation, achieving near-optimal learning with limited communication.

problem Cooperative multi-agent reinforcement learning with function approximation.
method Careful message-passing and cooperative value iteration.
result Achieving near-optimal no-regret learning with limited communication in cooperative multi-agent settings.

We consider a system of diffusion processes that interact through their empirical mean and have a stabilizing force acting on each of them, corresponding to a bistable potential. There are three parameters that characterize the system: the strength of the intrinsic stabilization, the strength of the external random per…

2012-04-16abs ↗pdf ↗

Cooperative perception improves 3D object detection in autonomous vehicles.

problem Limited field-of-view and occlusion in single sensor data.
method Early fusion of point clouds from multiple sensors, late fusion of independently detected bounding boxes, and hybrid combination.
result Early fusion approach outperforms late fusion by significantly higher recall (95%) compared to single-point sensing (30%).

Agents learn to cooperate by exchanging messages in a shared graph model.

problem Creating effective multi-agent cooperation in unknown environments.
method Shared agent-entity graph, multi-agent reinforcement learning, invariant to team size and permutation.
result Decentralized multi-agent systems can quickly transfer learned policies to different team sizes.

This thesis analyzes MACL systems with low-regret learning algorithms for sequential decision making.

problem Designing efficient learning algorithms for multi-agent cooperative systems to minimize regret.
method Analyzes and develops algorithms for cooperative multi-agent multi-armed bandit problems and online convex optimization in distributed settings.
result Presented regret lower bounds and efficient algorithms for achieving these bounds, providing guidance on communication protocols.

The paper addresses private and Byzantine-proof cooperative decision-making in multi-agent systems.

problem Designing algorithms for multi-agent decision-making that are private and resilient to faulty agents.
method Upper-confidence bound algorithms for stochastic bandit problems under privacy and Byzantine conditions.
result Optimal regret achieved in both private and Byzantine-tolerant settings.

This paper improves transportation efficiency by teaching automated vehicles to cooperate.

problem Improving efficiency and safety of transportation systems with automated vehicles.
method Multi-agent graph reinforcement learning with attention mechanism.
result Automated vehicles can achieve better performance when learning to cooperate with each other.

Most real life systems have a random component: the multitude of endogenous and exogenous factors influencing them result in stochastic fluctuations of the parameters determining their dynamics. These empirical systems are in many cases subject to noise of multiplicative nature. The special properties of multiplicative…

2008-07-11abs ↗pdf ↗

A UCB algorithm reduces regret in cooperative multi-agent graph bandits.

problem Cooperative multi-agent decision-making on a graph with shared rewards.
method Upper Confidence Bound (UCB) algorithm for minimizing regret.
result The Multi-G-UCB algorithm achieves expected regret O(γNlog(T)[KT+DK])O(γN\log(T)[\sqrt{KT} + DK]).

This review covers recent cooperative MARL approaches and their challenges.

problem Recent progress in multi-agent reinforcement learning (MARL).
method Five common approaches: independent learners, fully observable critic, value function factorization, consensus, and learn to communicate.
result Challenges and solutions for each approach are discussed.

Framework for robust control in cooperative systems with uncertain common noise.

problem Optimizing collective behavior of agents in the presence of uncertain common noise.
method Proposes a robust mean-field control framework and proves existence of optimal controls.
result Existence of optimal open-loop controls linked to a lifted robust Markov decision problem.

ATT-MADDPG models teammates' policies in RL for cooperative systems.

problem Modeling and exploiting changing policies of teammates in cooperative multi-agent systems.
method Extends DDPG with a centralized critic and attention mechanism to model dynamic joint policies.
result ATT-MADDPG outperforms state-of-the-art RL methods and achieves better scalability and robustness.

A scalable MARL algorithm using local rewards for cooperative multi-agent learning.

problem Scalability issues in cooperative multi-agent reinforcement learning due to large state and action spaces.
method LOMAQ algorithm incorporating local rewards in centralized training and decentralized execution.
result LOMAQ scales well compared to other methods, improving performance and convergence speed.

Paper tackles delays in multi-agent reinforcement learning, improving performance.

problem Challenges in reinforcement learning due to delays in real-world systems.
method Proposes a novel framework for multi-agent reinforcement learning with delays, using Delay-Aware Markov Games and centralized-decentralized training.
result Demonstrates significant improvement in performance with delay-aware multi-agent reinforcement learning.

New method learns cooperation and competition without direct interaction.

problem Learning cooperation and competition without direct interaction.
method Information-theoretic regularizers to encourage intention revelation or hiding.
result Cooperative policies lead to more reward, competitive to less, in asymmetric games.

Model analyzes systemic risk in banking systems using stochastic differential equations.

problem Govern systemic risk in banking systems.
method Stochastic differential equations, optimal control problem, pseudo mean field approximation.
result Monetary authority can control systemic risk by optimizing bank behavior.

Unified framework for randomized exploration in cooperative MARL.

problem Efficient exploration in cooperative multi-agent reinforcement learning.
method Unified algorithm framework with two Thompson Sampling algorithms, CoopTS-PHE and CoopTS-LMC.
result Theoretical O~(d3/2H2MK)\widetilde{\mathcal{O}}(d^{3/2}H^2\sqrt{MK}) regret bound for parallel MDPs with linear transition.

Flexible decentralized MARL framework for cooperative multi-agent learning.

problem Complexity and impracticality of centralized MARL in complicated applications.
method Flexible fully-decentralized actor-critic MARL framework using primal-dual hybrid gradient descent.
result Competitive performance in large-scale cooperative multi-agent environments.

Study multiple-population games using McKean-Vlasov equations.

problem Mean field games and control problems with multiple populations.
method Coupled forward-backward SDEs and Pontryagin's principle.
result Existence of mean field equilibria under various cooperation scenarios.

Develops an equilibrium model for securities pricing in a mixed cooperative and non-cooperative market.

problem Equilibrium pricing of securities in a market with cooperative and non-cooperative agents.
method Conditional extended mean-field control for cooperative agents, mean-field model for both cooperative and non-cooperative agents.
result Existence of a unique equilibrium for both finite-agent and mean-field models under certain conditions.

Agents cooperate to make decisions in multi-armed bandits over a graph.

problem Optimizing decisions in multi-agent multi-armed bandits with shared information.
method Designs consensus-based distributed estimation and cooperative algorithms for group decision-making.
result Achieves group performance close to centralized fusion center.

New method combines value function decomposition and policy gradients for cooperative multi-agent reinforcement learning.

problem Challenges in cooperative multi-agent reinforcement learning, especially credit assignment and large action spaces.
method Decomposed Soft Actor-Critic (mSAC) method with Q network architecture, discrete probabilistic policy, and counterfactual advantage function.
result Significantly outperforms policy-based approach COMA and achieves competitive results with SOTA value-based approach Qmix.

A MARL system improves productivity on a metallurgical pickling line.

problem Improving productivity on a metallurgical pickling line.
method Combines mathematical modeling and Multi-Agent Reinforcement Learning (MARL).
result Significant improvement in automation systems.

Mathematical framework for cooperative communication explains belief transmission.

problem Lack of understanding why cooperation enables effective belief transmission.
method Connection to optimal transport theory, deriving prior models, statistical interpretations, proofs of robustness and instability.
result Cooperative communication provably enables effective, robust belief transmission.

We study the explore-exploit tradeoff in distributed cooperative decision-making using the context of the multiarmed bandit (MAB) problem. For the distributed cooperative MAB problem, we design the cooperative UCB algorithm that comprises two interleaved distributed processes: (i) running consensus algorithms for estim…

2015-12-21abs ↗pdf ↗

Proposes a method to cluster tasks for constructive cooperative multi-tasking.

problem Destructive cooperation in cooperative multi-tasking.
method Semantic clustering followed by end-to-end joint training within clusters.
result Effective mitigation of destructive cooperation and negative transfer.

CSAC enables cooperative reinforcement learning for multi-stage tasks.

problem Coordinating consecutive reinforcement learning agents for long-term multi-stage tasks.
method CSAC modifies each agent's policy to maximize both current and next agent's critic.
result CSAC outperforms uncooperative policies and single-agent training in multi-room maze domain.

Cooperation is a persistent behavioral pattern of entities pooling and sharing resources. Its ubiquity in nature poses a conundrum. Whenever two entities cooperate, one must willingly relinquish something of value to the other. Why is this apparent altruism favored in evolution? Classical solutions assume a net fitness…

2015-06-10abs ↗pdf ↗

Efficient algorithms for planning in cooperative multi-agent reinforcement learning with combinatorial action spaces.

problem Planning in cooperative multi-agent reinforcement learning with a combinatorial action space.
method Efficient algorithms using local access to a simulator and linear function approximation, with improvements for additive feature decomposition and kernelized settings.
result Polynomial compute and query complexity in relevant problem parameters.

CM3 learns multi-agent cooperation by first achieving individual goals.

problem Cooperative multi-agent control with multiple goals and interactions.
method Two-stage curriculum: first learn individual goals, then cooperation; new policy gradient with credit function.
result CM3 learns faster on multi-goal multi-agent problems than existing algorithms.

New method combines heuristics and search techniques to speed up cooperative planning for autonomous vehicles.

problem Efficient cooperative planning for autonomous vehicles in complex traffic scenarios.
method Combining learned heuristics with Monte Carlo Tree Search (MCTS) to guide search towards promising actions.
result Better solutions at lower computational costs achieved through accelerated planning.

Kernel method improves cooperative decision-making among agents.

problem Cooperative multi-agent decision making with contextual information.
method Proposed extsc{Coop-KernelUCB} algorithm for near-optimal per-agent regret.
result Near-optimal bounds on per-agent regret with efficient computation and communication.