New algorithm for combinatorial bandit problems reduces regret.
problem Optimal selection of sets of arms in bandit problems.
method SGB algorithm with optimized exploration of unselected arms.
result Achieves -regret bound of .
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,695 papers · 148 categories
Trend · papers per month
2 results for “stochastic-greedy”
ProtoBandit uses bandits to find prototypes efficiently.
problem Finding a compact set of prototypes from a large dataset.
method Stochastic greedy search and multi-armed bandits.
result ProtoBandit reduces similarity comparisons to , independent of target set size.