arXiv Machine Learning
Selecting k Paths with the Minimum Longest Path Length in the Stochastic Semi-Bandit Setting
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
Jul 14
Learning from Local Walks on Dynamic Graphs with Bandit Feedback
arXiv:2607. 10571v1 Announce Type: cross Abstract: We study stochastic multi-armed bandits on dynamic graphs, where arms correspond to the vertices of a network with time-varying edges.
arXiv Machine Learning
Jul 20
Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths
arXiv:2607. 15440v1 Announce Type: new Abstract: We introduce Stochastic Reset Pathfinding (SRP), an episodic learning problem on a known directed graph with unknown stationary edge success probabilities.
arXiv Machine Learning
Sep 10
Online Learning with LLM Experts from Limited Feedback
arXiv:2609.05820v1 Announce Type: new Abstract: We study adaptive routing of prompts to large language model (LLM) experts to maximize response quality in an online setting with limited feedback. We...
arXiv Machine Learning
Jul 9
Nonlinear Bandit
arXiv:2607. 07304v1 Announce Type: new Abstract: In this paper we first study the problem of generalized linear bandit (GLB) under heavy-tailed noise.
arXiv Machine Learning
Jun 2
Online Packet Scheduling with Deadlines and Learning
arXiv:2606. 00835v1 Announce Type: new Abstract: Network routers that enforce Quality-of-Service (QoS) guarantees must decide, at every clock cycle, which expiring packet of information to transmit, even when the value of the packet is unknown until it is processed.
arXiv AI
Jun 19
Flickering Multi-Armed Bandits
arXiv:2602. 17315v3 Announce Type: replace-cross Abstract: We introduce Flickering Multi-Armed Bandits (FMAB) to model sequential decision-making in environments with changing action availability, where accessibility of the next action is restricted to a subset dependent on the agent's current choice.