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

Trend · papers per month

count% of corpus
0.3%0.5%0.8%0.1% · May 201719922001200920182026
3 results for “tie-aware”
Optimal Best-Arm Identification under Fixed Confidence with Multiple Optimacs.LG

Optimal best-arm identification with known number of optimal arms.

problem Identifying the best arm in a multi-armed bandit with multiple optimal arms under fixed confidence.
method Deriving a new information-theoretic lower bound and proposing a modified stopping rule.
result Achieving asymptotic instance-optimality with a new lower bound and new stopping rule.
multi-armed banditsbest-arm identificationfixed confidencemultiple optimal armsinformation-theoretic lower bound
2025-05-21abs ↗pdf ↗
iSplit LBI: Individualized Partial Ranking with Ties via Split LBIcs.LG

iSplit LBI predicts individualized partial rankings from ties, outperforming state-of-the-art methods.

problem Predicting partial rankings from pairwise comparisons with ties, considering individual preferences.
method Variable splitting-based algorithm (iSplit LBI) that generates a sequence of estimations with a regularization path, decomposing parameters into abnormal signals, personalized signals, and random noise.
result iSplit LBI significantly outperforms state-of-the-art alternatives in predicting individualized partial rankings.
partial rankingpairwise comparisontiesindividualizedabnormal user selection
2019-10-14abs ↗pdf ↗