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

Trend · papers per month

17345168 · Feb 202019922001200920172026
48 results for delayed arms

New algorithm tackles stochastic bandits with varying arm-dependent delays.

problem Applying existing algorithms to stochastic delayed bandit settings is restricted by strong assumptions on delay distributions.
method Proposes a simple UCB-based algorithm called PatientBandits that weakens assumptions on delay distributions.
result Provides bounds on regret and performance lower bounds for the PatientBandits algorithm.

New algorithms ensure fair selection in combinatorial semi-bandit with unrestricted delays.

problem Fair selection in stochastic combinatorial semi-bandit with delayed feedback.
method Introduced merit-based fairness constraints and new bandit algorithms for reward and fairness.
result Achieved sublinear expected reward and fairness regrets with dependence on delay distribution quantiles.

We propose a generalization of the best arm identification problem in stochastic multi-armed bandits (MAB) to the setting where every pull of an arm is associated with delayed feedback. The delay in feedback increases the effective sample complexity of standard algorithms, but can be offset if we have access to partial…

2018-03-29abs ↗pdf ↗

A novel bandit problem with delayed arms, showing optimal strategies and lower bounds.

problem Optimizing reward in a stochastic multi-armed bandit setting with delayed arms.
method Mapping to PINWHEEL scheduling problem, simple greedy algorithm, UCB based algorithm, lower bounds.
result Simple greedy algorithm is asymptotically (11/e)(1-1/e) optimal and UCB based algorithm has clogT+o(logT)c \log T + o(\log T) cumulative regret.

We study a variant of the stochastic KK-armed bandit problem, which we call "bandits with delayed, aggregated anonymous feedback". In this problem, when the player pulls an arm, a reward is generated, however it is not immediately observed. Instead, at the end of each round the player observes only the sum of a number…

2017-09-20abs ↗pdf ↗

New algorithm for bandits with delayed action effects, reducing regret.

problem Delayed impact of actions in multi-armed bandits.
method Formulated a new bandit setting with delayed action effects, proposed an algorithm with regret bound.
result Achieved a regret of ildeO(KT2/3) ilde{\mathcal{O}}(KT^{2/3}) and showed a matching lower bound.

New algorithm tackles multi-armed bandit with arbitrary delays and general bounded losses.

problem Scale-free adversarial multi-armed bandit with arbitrary feedback delays.
method SFD-INF combines convex combination trick and doubling/skipping technique.
result Achieves adaptive regret bounds for non-negative and general scale-free losses.

A new algorithm tackles delayed combinatorial semi-bandit with causal relations.

problem Optimizing decisions in a non-stationary environment with delayed and causally related rewards.
method Formalized as a non-stationary delayed combinatorial semi-bandit problem, the approach models causal relations with a directed graph in a stationary structural equation model. The agent learns these relations from delayed feedback to optimize decisions.
result Proved a regret bound for the proposed algorithm's performance.

New algorithm for multi-armed bandits with delayed, partially observed rewards.

problem Sequential decision-making with delayed feedback.
method Proposed multi-armed bandits with generalized temporally-partitioned rewards, introducing β-spread property.
result Upper bound on performance of TP-UCB-FR-G algorithm improves state of the art.

New algorithm reduces regret in collaborative multi-agent bandit problems.

problem Optimizing decisions in a network of agents with communication delays.
method Follow-the-Regularized-Leader (FTRL) algorithm with suitable regularizers and communication protocols.
result Upper bound on individual regret matches lower bound up to a constant factor.

Study non-oblivious adversarial bandits with delayed feedback and propose algorithms with improved regret bounds.

problem Adversarial bandit problem with delayed, composite anonymous feedback.
method Propose wrapper algorithm for non-oblivious delay setting, achieving o(T)o(T) policy regret.
result Achieve o(T)o(T) policy regret for many adversarial bandit problems with bounded memory loss sequences.

We study a decentralized cooperative stochastic multi-armed bandit problem with KK arms on a network of NN agents. In our model, the reward distribution of each arm is the same for each agent and rewards are drawn independently across agents and time steps. In each round, each agent chooses an arm to play and subsequ…

2018-10-10abs ↗pdf ↗

New model for music streaming recommends songs based on past play history.

problem Nonstationary stochastic bandit model with delay-dependent rewards.
method Ranking policies approximating optimal policy with bounded regret.
result Algorithm with O~( ⁣kT)\widetilde{\mathcal{O}}\big(\!\sqrt{kT}\big) regret and O(klnlnT)\mathcal{O}\big(k\ln\ln T\big) switches.

This paper deals with bandit online learning problems involving feedback of unknown delay that can emerge in multi-armed bandit (MAB) and bandit convex optimization (BCO) settings. MAB and BCO require only values of the objective function involved that become available through feedback, and are used to estimate the gra…

2018-07-09abs ↗pdf ↗

New algorithm optimizes long-term user satisfaction in recommendation systems.

problem Optimizing long-term user satisfaction in recommendation systems with delayed rewards.
method Developed a predictive model of delayed rewards and a bandit algorithm that balances exploration and exploitation.
result Our approach results in substantially better performance compared to short-term or delayed optimization.

Improved algorithm for bandits with delayed feedback, combining adversarial and stochastic performance.

problem Adversarial and stochastic multiarmed bandits with delayed feedback.
method Modified Zimmert and Seldin's algorithm with near-optimal regret guarantees.
result Near-optimal regret guarantees in both adversarial and stochastic settings.

The paper tackles carousel personalization in music streaming apps using contextual bandits.

problem Selecting relevant items to display in carousels for personalized content recommendation.
method Modeling carousel personalization as a contextual multi-armed bandit problem with multiple plays, cascade-based updates and delayed batch feedback.
result Empirically shows the effectiveness of the framework in capturing characteristics of real-world carousels.

New algorithm tackles multi-agent bandits with heavy-tailed data.

problem Maximizing system performance in multi-agent settings with heavy-tailed data.
method Algorithm exploits hub-like structures and synchronization among clients.
result Regret bound of O(M11αlogT)O(M^{1 -\frac{1}α} \log{T}) for homogeneous settings, O(MlogT)O(M \log{T}) for heterogeneous.

Study shows how repetition affects learning in bandit settings, providing algorithms with sublinear regret.

problem Effect of persistence of engagement on learning in stochastic multi-armed bandit settings.
method Novel algorithms that achieve sublinear regret under temporal constraints.
result Additive effect of priming on regret upper bound, matching popular algorithms in absence of priming.

Paper tackles constrained bandit problems with a new learning framework.

problem Optimizing a black-box reward function subject to a black-box constraint function over a continuous space.
method Rectified Pessimistic-Optimistic Learning (RPOL) framework, incorporating optimistic and pessimistic GP bandit learning.
result RPOL achieves sublinear regret and minimal cumulative constraint violation.

Paper tackles action delays in reinforcement learning, proposing a delay-aware framework.

problem Action delays degrade reinforcement learning performance in real-world systems.
method Formal definition of delay-aware MDP, transformation into standard MDP with augmented states, delay-aware model-based reinforcement learning framework.
result Proposed framework is more efficient in training and transferable between systems with various delay durations.

New algorithm handles delayed feedback robustly, reducing regret without knowing delay bounds.

problem Bandits with variably delayed feedback, especially excessive delays.
method Implicit exploration scheme, adaptive skipping, drifted regret control.
result Can tolerate arbitrary excessive delays up to order T, reducing regret.

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.

Study on synchronization in financial markets with time delays.

problem Understanding market dynamics and synchronization in financial systems with time delays.
method Examined a system of coupled non-linear delay-differential equations, linearized for small delays, and analyzed collective dynamics using bifurcation diagrams and numerical solutions.
result Demonstrated that limit cycles can be maintained in coupled N-asset models with appropriate parameterization, leading to market synchronization.

BayTiDe discovers time-delayed differential equations from noisy data.

problem Discovering time-delayed differential equations from data with large delays and noise.
method Bayesian inference with a sparsity-promoting prior.
result BayTiDe accurately identifies time-delayed differential equations with accuracy proportional to data resolution.

We investigate multiarmed bandits with delayed feedback, where the delays need neither be identical nor bounded. We first prove that "delayed" Exp3 achieves the O((KT+D)lnK)O(\sqrt{(KT + D)\ln K} ) regret bound conjectured by Cesa-Bianchi et al. [2019] in the case of variable, but bounded delays. Here, KK is the number of actio…

2019-06-03abs ↗pdf ↗

Delayed-RNN approximates stacked and bidirectional RNNs.

problem Improving RNN expressiveness and representational capacity.
method Weight-constrained delayed-RNN, equivalent to stacked-RNNs, with partial acausality.
result Delayed-RNN can approximate stacked and bidirectional RNNs, outperforming them in some tasks.

New algorithm tackles non-stationary delayed feedback in recommender systems.

problem Challenges in learning from delayed feedback in non-stationary environments.
method Developed a UCRL-based algorithm for non-stationary, delayed bandits with intermediate observations.
result Sublinear regret guarantees for the proposed algorithm in non-stationary delayed environments.