New algorithms handle unknown delays in online learning problems.
problem Handling unknown delays in bandit online learning.
method DEXP3 for MAB and DBGD for BCO, with a unified analysis.
result Regret bounds of for DEXP3 and for DBGD.
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.
169,051 papers · 148 categories
Trend · papers per month
2 results for “DEXP3”
Proposes DEXP3.M for unknown delay in multi-arm bandit with multiple play.
problem Unknown delays in adversarial multi-armed bandit with multiple play.
method DEXP3.M algorithm addressing the challenge of associating feedback losses to arms.
result Regret bound is only slightly worse than single play setting.