3 papers
cs.LG2026
Cost-Ordered Feasibility for Multi-Armed Bandits with Cost Subsidy
Ishank Juneja, Carlee Joe-Wong, Osman Yağan
The classic multi-armed bandit (MAB) problem tackles the challenge of accruing maximum reward while making decisions under uncertainty. However, in applications, often the goal is…
cs.LG2025
Pairwise Elimination with Instance-Dependent Guarantees for Bandits with Cost Subsidy
Ishank Juneja, Carlee Joe-Wong, Osman Yağan
Multi-armed bandits (MAB) are commonly used in sequential online decision-making when the reward of each decision is an unknown random variable. In practice however, the typical go…
eess.SY2020
Correlated Age-of-Information Bandits
Ishank Juneja, Santosh Fatale, Sharayu Moharir
We consider a system composed of a sensor node tracking a time varying quantity. In every discretized time slot, the node attempts to send an update to a central monitoring station…