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,742 papers · 148 categories

Trend · papers per month

133265398530 · Jun 202019922001200920172026
48 results for adaptive agent grouping

A novel framework for adaptive multi-agent communication in reinforcement learning.

problem Manual specification of communication structures in multi-agent reinforcement learning.
method Learning Structured Communication (LSC) framework using hierarchical graph neural networks.
result Adaptive hierarchical formations and efficient message propagation among agents.

Adaptive clustering and personalization algorithms minimize regret in multi-agent stochastic linear bandits.

problem Minimizing regret in a multi-agent stochastic linear bandits framework with user heterogeneity.
method Proposes a novel algorithm that refines cluster identities and minimizes regret, adapting to cluster separation and user parameter deviations.
result Regret scales as O(T/N)\mathcal{O}(\sqrt{T/N}) for well-separated clusters and O(T12+ε/(N)12ε)\mathcal{O}(T^{\frac{1}{2} + \varepsilon}/(N)^{\frac{1}{2} -\varepsilon}) for poorly separated clusters.

When consequential decisions are informed by algorithmic input, individuals may feel compelled to alter their behavior in order to gain a system's approval. Models of agent responsiveness, termed "strategic manipulation," analyze the interaction between a learner and agents in a world where all agents are equally able …

2018-08-27abs ↗pdf ↗

We propose a model for equity trading in a population of agents where each agent acts to achieve his or her target stock-to-bond ratio, and, as a feedback mechanism, follows a market adaptive strategy. In this model only a fraction of agents participates in buying and selling stock during a trading period, while the re…

2018-09-25abs ↗pdf ↗

Adaptive policies for multi-agent RL improve adaptiveness in changing environments.

problem Non-stationarity in multi-agent reinforcement learning where other agents may alter their policies.
method Train multiple adaptive policies for each agent and a policy predictor to select the best policy at execution time.
result Agents trained with our method outperform state-of-the-art methods in all tested environments.

Develops a generic two-layer framework for adaptive ABMs.

problem Bi-level adaptation problem in ABMs: agents adapt to environment, and environment adapts to agents.
method Formalizes bi-level problem as a Stackelberg game with conditional policies, solving coupled non-linear equations.
result Unified framework for adaptive ABMs, addressing traditional ABM limitations.

ATLAS uses LLMs to adaptively trade by optimizing prompts and coordinating agents.

problem Adapting LLMs for real-time financial decision-making in noisy markets.
method ATLAS integrates structured market data, uses Adaptive-OPRO for prompt optimization, and employs multi-agent coordination.
result Adaptive-OPRO consistently outperforms fixed prompts in financial trading.

We derive a class of macroscopic differential equations that describe collective adaptation, starting from a discrete-time stochastic microscopic model. The behavior of each agent is a dynamic balance between adaptation that locally achieves the best action and memory loss that leads to randomized behavior. We show tha…

2004-08-20abs ↗pdf ↗

Adapts agent strategies on-the-fly for better cross-play in cooperative settings.

problem Cross-play issues between self-play agents and unseen partners.
method Adapts agent strategies using posterior belief updates via Gibbs sampling.
result Achieves strong cross-play in the Hanabi game without prior knowledge of partners' strategies.

Study coevolutionary trading-agent dynamics in continuous strategies.

problem Understanding adaptive trading-agent interactions in complex markets.
method Experimental study of adaptive automated trading agents in a continuous strategy space.
result High-dimensional coevolutionary dynamics pose challenges in market analysis.

This work proposes ACTC for adaptive distributed learning under communication constraints.

problem Adaptive distributed learning in networks with communication constraints.
method ACTC (Adapt-Compress-Then-Combine) strategy with diffusion exchange of compressed updates.
result ACTC iterates converge to the optimizer with significant bit savings.

A Kyle-inspired model with adaptive agents explains excess volatility and volatility clustering.

problem Reconciling asymmetrically informed traders with adaptive market hypothesis.
method Proposes a model with adaptive agents using inductive reasoning, reconciling Kyle model with Adaptive Market Hypothesis.
result Microfoundations for GARCH models and volatility clustering explained.

We study the problem of designing AI agents that can robustly cooperate with people in human-machine partnerships. Our work is inspired by real-life scenarios in which an AI agent, e.g., a virtual assistant, has to cooperate with new users after its deployment. We model this problem via a parametric MDP framework where…

2019-10-05abs ↗pdf ↗

Curious Replay improves model-based reinforcement learning agents' adaptability.

problem Existing model-based reinforcement learning agents struggle to adapt quickly to changing environments.
method Curious Replay uses a curiosity-based priority signal for prioritized experience replay tailored to model-based agents.
result Agents using Curious Replay achieve improved performance in exploration and on benchmarks.

The paper examines how slightly biasing towards under-represented groups in sequential selection processes can lead to long-term fairness.

problem Designing fair sequential decision-making processes for long-term social fairness.
method Proposes Multi-agent Fair-Greedy policy to balance score maximization and fairness.
result Proves convergence to long-term fairness target set by agents when score distributions are identical.

AI agents improve forecast combination in empirical economics.

problem Hidden researcher degrees of freedom in AI-generated code.
method Adapted agent-loop architecture to empirical economics, added holdout evaluation.
result Independent agent searches find better forecast methods than benchmarks.

This research tackles information design in multi-agent reinforcement learning.

problem Designing information to influence other adaptive agents in a non-stationary environment.
method Formulated Markov signaling game, introduced signaling gradient and extended obedience constraints.
result Developed efficient algorithm for mixed-motive tasks in multi-agent reinforcement learning.

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.

AI agents improve forecast combination but require transparency.

problem AI coding agents increase flexibility in empirical economics, leading to hidden degrees of freedom.
method Adapted open-source agent-loop architecture to empirical economics workflow, adding post-search holdout evaluation.
result Multiple agent runs outperform standard benchmarks in rolling evaluation but not all on post-search holdout.

Multi-agent models have been used in many contexts to study generic collective behavior. Similarly, complex networks have become very popular because of the diversity of growth rules giving rise to scale-free behavior. Here we study adaptive networks where the agents trade ``wealth'' when they are linked together while…

2008-04-25abs ↗pdf ↗

AMSAs adaptively manage crypto-currency trading by selecting multiple strategies based on market conditions.

problem Maximizing gains in volatile crypto-currency markets with high uncertainty.
method AMSAs use multiple sub-agents with different strategies, dynamically selecting them based on market conditions.
result AMSAs can achieve high positive alpha in long-term crypto-currency trading.

This paper improves MARL for networked systems through new protocols and discount factors.

problem Improving control in networked systems using multi-agent reinforcement learning.
method Formulated as a spatiotemporal Markov decision process, introduced a spatial discount factor, and proposed NeurComm.
result Appropriate spatial discount factor enhances learning curves of non-communicative MARL algorithms.

A model is developed to study the effectiveness of innovation and its impact on structure creation and structure change on agent-based societies. The abstract model that is developed is easily adapted to any particular field. In any interacting environment, the agents receive something from the environment (the other a…

2007-09-17abs ↗pdf ↗

MASA framework uses RL to balance portfolio returns and risks.

problem Managing portfolio risk in turbulent financial markets.
method Multi-agent reinforcement learning with a market observer.
result MASA framework outperforms RL approaches in balancing returns and risks.

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.

Paper analyzes convergence rates for multi-agent learning in games.

problem Convergence rates for multi-agent learning in games.
method Characterizes finite-time convergence rates for joint OGD learning on λλ-cocoercive games and develops adaptive algorithms.
result Adaptive algorithms achieve same convergence rates as non-adaptive counterparts.

AGENTICAITA uses AI agents to autonomously trade markets without human intervention.

problem Inability of traditional trading systems to adapt to market complexity.
method Introduces an agentic AI framework with specialized LLM agents reasoning, negotiating, and acting.
result Demonstrated operational correctness and non-trivial inter-agent negotiation in live market conditions.

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.

LLMs in financial markets show diverse behaviors, from stable to speculative, challenging rational expectations.

problem Understanding the economic behaviors of LLMs in financial markets.
method Simulated financial market with 15 LLMs of varying sizes and capabilities.
result LLMs exhibit a spectrum of behaviors, including speculative bubbles, inconsistent with rational expectations.

We consider a two-agent MDP framework where agents repeatedly solve a task in a collaborative setting. We study the problem of designing a learning algorithm for the first agent (A1) that facilitates a successful collaboration even in cases when the second agent (A2) is adapting its policy in an unknown way. The key ch…

2019-01-23abs ↗pdf ↗

ARCO-BO optimizes multi-agent design under heterogeneity, improving efficiency and performance.

problem Heterogeneous multi-agent optimization challenges in resource use and information sharing.
method ARCO-BO integrates a consensus mechanism, budget-aware sampling, and partial input sharing for heterogeneous design spaces.
result ARCO-BO outperforms independent and collaborative BO methods in complex multi-agent settings.

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.

Study shows how adaptive market agents can lead to persistent overpricing in financial markets.

problem Persistent overpricing in financial markets by adaptive market agents.
method Analyzes a repeated game between market maker and market taker, decomposes the game into competitive and collaborative components, and uses projected stochastic gradient ascent.
result Decentralized learning by adaptive market agents can lead to persistent overpricing in financial markets.