Search papers, labs, and topics across Lattice.
1
0
2
Even with noisy reward observations and unknown reward distributions, near-optimal online decision-making is possible using LCB thresholding, achieving competitive ratios of $1 - 1/e$ and $1/2$ in i.i.d. and non-i.i.d. settings, respectively.
