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.

168,657 papers · 148 categories

Trend · papers per month

3547081,0621,416 · Jun 202019922001200920172026
48 results for multi-agent modeling

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.

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.

PettingZoo library accelerates multi-agent reinforcement learning research.

problem Challenges in multi-agent reinforcement learning, especially conceptual models of games.
method Developed PettingZoo library with AEC games model to address multi-agent reinforcement learning challenges.
result AEC games model addresses conceptual issues in multi-agent reinforcement learning environments.

TradingAgents uses LLM-powered multi-agent framework for financial trading.

problem Lack of collaborative dynamics in multi-agent financial trading systems.
method Inspired by real-world trading firms, TradingAgents features specialized LLM-powered agents and a risk management team.
result Framework outperforms baseline models in trading performance metrics.

CODA resolves coordination issues in offline multi-agent reinforcement learning.

problem Coordination failure in offline multi-agent reinforcement learning.
method Diffusion-based multi-agent trajectory generator for data augmentation.
result CODA resolves coordination pathologies in continuous polynomial games and complex benchmarks.

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.

We propose a method to model multi-agent behaviors with limited observation and mechanical constraints.

problem Modeling real-world multi-agent behaviors with limited observation and mechanical constraints.
method Decentralized generative models with partial observation and mechanical constraints based on hierarchical variational recurrent neural networks.
result Our method effectively models and predicts biologically plausible behaviors with minimal constraint violations.

A new multi-agent learning method improves performance in complex games.

problem Performance gap between MAPG and value-based multi-agent approaches.
method Introduces value function decomposition into multi-agent actor-critic framework for off-policy learning.
result DOP significantly outperforms state-of-the-art multi-agent reinforcement learning algorithms.

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.

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…

2018-09-28abs ↗pdf ↗

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…

2019-06-04abs ↗pdf ↗

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.

PPO algorithm converges to global optimality in multi-agent reinforcement learning.

problem Designing statistical guarantees for policy optimization methods in multi-agent reinforcement learning.
method Leveraging a multi-agent performance difference lemma, a localized action value function is used as a descent direction for each local policy, leading to a multi-agent PPO algorithm.
result The multi-agent PPO algorithm converges to the globally optimal policy at a sublinear rate under standard regularity conditions.

Decentralized Gaussian processes for multi-agent systems.

problem Scalable and flexible learning solutions for multi-agent systems.
method Asymptotically exact decentralized solution to Gaussian processes, with online Bayesian model averaging for hyperparameter selection.
result Asymptotically exact decentralized Gaussian process approximation and online Bayesian model averaging.

The paper formalizes and analyzes multi-agent Q-learning with value factorization.

problem Understanding and improving the convergence of multi-agent Q-learning with value factorization.
method Formalized a multi-agent fitted Q-iteration framework for analyzing factorized multi-agent Q-learning.
result Multi-agent Q-learning with linear value factorization can converge under certain conditions.

Study on limits of LLM-based multi-agent planning reliability.

problem Reliability limits of LLM-based multi-agent planning.
method Modeling LLM-based multi-agent architecture as a decision network, showing dominance by centralized Bayes decision maker.
result Optimizing multi-agent directed acyclic graphs under communication budget is equivalent to choosing a constrained experiment.

New framework tackles submodular welfare with multi-agent combinatorial bandits.

problem Maximizing total welfare among agents with shared constraints and submodular utilities under bandit feedback.
method Proposes an explore-then-commit strategy with randomized assignments for multi-agent combinatorial bandits.
result Achieves ildeO(T2/3) ilde{\mathcal{O}}(T^{2/3}) regret, first for partition-based submodular welfare problem under bandit feedback.

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.

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 method to minimize regret in multi-agent control systems with adversarial disturbances.

problem Optimal control of dynamical systems with adversarial disturbances and multiple agents.
method Reduction from online convex optimization to a distributed algorithm for multi-agent control.
result The resulting distributed algorithm has low regret relative to the optimal precomputed joint policy.

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.

Algorithm maximizes total reward in multi-agent bandits with adversarial corruptions.

problem Maximizing total reward in multi-agent bandits with adversarial corruptions.
method Proposes a cooperative learning algorithm robust to adversarial corruptions.
result Demonstrates an additive O((L/Lmin)C)O((L / L_{\min}) C) regret term for an adversary with unknown corruption budget.

FedSight AI predicts federal funds rate using LLMs and multi-agent reasoning.

problem Predicting Federal Open Market Committee's decisions on federal funds rate.
method Multi-agent framework with large language models, structured and unstructured inputs, and CoD extension for efficient reasoning.
result Achieved 93.75% accuracy and 93.33% stability in predicting FOMC outcomes.

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 …

2019-10-31abs ↗pdf ↗

FACMAC combines deep policy gradients with factored critic for multi-agent reinforcement learning.

problem Cooperative multi-agent reinforcement learning in discrete and continuous action spaces.
method FACMAC uses a centralised but factored critic, combining per-agent utilities into a joint action-value function.
result FACMAC outperforms MADDPG and other baselines on multi-agent particle environments and StarCraft II tasks.

Framework for multi-agent RL with human feedback in a Snake game.

problem Improving multi-agent reinforcement learning with human feedback.
method Developed a simulated game environment for offline model training and online competitions. Introduced HILL methods and reward manipulation heuristics.
result Agents with HILL methods outperform those without in online competitions.

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.

PEAR dynamically reconfigures agent roles to prevent persistent biases in multi-agent debates.

problem Persistent positional biases and sensitivity to role assignments in fixed topologies.
method Dynamic reconfiguration of agent roles and sparse topologies based on evolving agent states.
result Significantly improves average accuracy over debate baselines across multiple reasoning benchmarks.

This work benchmarks MARL algorithms in cooperative tasks.

problem Lack of evaluation tasks and criteria for comparing MARL algorithms.
method Systematic evaluation of three MARL algorithm classes in diverse cooperative tasks.
result Insights into the effectiveness of different learning approaches.

NeuroMAS treats multi-agent systems as neural networks for scalable, trainable coordination.

problem Designing multi-agent systems as hand-designed workflows is inefficient and inflexible.
method NeuroMAS treats multi-agent systems as a neural network architecture with reinforcement learning for scalable coordination.
result NeuroMAS improves significantly over multi-agent baselines and can be scaled progressively.

Study compares MAPF and MARL algorithms for warehouse automation.

problem Optimizing multi-agent pickup and delivery in warehouse settings.
method Compared conflict-based search (MAPF) and shared experience actor-critic (MARL).
result Comprehensive benchmarking of MAPF and MARL in a simulated warehouse environment.

Study proposes a multi-agent system using LLMs for REIT trading, outperforming benchmarks.

problem Low-volatility Chinese REIT market, low risk-adjusted returns.
method Multi-agent framework with four types of agents, prediction model pathways, fine-tuning.
result Multi-agent strategies outperform buy-and-hold in terms of return, Sharpe ratio, and drawdown.

MARL algorithm uses regularization to avoid explicit structures, improving performance.

problem Lack of effective reinforcement learning methods for multi-agent systems.
method MARQ uses regularization to promote structured exploration without explicit centralized structures.
result MARQ outperforms existing methods in multi-agent environments.

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…

2019-09-27abs ↗pdf ↗

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.

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.

KVCOMM optimizes multi-agent LLM systems by reusing KV-caches, reducing redundant processing.

problem Substantial overhead from reprocessing overlapping contexts across multi-agent systems.
method KVCOMM reuses KV-caches and adjusts offsets for shared content using a pool of cached examples (anchors).
result Achieves over 70% reuse rate across diverse multi-agent tasks, up to 7.8x speedup.

AutoDIME automates design of multi-agent environments for RL.

problem Designing multi-agent environments for reinforcement learning is challenging.
method Developed intrinsic teacher rewards for multi-agent settings and evaluated them in various tasks.
result Value disagreement was found to be most consistent and effective across tasks.

Reinforcement learning in multi-agent scenarios is important for real-world applications but presents challenges beyond those seen in single-agent settings. We present an actor-critic algorithm that trains decentralized policies in multi-agent settings, using centrally computed critics that share an attention mechanism…

2018-10-05abs ↗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]).

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.

Policy-gradient method controls multiple non-cohesive targets.

problem Controlling multiple non-cohesive targets in a decentralized manner.
method Proximal Policy Optimization for target selection and driving.
result Effective control of non-cohesive targets without prior dynamics knowledge.