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.
Framework for multi-agent RL with human feedback in a Snake game.
Cross-dimensional neural networks improve AI in Catan game.
Trading strategy mimics optimal control with simple heuristic.
GE finds failures in autonomous systems without domain heuristics.
This paper is intended to explain, in simple terms, some of the mechanisms and agents common to multiagent financial market simulations. We first discuss the necessity to include an exogenous price time series ("the fundamental value") for each asset and three methods for generating that series. We then illustrate one …
Study models opaque financial markets using multi-agent simulation.
Two algorithms improve Federated RL in diverse environments.
A crucial and time-sensitive task when any disaster occurs is to rescue victims and distribute resources to the right groups and locations. This task is challenging in populated urban areas, due to the huge burst of help requests generated in a very short period. To improve the efficiency of the emergency response in t…
E-valuator converts verifier scores into reliable decision rules.
We introduce NoisyNet, a deep reinforcement learning agent with parametric noise added to its weights, and show that the induced stochasticity of the agent's policy can be used to aid efficient exploration. The parameters of the noise are learned with gradient descent along with the remaining network weights. NoisyNet …
We propose a Reinforcement Learning based approach to approximately solve the Tree Decomposition (TD) problem. TD is a combinatorial problem, which is central to the analysis of graph minor structure and computational complexity, as well as in the algorithms of probabilistic inference, register allocation, and other pr…
The Pommerman simulation was recently developed to mimic the classic Japanese game Bomberman, and focuses on competitive gameplay in a multi-agent setting. We focus on the 22 team version of Pommerman, developed for a competition at NeurIPS 2018. Our methodology involves training an agent initially through imit…
RL improves combinatorial optimization by automating heuristic search.
PackIt creates a virtual space for testing geometric planning skills.
Integer programming (IP) is a general optimization framework widely applicable to a variety of unstructured and structured problems arising in, e.g., scheduling, production planning, and graph optimization. As IP models many provably hard to solve problems, modern IP solvers rely on many heuristics. These heuristics ar…
PPO's gradients are heavy-tailed, affecting learning; a robust estimator improves performance.
New algorithm improves self-play reinforcement learning for competitive games.
A method learns to solve multilevel combinatorial problems with two players.
The game of Chinese Checkers is a challenging traditional board game of perfect information that differs from other traditional games in two main aspects: first, unlike Chess, all checkers remain indefinitely in the game and hence the branching factor of the search tree does not decrease as the game progresses; second,…
New method uses reinforcement learning to improve Simulated Annealing.
Effective and intelligent exploration has been an unresolved problem for reinforcement learning. Most contemporary reinforcement learning relies on simple heuristic strategies such as -greedy exploration or adding Gaussian noise to actions. These heuristics, however, are unable to intelligently distinguish the well …
Quantum hardware and quantum-inspired algorithms are becoming increasingly popular for combinatorial optimization. However, these algorithms may require careful hyperparameter tuning for each problem instance. We use a reinforcement learning agent in conjunction with a quantum-inspired algorithm to solve the Ising ener…
Recent trends in Agent Computational Economics research, envelop a government agent in the model of the economy, whose decisions are based on learning algorithms. In this paper we try to evaluate the performance of simulated annealing in this context, by considering a model proposed earlier in the literature, which has…
We look at the meaning of 'relaxation' in the wealth exchange models that are recently proposed in Econophysics to interpret the wealth distributions. To quantify and characterise the process of relaxation, we define an appropriate quantity and evaluate that numerically for the systems of many agents. Also, the numeric…
ARL uses queries to learn rewards, focusing on cost vs. reward value.
Simple model-based reinforcement learning outperforms model-free methods in complex tasks.
AGENTICAITA uses AI agents to autonomously trade markets without human intervention.
Reinforcement learning can greatly benefit from the use of options as a way of encoding recurring behaviours and to foster exploration. An important open problem is how can an agent autonomously learn useful options when solving particular distributions of related tasks. We investigate some of the conditions that influ…
Standard economic theory makes an allowance for the agency problem, but not the compounding of moral hazard in the presence of informational opacity, particularly in what concerns high-impact events in fat tailed domains (under slow convergence for the law of large numbers). Nor did it look at exposure as a filter that…
Pursuit-evasion is a multi-agent sequential decision problem wherein a group of agents known as pursuers coordinate their traversal of a spatial domain to locate an agent trying to evade them. Pursuit evasion problems arise in a number of import application domains including defense and route planning. Learning to opti…
Novel ML approach solves complex warehouse routing problem.
Collective motion is an intriguing phenomenon, especially considering that it arises from a set of simple rules governing local interactions between individuals. In theoretical models, these rules are normally \emph{assumed} to take a particular form, possibly constrained by heuristic arguments. We propose a new class …
Order dispatching and driver repositioning (also known as fleet management) in the face of spatially and temporally varying supply and demand are central to a ride-sharing platform marketplace. Hand-crafting heuristic solutions that account for the dynamics in these resource allocation problems is difficult, and may be…
Inferring a person's goal from their behavior is an important problem in applications of AI (e.g. automated assistants, recommender systems). The workhorse model for this task is the rational actor model - this amounts to assuming that people have stable reward functions, discount the future exponentially, and construc…
Equity-Transformer solves NP-hard min-max routing problems efficiently.
RL agent learns to place limit orders for trading signals in financial markets.
Goal-oriented reinforcement learning has recently been a practical framework for robotic manipulation tasks, in which an agent is required to reach a certain goal defined by a function on the state space. However, the sparsity of such reward definition makes traditional reinforcement learning algorithms very inefficien…
Scalable and effective exploration remains a key challenge in reinforcement learning (RL). While there are methods with optimality guarantees in the setting of discrete state and action spaces, these methods cannot be applied in high-dimensional deep RL scenarios. As such, most contemporary RL relies on simple heuristi…
SMC analysis reveals key transient effects in macroeconomic ABM.
This work uses variational inference to estimate parameters of opinion dynamics models.
Paper uses RL for high-level character control in 3D environments.
Hindsight Experience Replay (HER) is a multi-goal reinforcement learning algorithm for sparse reward functions. The algorithm treats every failure as a success for an alternative (virtual) goal that has been achieved in the episode. Virtual goals are randomly selected, irrespective of which are most instructive for the…
We consider an agent who invests in a stock and a money market account with the goal of maximizing the utility of his investment at the final time T in the presence of a proportional transaction cost. The utility function considered is power utility. We provide a heuristic and a rigorous derivation of the asymptotic ex…
RL in MFGs is as hard as solving many single-agent RL problems.
A widely applied diversification paradigm is the naive diversification choice heuristic. It stipulates that an economic agent allocates equal decision weights to given choice alternatives independent of their individual characteristics. This article provides mathematically and economically sound choice theoretic founda…
Autonomous lane changing is a critical feature for advanced autonomous driving systems, that involves several challenges such as uncertainty in other driver's behaviors and the trade-off between safety and agility. In this work, we develop a novel simulation environment that emulates these challenges and train a deep r…
Just as war is sometimes fallaciously represented as a zero sum game -- when in fact war is a negative sum game - stock market trading, a positive sum game over time, is often erroneously represented as a zero sum game. This is called the "zero sum fallacy" -- the erroneous belief that one trader in a stock market exch…
Financial portfolio optimization is a widely studied problem in mathematics, statistics, financial and computational literature. It adheres to determining an optimal combination of weights associated with financial assets held in a portfolio. In practice, it faces challenges by virtue of varying math. formulations, par…