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,657 papers · 148 categories

Trend · papers per month

count % of corpus

2 results for “LinPHE”

Improved Regret of Linear Ensemble Samplingstat.ML

Improved regret bound for linear ensemble sampling.

problem Closing the gap between theory and practice in linear ensemble sampling.

method General regret analysis framework for linear bandit algorithms, revealing a relationship with LinPHE.

result Achieves a frequentist regret bound of

ilde{O}(d^{3/2}\sqrt{T})

for linear ensemble sampling.

regret bound linear ensemble sampling linear bandit algorithms LinPHE frequentist

2024-11-06abs ↗pdf ↗

Perturbed-History Exploration in Stochastic Linear Banditscs.LG

We propose a new online algorithm for cumulative regret minimization in a stochastic linear bandit. The algorithm pulls the arm with the highest estimated reward in a linear model trained on its perturbed history. Therefore, we call it perturbed-history exploration in a linear bandit (LinPHE). The perturbed history is …

2019-03-21abs ↗pdf ↗