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

Trend · papers per month

3917811,1721,562 · Jun 202019922001200920172026
48 results for agent learning

Agents learn to give rewards to others in a shared learning environment.

problem How to encourage cooperation among RL agents in a shared environment.
method Each agent learns a reward function to influence others, optimizing for its own and others' extrinsic objectives.
result Agents significantly outperform standard RL in Markov games, often finding near-optimal division of labor.

Method models other agents' behaviors without requiring direct observation.

problem Understanding and interacting effectively with other agents in reinforcement learning.
method Extracts representations from local observations of the controlled agent using encoder-decoder architectures.
result The method achieves higher returns than baseline methods in multi-agent environments.

A novel framework uses goal-conditioned reinforcement learning to generate diverse samples.

problem Generating high-quality, diverse samples from generative models.
method Two agents: GC-agent learns to reconstruct the training set, S-agent learns to imitate GC-agent without knowing the goals.
result Empirically, the method generates diverse and high-quality samples in image synthesis.

Reinforcement learning (RL) algorithms allow agents to learn skills and strategies to perform complex tasks without detailed instructions or expensive labelled training examples. That is, RL agents can learn, as we learn. Given the importance of learning in our intelligence, RL has been thought to be one of key compone…

2019-01-01abs ↗pdf ↗

I2C enables agents to learn efficient communication without redundancy.

problem Redundant broadcast communication in multi-agent cooperation.
method I2C learns a prior for agent-agent communication via causal inference and reinforcement learning.
result I2C reduces communication overhead and improves multi-agent cooperative performance.

A simple learning agent learns to trade in an agent-based market model.

problem Optimal execution of trades in an agent-based financial market model.
method Asynchronous trading through a matching engine, varying initial order sizes and state spaces, calibration of empirical stylized facts and price impact curves.
result Smaller state space agents converge faster in learning and can trade intuitively using spread and volume states.

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.

The ability of modeling the other agents, such as understanding their intentions and skills, is essential to an agent's interactions with other agents. Conventional agent modeling relies on passive observation from demonstrations. In this work, we propose an interactive agent modeling scheme enabled by encouraging an a…

2018-10-01abs ↗pdf ↗

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 ↗

MARLA uses deep reinforcement learning for multi-agent AHT, reducing Bayes risk.

problem Decentralized active hypothesis testing among multiple agents.
method MARLA algorithm using deep multi-agent reinforcement learning.
result MARLA outperforms single-agent learning in AHT problems.

Study improves online learning with adaptable agents in various settings.

problem Learning with improving agents in online settings.
method Extensive analysis of combinatorial dimensions, multiclass setup, bandit feedback, and agent cost.
result Characterization and analysis of online learnability in the model.

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.

This work formalizes and extends parameter sharing in multi-agent reinforcement learning.

problem Parameter sharing limits multi-agent learning to a single policy, preventing different tasks or action spaces.
method Introduces agent indication and extends parameter sharing to heterogeneous observation and action spaces.
result Proves convergence to optimal policies for parameter sharing in heterogeneous environments.

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.

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…

2018-12-10abs ↗pdf ↗

Study of repeated principal-agent bandit game with self-interested and exploratory learning agents.

problem Interaction between principal and agent in unknown environments with learning and exploration behaviors.
method Developed algorithms for self-interested and exploratory learning agents with bandit feedback, achieving regret bounds.
result Achieved O~(T2/3)\widetilde{O}(T^{2/3}) regret bound for exploratory learning agent in i.i.d. reward setup.

PCL tackles collaborative learning for diverse agents, reducing sample complexity.

problem Balancing collaborative speedup with personalization for heterogeneous agents.
method AffPCL, with bias and importance correction mechanisms.
result AffPCL reduces sample complexity by a factor of max{n1,δ}\max\{n^{-1}, δ\}, where nn is the number of agents and δ[0,1]δ\in[0,1] measures heterogeneity.

Algorithm learns optimal coordination for strategic agents in uncertain settings.

problem Optimizing rewards for strategic agents with private types and actions.
method Combines delaying mechanism, reward angle estimation, and LinUCB algorithm.
result Near optimal regret bound of O~(T)\tilde{O}(\sqrt{T}) for learning optimal policy.

Observational learning is a type of learning that occurs as a function of observing, retaining and possibly replicating or imitating the behaviour of another agent. It is a core mechanism appearing in various instances of social learning and has been found to be employed in several intelligent species, including humans…

2017-06-20abs ↗pdf ↗

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.

New learning methods for open systems with variable agents.

problem Learning in open systems with dynamic agent arrivals and departures.
method Formulated a unified open-system bandit problem with general dynamics, introducing new concepts like pre-training degree and stability.
result Certified global-UCB learning methodologies with provable guarantees, revealing dependencies between entry uncertainty, stability, and agent patterns.

Attackers can significantly reduce team rewards in cooperative multi-agent reinforcement learning.

problem Robustness of cooperative multi-agent reinforcement learning to adversaries.
method Novel attack method involving training a policy network and using targeted adversarial examples.
result Reduces team reward from 20 to 9.4 by attacking a single agent, reducing winning rate from 98.9% to 0%.

The enactive approach to cognition is typically proposed as a viable alternative to traditional cognitive science. Enactive cognition displaces the explanatory focus from the internal representations of the agent to the direct sensorimotor interaction with its environment. In this paper, we investigate enactive learnin…

2018-10-09abs ↗pdf ↗

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 ↗

Deep learning has enabled traditional reinforcement learning methods to deal with high-dimensional problems. However, one of the disadvantages of deep reinforcement learning methods is the limited exploration capacity of learning agents. In this paper, we introduce an approach that integrates human strategies to increa…

2018-06-12abs ↗pdf ↗

Learning to cooperate is crucially important in multi-agent environments. The key is to understand the mutual interplay between agents. However, multi-agent environments are highly dynamic, where agents keep moving and their neighbors change quickly. This makes it hard to learn abstract representations of mutual interp…

2018-10-22abs ↗pdf ↗

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 designs incentives for adapting multi-agent systems without knowing their learning dynamics.

problem Designing incentives for an adapting population in multi-agent systems without prior knowledge of their learning dynamics.
method Introduces a model-based non-episodic Reinforcement Learning (RL) formulation for steering Markovian agents towards desired policies, focusing on history-dependent strategies to handle model uncertainty.
result Identifies conditions for the existence of steering strategies to guide agents to desired policies and provides empirical algorithms to approximately solve the objective.

New algorithm tackles multi-agent reinforcement learning issues.

problem Multi-agent reinforcement learning suffers from the curse of many agents.
method Proposes MF-FQI algorithm based on mean embeddings of distributions.
result Establishes a non-asymptotic analysis for MF-FQI algorithm.

A new method simulates large, diverse populations of learning agents evolving in games.

problem Limited scalability and efficiency of Multi-Agent Reinforcement Learning.
method Parallelizable implementation of Policy Gradient and Opponent-Learning Awareness for evolutionary simulations.
result Simulated large, diverse populations of learning agents evolve under various strategies.

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.

A new MARL framework for community-based cooperation with transfer and active exploration.

problem Flexible coordination patterns in multi-agent systems with community structures.
method Community-based multi-agent reinforcement learning with transfer and active exploration.
result Provably convergent actor-critic algorithms for structured information sharing and transfer learning.