Research
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

count% of corpus
0111 · Sep 202119922001200920172026
1 result for “Sup-Lin-UCB”
Improved Algorithms for Misspecified Linear Markov Decision Processescs.LG

Improved algorithm for misspecified MLMDPs with bounded regret and space/time complexities.

problem Misspecified linear Markov decision processes.
method Proposes an algorithm with three desirable properties: bounded regret, bounded space/time complexities, and no need for misspecification input.
result Regret scales as Kmax⁡{εextmis,εexttol}K \max \{ \varepsilon_{ ext{mis}}, \varepsilon_{ ext{tol}} \}, improving existing bounds.
misspecified MLMDPregretbounded complexitySup-Lin-UCBcontextual bandits
2021-09-12abs ↗pdf ↗