We present the MagNet, a neural network-based multi-agent interaction model to discover the governing dynamics and predict evolution of a complex multi-agent system from observations. We formulate a multi-agent system as a coupled non-linear network with a generic ordinary differential equation (ODE) based state evolut…
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.
168,695 papers · 148 categories
Trend · papers per month
48 results for “multi-agent interaction”
Improves neural relational inference for dynamic multi-agent trajectories.
problem Limited accuracy of NRI in short output sequences for relational inference in multi-agent trajectories.
method Proposes DYnamic multi-AgentRelational Inference (DYARI) model to handle changing interactions over time.
result DYARI model outperforms NRI in dynamic relational inference tasks.
This paper proposes using variational autoencoders to model opponents in multi-agent systems.
problem Understanding and interacting with opponents in multi-agent systems.
method Variational autoencoders for opponent modeling, with a modification to use local information.
result Our opponent modeling methods achieve equal or greater episodic returns.
VPP learns joint policies for multi-agent RL through interactions.
problem Learning effective joint policies for multi-agent reinforcement learning.
method VPP integrates variational inference into policy layers for efficient sampling and differentiability.
result VPP outperforms previous methods on large-scale multi-agent tasks.
This work tackles uncertainty in multi-agent multi-modal trajectory forecasting.
problem Measuring and ranking uncertainty in multi-agent multi-modal trajectory forecasting.
method Proposes collaborative uncertainty (CU) and a CU-aware regression framework.
result The CU-aware regression framework improves SOTA systems' performances.
Randomized feature models learn interaction kernels from agent paths.
problem Learning interaction kernels from noisy agent paths.
method Randomized feature algorithm and sparse regression.
result Pruned features reduce overfitting and lower simulation cost.
INTAGS uses interactive simulation to improve realism in multi-agent systems.
problem Challenges in developing realistic agent-based simulators for multi-agent systems.
method INTAGS introduces a novel metric to evaluate the difference between real and synthetic multi-agent systems, optimizing a stochastic policy in reinforcement learning to adapt to interactive sequential decision-making environments.
result INTAGS generates more realistic market data compared to state-of-the-art approaches.
The behavioral dynamics of multi-agent systems have a rich and orderly structure, which can be leveraged to understand these systems, and to improve how artificial agents learn to operate in them. Here we introduce Relational Forward Models (RFM) for multi-agent learning, networks that can learn to make accurate predic…
Study on multi-agent decision making complexity, showing sample efficiency gaps.
problem Understanding sample efficiency in multi-agent decision making.
method General framework for interactive decision making, focusing on equilibrium computation.
result No 'reasonable' complexity measure can close gaps between single and multiple agents.
We propose a method for modeling and learning turn-taking behaviors for accessing a shared resource. We model the individual behavior for each agent in an interaction and then use a multi-agent fusion model to generate a summary over the expected actions of the group to render the model independent of the number of age…
AgensFlow learns multi-agent coordination policies from experience.
problem Difficult coordination choices in multi-agent systems built on LLMs.
method Online policy learning from repeated trajectories, treating decisions as learnable.
result Learned routing improves coordination-heavy workflows over static wiring.
Central to all machine learning algorithms is data representation. For multi-agent systems, selecting a representation which adequately captures the interactions among agents is challenging due to the latent group structure which tends to vary depending on context. However, in multi-agent systems with strong group stru…
Study multi-agent RL in OTC markets, learning from agents' interactions.
problem Designing efficient RL solutions for OTC market interactions.
method Parameterized reward functions, shared policy learning, RL calibration.
result Agents learn to balance hedging and skewing in market simulations.
Increasing energy efficiency in buildings can reduce costs and emissions substantially. Historically, this has been treated as a local, or single-agent, optimization problem. However, many buildings utilize the same types of thermal equipment e.g. electric heaters and hot water vessels. During operation, occupants in t…
This work improves generative models by using feedback from multiple dependent models.
problem Improving the performance of generative models in multi-agent systems.
method Building a hierarchical set-up of multiple dependent generative models and using feedback to improve lower-level models.
result The technique improves the performance of lower-level generative models under certain conditions.
While multi-agent interactions can be naturally modeled as a graph, the environment has traditionally been considered as a black box. We propose to create a shared agent-entity graph, where agents and environmental entities form vertices, and edges exist between the vertices which can communicate with each other. Agent…
A variety of cooperative multi-agent control problems require agents to achieve individual goals while contributing to collective success. This multi-goal multi-agent setting poses difficulties for recent algorithms, which primarily target settings with a single global reward, due to two new challenges: efficient explo…
Improved exploration in cooperative multi-agent reinforcement learning.
problem Limited expressiveness of Gaussian policies in DecSPG hinders effective exploration.
method Proposes decentralized diffusion policy learning (DDPL) with denoising diffusion probabilistic models.
result Consistently improved performance on various MARL benchmarks.
Generative Thermal Design Through Boundary Representation and Multi-Agent Cooperative Environmentcs.LG
Generative thermal design learns optimal shapes using multi-agent reinforcement learning.
problem Complex thermal design challenges due to convection-diffusion equation and boundary interactions.
method Cooperative multi-agent deep reinforcement learning with continuous geometric representation.
result Framework learns optimal design strategies without shape derivation or differentiable objectives.
A new algorithm reduces regret in cooperative multi-agent bandits with heavy-tailed data.
problem Cooperative multi-agent bandits with heavy-tailed data.
method MP-UCB algorithm incorporating robust estimation with message-passing protocol.
result Optimal regret bounds for MP-UCB in various settings.
Fairness is essential for human society, contributing to stability and productivity. Similarly, fairness is also the key for many multi-agent systems. Taking fairness into multi-agent learning could help multi-agent systems become both efficient and stable. However, learning efficiency and fairness simultaneously is a …
Paper proposes method to calibrate market simulator for various scenarios.
problem Calibrate market simulator to represent different market conditions.
method Two-step method using GAN with self-attention to train discriminator and optimize simulator parameters.
result Demonstrates effectiveness of method in capturing various market scenarios.
Intrinsically motivated reinforcement learning aims to address the exploration challenge for sparse-reward tasks. However, the study of exploration methods in transition-dependent multi-agent settings is largely absent from the literature. We aim to take a step towards solving this problem. We present two exploration m…
The paper develops an economic foundation for multi-agent learning in markets.
problem Learning dynamics in markets with strategic externalities.
method A two-phase incentive mechanism that estimates and uses implementable transfers to steer long-run dynamics.
result The mechanism achieves sublinear social-welfare regret and asymptotically optimal welfare under mild rationality and exploration conditions.
A method to train multi-agent reinforcement learning models without intrinsic rewards.
problem Training multi-agent reinforcement learning models with sparse rewards is challenging.
method A learning-based exploration strategy using variational graph autoencoder to generate initial states.
result The method improves the training and performance of multi-agent reinforcement learning models.
New method uses LP to achieve optimal sample complexity in multi-agent reinforcement learning.
problem Achieving global optimality in multi-agent reinforcement learning with average-cost criterion.
method Randomized Linear Programming and Stochastic Primal-Dual Methods for multi-agent saddle point problems.
result Sample complexity matches tight dependencies on state and action spaces, and scales with network size.
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.
When estimating the relevancy between a query and a document, ranking models largely neglect the mutual information among documents. A common wisdom is that if two documents are similar in terms of the same query, they are more likely to have similar relevance score. To mitigate this problem, in this paper, we propose …
MIDAS learns to adaptively control other cars in urban driving scenarios.
problem Autonomous vehicles need to interact with other agents on the road.
method Reinforcement learning with attention mechanism to handle multiple agents.
result MIDAS policies are adaptive and robust to external changes.
CollaQ improves multi-agent performance in StarCraft by 40% with fewer samples.
problem Limited generalization and high training rounds in multi-agent reinforcement learning.
method Formulates multi-agent collaboration as joint optimization on reward assignment, decomposes Q-function into self and interactive terms, and uses MARA loss.
result Improves win rate by 40% in StarCraft maps with same number of samples compared to state-of-the-art techniques.
Many potential applications of reinforcement learning in the real world involve interacting with other agents whose numbers vary over time. We propose new neural policy architectures for these multi-agent problems. In contrast to other methods of training an individual, discrete policy for each agent and then enforcing…
Reinforcement Learning (RL) is a learning paradigm concerned with learning to control a system so as to maximize an objective over the long term. This approach to learning has received immense interest in recent times and success manifests itself in the form of human-level performance on games like \textit{Go}. While R…
Symmetric (Optimistic) Natural Policy Gradient for Multi-agent Learning with Parameter Convergencemath.OC
New NPG variants ensure parameter convergence in multi-agent learning.
problem Non-convergence of parameters in NPG for multi-agent learning.
method Proposed variants of NPG for multi-agent learning scenarios.
result Global last-iterate parameter convergence guarantees in various multi-agent learning settings.
Coordinating multiple interacting agents to achieve a common goal is a difficult task with huge applicability. This problem remains hard to solve, even when limiting interactions to be mediated via a static interaction-graph. We present a novel approximate solution method for multi-agent Markov decision problems on gra…
The paper analyzes strategic interactions in a multi-agent reinsurance chain using game theory.
problem Strategic behavior and competition among insurers and reinsurers in a multi-layer reinsurance chain.
method Employed Stackelberg differential games and non-zero-sum game models to characterize strategic interactions. Used dynamic programming and game theory to derive equilibrium strategies for investment and reinsurance.
result Intensified competition leads to reduced safety loadings in reinsurance contracts.
Most previous studies on multi-agent reinforcement learning focus on deriving decentralized and cooperative policies to maximize a common reward and rarely consider the transferability of trained policies to new tasks. This prevents such policies from being applied to more complex multi-agent tasks. To resolve these li…
The paper simplifies multi-agent RL dynamics in finite-state Markov games using homogenization.
problem Approximating complex multi-agent reinforcement learning dynamics in finite-state Markov games.
method Rescaling learning process by reducing learning rate and increasing update frequency, proving convergence to an ODE.
result The rescaled process converges to an ODE that approximates the agent's learning dynamics.
A new algorithm reduces frequentist regret in multi-agent bandit problems with sparse hypergraphs.
problem Deriving a frequentist regret bound for Thompson sampling in multi-agent settings with sparse hypergraphs.
method Proposed -exploring Multi-Agent Thompson Sampling (-MATS) algorithm that combines exploration and exploitation strategies.
result Achieves a worst-case frequentist regret bound sublinear in time horizon and local arm size, optimal up to constants and logarithms for sparse hypergraphs.
NOHD optimizes multi-agent systems by decomposing dynamics into irrotational and solenoidal components.
problem Non-stationarity and conflicting interests in multi-agent learning problems.
method NOHD (Newton Optimization on Helmholtz Decomposition) decomposes system dynamics into irrotational and solenoidal components.
result NOHD ensures quadratic convergence in purely irrotational and solenoidal systems and attracts to stable fixed points in general multi-agent systems.
We study the problem of training sequential generative models for capturing coordinated multi-agent trajectory behavior, such as offensive basketball gameplay. When modeling such settings, it is often beneficial to design hierarchical models that can capture long-term coordination using intermediate variables. Furtherm…
Safe-M-UCRL learns safe policies for multi-agent systems with global constraints.
problem Global constraints in mean-field reinforcement learning for multi-agent systems.
method Safe-M-UCRL uses epistemic uncertainty and log-barrier approach to ensure constraints satisfaction.
result Safe-M-UCRL learns safe policies for multi-agent systems with global constraints.
REFIL learns from imagined sub-group interactions to improve multi-agent reinforcement learning.
problem Learning efficiency in multi-agent reinforcement learning settings.
method Randomized Entity-wise Factorization (REFIL) approach.
result REFIL outperforms all strong baselines in challenging multi-task StarCraft settings.
Efficient Calibration of Multi-Agent Simulation Models from Output Series with Bayesian Optimizationq-fin.ST
The paper proposes a framework to calibrate multi-agent simulation models from output series using Bayesian optimization.
problem Calibrating multi-agent simulation models from observable output series.
method Novel eligibility set concept, two-sample Kolmogorov-Smirnov test with Bonferroni correction, Bayesian optimization (BO), and trust-region BO (TuRBO).
result Demonstrated the efficiency of the proposed framework using numerical experiments.
Model predicts multi-agent trajectories using a differentiable simulator.
problem Predicting future positions of multiple interacting agents.
method Conditional recurrent variational neural networks (CVRNNs) with a kinematic bicycle model.
result Achieves state-of-the-art results on INTERACTION dataset.
For autonomous vehicles (AVs) to behave appropriately on roads populated by human-driven vehicles, they must be able to reason about the uncertain intentions and decisions of other drivers from rich perceptual information. Towards these capabilities, we present a probabilistic forecasting model of future interactions b…
This study models AI traders' impact on financial markets using a multi-agent framework.
problem Lack of a comprehensive model to assess AI traders' effects on market price formation and volatility.
method Developed a multi-agent market model with microfoundations of the GARCH model.
result Validated the model through simulations and analyzed AI traders' impact.
Novel approach models opponent learning dynamics in multi-agent reinforcement learning.
problem Adaptation and learning of other agents in multi-agent settings cause non-stationarity, challenging existing algorithms.
method Develops a novel approach called Learning to Model Opponent Learning (LeMOL) to accurately model opponent learning dynamics.
result Structured opponent model is more accurate and stable than naive baselines.
This work presents a game-theoretic method for AVs that handles imperfect communication and individual rewards.
problem Real-time, imperfect communication and individual rewards in multi-agent interactions.
method Game-theoretic approach that allows for imperfect communication and individual rewards.
result More realistic assumptions lead to better reward inference and prediction of future actions.