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.

169,051 papers · 148 categories

Trend · papers per month

count% of corpus
0111 · Dec 201819922001200920182026
2 results for “winner-finding”
From PAC to Instance-Optimal Sample Complexity in the Plackett-Luce Modelcs.LG

Optimal sample complexity for learning Plackett-Luce models.

problem PAC-learning good items from subsetwise feedback in Plackett-Luce models.
method Algorithm based on a wrapper around a PAC winner-finding algorithm, adapting to instance hardness.
result Optimal instance-dependent sample complexity for best arm identification.
PAC learningPlackett-Luce modelsample complexitywinner-findinginstance-dependent
2019-03-01abs ↗pdf ↗
Duelling Bandits with Weak Regret in Adversarial Environmentscs.LG

New algorithm for duelling bandits with weak regret in adversarial settings.

problem Improving performance in duelling bandits with weak regret.
method Developed an algorithm for duelling bandits in adversarial environments, considering the Borda winner.
result Algorithm provides theoretical guarantees in both utility-based and unrestricted settings.
duelling banditsweak regretadversarial settingBorda winnerweak absolute-valued feedback
2018-12-10abs ↗pdf ↗