Agent-based modeling is a powerful simulation technique to understand the collective behavior and microscopic interaction in complex financial systems. Recently, the concept for determining the key parameters of the agent-based models from empirical data instead of setting them artificially was suggested. We first revi…
Many learning agents impact a financial market model, showing complex dynamics.
problem Understanding the dynamics of financial markets with multiple learning agents.
method Agent-based model of financial market with multiple reinforcement learning agents interacting.
result Inclusion of learning agents changes market dynamics to match empirical data.
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…
Reduced models derived from agent-based systems using Koopman theory.
problem Time-consuming simulations of large agent-based systems.
method Koopman operator theory applied to simulation data.
result Derived reduced models match known analytical results.
We propose a method to efficiently learn diverse strategies in reinforcement learning for query reformulation in the tasks of document retrieval and question answering. In the proposed framework an agent consists of multiple specialized sub-agents and a meta-agent that learns to aggregate the answers from sub-agents to…
To achieve a high learning accuracy, generative adversarial networks (GANs) must be fed by large datasets that adequately represent the data space. However, in many scenarios, the available datasets may be limited and distributed across multiple agents, each of which is seeking to learn the distribution of the data on …
Generative tools mimic stock market traders using synthetic data.
problem Imitating trading behavior of stock market participants.
method Modified state-space model applied to limit order book data, trained on synthetic data generated from a heterogeneous agent-based model.
result Model's predicted distribution matches ground truths from the agent-based model.
New algorithm reduces multi-agent bandit regret by sharing data.
problem Designing efficient collaboration between multi-agent linear bandits.
method Bandit Adaptive Sample Sharing (BASS) algorithm, without assumptions on bandit parameters structure.
result Validated through theoretical analysis and empirical evaluations, BASS outperforms current state-of-the-art.
Improved ABFMs capture market complexities, aiding policy decisions.
problem Limited usefulness of current ABFMs due to missing microstructure and agent behaviors.
method Developed ABMMS with realistic market structure, communication, and auction mechanisms; populated with adaptive agents.
result Generated data from ABMMS more accurately reflects real market phenomena.
Paper studies IPG method's robustness in noisy distributed linear regression.
problem Distributed linear regression with noise.
method Iteratively Pre-conditioned Gradient-descent (IPG) method.
result IPG method's robustness against noise compared favorably to state-of-the-art algorithms.
Collab algorithm learns models from agents with missing data.
problem Learning linear models collaboratively with missing data.
method Distributed, semi-supervised algorithm with three steps: local training, aggregation, and distribution.
result Collab achieves nearly asymptotically local minimax optimal performance.
New method speeds up distributed linear regression.
problem Efficiently solve distributed linear regression problems.
method Iteratively Pre-conditioned Stochastic Gradient Descent (IPSG)
result Converges linearly in expectation to the solution.
The recent trend for acquiring big data assumes that possessing quantitatively more and qualitatively finer data necessarily provides an advantage that may be critical in competitive situations. Using a model complex adaptive system where agents compete for a limited resource using information coarse-grained to differe…
MA-COPP predicts multi-agent system outcomes using data from a different policy, with probabilistic guarantees.
problem Predicting outcomes in multi-agent systems using data from a different policy.
method Conformal prediction framework applied to multi-agent systems, avoiding exhaustive search.
result Achieves probabilistic guarantees for multi-agent system predictions.
Paper proposes a new method to simulate realistic markets from data.
problem Lack of accurate market simulators leading to misleading conclusions.
method Proposes a world agent model trained on historical data without agent calibration.
result Models consistently outperform previous methods in realism and responsiveness.
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.
RL improves market making with historical data time travel.
problem Limited ability to simulate and fully appraise the impact of actions in competitive systems.
method Introduces 'consistent data time travel' to adjust historical data time index.
result Significant improvement in agent's gain with data time travel.
Meta-agent learns effective exploration from offline data.
problem Design a meta-agent to quickly maximize reward in unseen tasks.
method Bayesian RL approach with adaptive neural belief estimate.
result Meta-agent learns effective exploration behavior from diverse tasks.
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.
FinRobot AI agent for equity research provides comprehensive insights.
problem Narrow focus and limited discretion in AI solutions for equity research.
method Multi-agent Chain of Thought system integrating quantitative and qualitative analyses.
result FinRobot delivers insights comparable to major brokerage firms.
Inferring the laws of interaction between particles and agents in complex dynamical systems from observational data is a fundamental challenge in a wide variety of disciplines. We propose a non-parametric statistical learning approach to estimate the governing laws of distance-based interactions, with no reference or a…
We consider several estimation and learning problems that networked agents face when making decisions given their uncertainty about an unknown variable. Our methods are designed to efficiently deal with heterogeneity in both size and quality of the observed data, as well as heterogeneity over time (intermittence). The …
Securities markets are quintessential complex adaptive systems in which heterogeneous agents compete in an attempt to maximize returns. Species of trading agents are also subject to evolutionary pressure as entire classes of strategies become obsolete and new classes emerge. Using an agent-based model of interacting he…
Agent-to-agent finance aims to manage payments and trust for AI agents.
problem Managing financial interactions between autonomous AI agents.
method Develops agent-to-agent finance concept and explores blockchain solutions.
result Agent-to-agent finance can address coordination frictions in financial markets.
Agent Trading Arena trains LLMs in real-time financial markets to improve numerical reasoning.
problem Limited real-world training for LLMs in financial markets.
method Virtual zero-sum stock market with competitive multi-agent trading.
result LLMs perform better with chart-based visualizations and a reflection module.
Study models opaque financial markets using multi-agent simulation.
problem Challenges in financial markets with obscured data availability.
method Multi-agent simulation with small-scale meta-heuristic methods.
result Captures bilateral market dynamics of OTC trading.
Scaling up model and data size improves imitation learning in single-agent games.
problem Limited recovery of expert behavior in single-agent games using imitation learning.
method Investigate the effect of scaling model and data size on imitation learning performance.
result IL loss and mean return scale with compute budget, resulting in power laws.
Federated learning performs distributed model training using local data hosted by agents. It shares only model parameter updates for iterative aggregation at the server. Although it is privacy-preserving by design, federated learning is vulnerable to noise corruption of local agents, as demonstrated in the previous stu…
FinVision uses LLM agents to predict stock markets by processing various financial data types.
problem Challenges in integrating diverse financial data for accurate stock market prediction.
method Multi-agent framework with LLMs specialized in different financial data types and a reflection module.
result The reflection module enhances decision-making capabilities for financial trading.
Cooperation is often implicitly assumed when learning from other agents. Cooperation implies that the agent selecting the data, and the agent learning from the data, have the same goal, that the learner infer the intended hypothesis. Recent models in human and machine learning have demonstrated the possibility of coope…
Paper develops framework for AI agents in financial markets.
problem Systemic implications of AI in finance depend on agent architectures.
method Four-layer architecture and AFMM model for analysis.
result AI agents can improve market efficiency and resilience.
Paper addresses fault-tolerance in distributed machine learning with stochastic gradient descent.
problem Fault-tolerance in distributed stochastic gradient descent (D-SGD) for machine learning.
method Proposes norm-based comparative gradient elimination (CGE) to robustify D-SGD against Byzantine faulty agents.
result CGE guarantees fault-tolerance against a bounded fraction of Byzantine agents under standard stochastic assumptions.
RD-Agent(Q) automates quantitative finance research and development.
problem Challenges in asset return prediction due to high dimensionality and volatility.
method Data-centric multi-agent framework for automated research and development of quantitative strategies.
result Up to 2X higher annualized returns with 70% fewer factors.
Enhances anomaly detection in financial markets using AI agents.
problem Manual verification of financial market anomalies is time-consuming and error-prone.
method A multi-agent LLM framework for automated anomaly detection.
result Framework reduces human intervention and improves efficiency and accuracy.
LLM agents discover cryptocurrency factors under reproducible constraints.
problem Flexibility of LLM agents in empirical discovery leads to uncontrolled search.
method Sequential hypothesis search with fixed data splits and portfolio tests.
result Ridge-combined portfolio achieves 44.55% annualized return in out-of-sample period.
A financial market model uses spin variables to represent and predict agent behavior.
problem Predicting and understanding financial market behavior.
method Agent-based model with Potts model interpretation, focusing on spin variables representing opinions and actions.
result Model accurately predicts market behavior and statistical properties of financial returns.
JaxMARL-HFT accelerates MARL for HFT with 240x speedup.
problem Heavy computational cost in MARL for HFT.
method GPU-accelerated JAX framework for multi-agent RL.
result Agents learn to outperform benchmarks in HFT.
Motivated by recent advancements in Deep Reinforcement Learning (RL), we have developed an RL agent to manage the operation of storage devices in a household and is designed to maximize demand-side cost savings. The proposed technique is data-driven, and the RL agent learns from scratch how to efficiently use the energ…
Based on criteria of mathematical simplicity and consistency with empirical market data, a model with volatility driven by fractional noise has been constructed which provides a fairly accurate mathematical parametrization of the data. Here, some features of the model are discussed and, using agent-based models, one tr…
QRAFTI uses multi-agent framework to improve equity factor research.
problem Replicating and developing new equity factors in large financial datasets.
method Integrates a research toolkit with MCP servers for data access and custom coding operations.
result Improves performance and explainability in multi-step empirical tasks.
Contextual bandit algorithms~(CBAs) often rely on personal data to provide recommendations. Centralized CBA agents utilize potentially sensitive data from recent interactions to provide personalization to end-users. Keeping the sensitive data locally, by running a local agent on the user's device, protects the user's p…
Federated learning models are analyzed through game theory to determine optimal model sharing.
problem Agents with different data distributions face a choice between local or global models in federated learning.
method The problem is analyzed using coalitional game theory and hedonic game theory, considering different degrees of customization in model sharing.
result Exact expected MSE values are derived for linear regression and mean estimation problems, and stable partitions of players into coalitions are analyzed.
Revealed preference theory studies the possibility of modeling an agent's revealed preferences and the construction of a consistent utility function. However, modeling agent's choices over preference orderings is not always practical and demands strong assumptions on human rationality and data-acquisition abilities. Th…
New algorithms allow multiple robots to search efficiently without central coordination.
problem Efficiently locating targets in an unknown environment with multiple robots.
method SPATS and LATSI algorithms for asynchronous multi-agent active search.
result Multiple robots can independently make data-collection decisions without a central coordinator.
Defines data science as a natural ecosystem with challenges and missions.
problem Challenges and missions in data science due to 5D complexities and data life cycle phases.
method Systemic and data-centric view of data science as a fusion of data universe and its challenges, formalizing a general-purpose architecture.
result Essential data science as a natural ecosystem integrating specific disciplines and high-impact applications.
We propose an explainable reinforcement learning (XRL) framework that analyzes an agent's history of interaction with the environment to extract interestingness elements that help explain its behavior. The framework relies on data readily available from standard RL algorithms, augmented with data that can easily be col…
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.
Temporal prediction is critical for making intelligent and robust decisions in complex dynamic environments. Motion prediction needs to model the inherently uncertain future which often contains multiple potential outcomes, due to multi-agent interactions and the latent goals of others. Towards these goals, we introduc…