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

295786114 · Jun 202019922001200920172026
48 results for self-reflective agent

This paper compares self-reflection and budget tuning for LLMs, revealing domain-specific performance gains.

problem Improving inference-time performance of LLMs without retraining, balancing quality, cost, and latency.
method Systematic comparison of self-reflection and budget tuning across mathematical reasoning and translation tasks, evaluating various LLMs and model families.
result Substantial domain-dependent variation in self-reflection effectiveness, with up to 220% performance gains in mathematical reasoning.

Self-reflective VAE improves inference and generative modeling without complex components.

problem Limitations of typical VAEs in inference and generative modeling.
method Introduces self-reflective inference, a new hierarchical structure that matches variational posterior to exact posterior.
result Self-reflective inference achieves state-of-the-art performance on binarized MNIST without autoregressive layers.

SEP framework teaches LLMs to generate explainable stock predictions.

problem Challenging task of generating human-readable explanations for stock predictions.
method Self-reflective agent and Proximal Policy Optimization (PPO) for autonomous learning.
result Fine-tuned LLM outperforms traditional methods in prediction accuracy and Matthews correlation coefficient.

This paper uses LLMs and cycle consistency for better machine translation evaluation.

problem Evaluating translation quality and LLM capabilities without ground truth.
method Generate translation candidates, back-translate, and evaluate cycle consistency.
result Larger LLMs or more inference passes improve cycle consistency.

Bayesian RL enhances LLMs to reflectively explore and correct errors.

problem LLMs trained via RL lack reflective behaviors like rethinking and error correction.
method Bayesian RL framework that optimizes expected return under posterior distribution over Markov decision processes.
result BARL algorithm improves LLM performance in reasoning tasks.

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.

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.

AI agents manage portfolios, improving on human oversight.

problem Improving strategic asset allocation for institutional investors.
method 50 specialized agents produce capital market assumptions, construct portfolios, critique, and vote on each other's output.
result Meta-agent compares forecasts with realized returns and improves agent performance.

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.

New algorithm reduces regret in multi-agent bandits with malicious agents.

problem Collaboration between honest and malicious agents in multi-armed bandits.
method Dynamic reduction of communication with malicious agents, learning who is malicious.
result Algorithm reduces regret even with a single malicious agent, assuming mm is small compared to KK.

We formulate and analyze a multi-agent model for the evolution of individual and systemic risk in which the local agents interact with each other through a central agent who, in turn, is influenced by the mean field of the local agents. The central agent is stabilized by a bistable potential, the only stabilizing force…

2015-07-29abs ↗pdf ↗

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.

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.

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.
Agents Play Mix-gamephysics.soc-ph

In mix-game which is an extension of minority game, there are two groups of agents; group1 plays the majority game, but the group2 plays the minority game. This paper studies the change of the average winnings of agents and volatilities vs. the change of mixture of agents in mix-game model. It finds that the correlatio…

2005-05-17abs ↗pdf ↗

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 ↗

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.

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 ↗

Agents collaborate to reduce regret in a multi-agent linear bandit problem with side information.

problem Reducing regret in a multi-agent stochastic linear bandit with side information.
method A decentralized algorithm where agents communicate subspace indices and each plays a projected LinUCB on the corresponding low-dimensional subspace.
result Per-agent finite-time regret is much smaller when agents communicate compared to non-communicating case.

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.

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.

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 ↗

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.

Kernel method improves cooperative decision-making among agents.

problem Cooperative multi-agent decision making with contextual information.
method Proposed extsc{Coop-KernelUCB} algorithm for near-optimal per-agent regret.
result Near-optimal bounds on per-agent regret with efficient computation and communication.

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.

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.

This paper addresses reward estimation and incentive design for agents with hidden rewards.

problem Estimating and incentivizing agents with unknown rewards in a learning setting.
method Repeated adverse selection game with a self-interested learning agent and a learning principal. Introduces an estimator for consistent reward estimation and a data-driven incentive policy.
result Finite-sample consistency of the estimator and a rigorous regret bound for the principal.

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.

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 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.

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.

Study collaborative learning among multi-agents in multi-armed bandits.

problem Minimizing group cumulative regret in a heterogeneous multi-agent setting.
method Developed decentralized algorithms for collaboration between NN agents learning MM stochastic multi-armed bandits.
result Proved near-optimal behavior of proposed algorithms for group regret.

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.