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.
New algorithm outperforms existing ones in multi-player bandit problems without sensing.
A classic setting of the stochastic K-armed bandit problem is considered in this note. In this problem it has been known that KL-UCB policy achieves the asymptotically optimal regret bound and KL-UCB+ policy empirically performs better than the KL-UCB policy although the regret bound for the original form of the KL-UCB…
In this work, we address the open problem of finding low-complexity near-optimal multi-armed bandit algorithms for sequential decision making problems. Existing bandit algorithms are either sub-optimal and computationally simple (e.g., UCB1) or optimal and computationally complex (e.g., kl-UCB). We propose a boosting a…
Adaptive KL-UCB algorithm for Markov and i.i.d. rewards.
New algorithm for multi-player bandits with selfish players, achieving logarithmic regret.
This paper analyzes the profitability of selfish mining on blockchain, considering the risk of ruin.
We calculate the dynamics of tax evasion within a multi-agent econophysics model which is adopted from the theory of magnetism and previously has been shown to capture the main characteristics from agent-based based models which build on the standard Allingham and Sandmo approach. In particular, we implement a feedback…
This paper is about index policies for minimizing (frequentist) regret in a stochastic multi-armed bandit model, inspired by a Bayesian view on the problem. Our main contribution is to prove that the Bayes-UCB algorithm, which relies on quantiles of posterior distributions, is asymptotically optimal when the reward dis…
In this paper we propose and explore the k-Nearest Neighbour UCB algorithm for multi-armed bandits with covariates. We focus on a setting where the covariates are supported on a metric space of low intrinsic dimension, such as a manifold embedded within a high dimensional ambient feature space. The algorithm is concept…
We present an effective technique for training deep learning agents capable of negotiating on a set of clauses in a contract agreement using a simple communication protocol. We use Multi Agent Reinforcement Learning to train both agents simultaneously as they negotiate with each other in the training environment. We al…
New findings show many popular bandit algorithms are unstable, contradicting minimax optimality.
Human behavioural patterns exhibit selfish or competitive, as well as selfless or altruistic tendencies, both of which have demonstrable effects on human social and economic activity. In behavioural economics, such effects have traditionally been illustrated experimentally via simple games like the dictator and ultimat…
The paper tackles best arm identification with minimal regret in experiments.
We propose the kl-UCB ++ algorithm for regret minimization in stochastic bandit models with exponential families of distributions. We prove that it is simultaneously asymptotically optimal (in the sense of Lai and Robbins' lower bound) and minimax optimal. This is the first algorithm proved to enjoy these two propertie…
New algorithms for batch decision-making with high-dimensional user data.
Standard economic theory, starting with Adam Smith's invisible hand, holds that those who trade for their own selfish motives of maximizing their private preferences may contribute more to the public wealth than those who claim altruistic motives. Under restrictive conditions, this has been shown to result from a self-…
We consider -armed stochastic bandits and consider cumulative regret bounds up to time . We are interested in strategies achieving simultaneously a distribution-free regret bound of optimal order and a distribution-dependent regret that is asymptotically optimal, that is, matching the lower b…
We study a generalization of the multi-armed bandit problem with multiple plays where there is a cost associated with pulling each arm and the agent has a budget at each time that dictates how much she can expect to spend. We derive an asymptotic regret lower bound for any uniformly efficient algorithm in our setting. …
New algorithm reduces regret in strategic prediction problem.
A new algorithm reduces communication costs for collaborative decision-making across clients.
Multi-player Multi-Armed Bandits (MAB) have been extensively studied in the literature, motivated by applications to Cognitive Radio systems. Driven by such applications as well, we motivate the introduction of several levels of feedback for multi-player MAB algorithms. Most existing work assume that sensing informatio…
We introduce GLR-klUCB, a novel algorithm for the piecewise iid non-stationary bandit problem with bounded rewards. This algorithm combines an efficient bandit algorithm, kl-UCB, with an efficient, parameter-free, changepoint detector, the Bernoulli Generalized Likelihood Ratio Test, for which we provide new theoretica…
Originally motivated by default risk management applications, this paper investigates a novel problem, referred to as the profitable bandit problem here. At each step, an agent chooses a subset of the K possible actions. For each action chosen, she then receives the sum of a random number of rewards. Her objective is t…
The paper analyzes the sliding regret of stochastic bandit algorithms.
A new algorithm for better decision-making in recommendation systems.
Sequential learning, also called lifelong learning, studies the problem of learning tasks in a sequence with access restricted to only the data of the current task. In this paper we look at a scenario with fixed model capacity, and postulate that the learning process should not be selfish, i.e. it should account for fu…
This work explores a social learning problem with agents having nonidentical noise variances and mismatched beliefs. We consider an -agent binary hypothesis test in which each agent sequentially makes a decision based not only on a private observation, but also on preceding agents' decisions. In addition, the agents…
New algorithms improve privacy in bandit problems with partial information.
Decentralized learning ensures stability in online queuing systems with packet rates above 1.
Look-ahead reasoning helps predict strategic user behavior on learning platforms.
New method reduces multi-armed bandit regret to near-optimal levels.
Paper introduces metrics for evaluating multi-agent policies using best response dynamics.
The exploration/exploitation (E/E) dilemma arises naturally in many subfields of Science. Multi-armed bandit problems formalize this dilemma in its canonical form. Most current research in this field focuses on generic solutions that can be applied to a wide range of problems. However, in practice, it is often the case…
This paper optimizes driver repositioning using MARL and reward design for better service and traffic management.