Open Source
On optimal stopping problems with full information and rank-dependent reward
arXiv stat.TH0 views
arXiv:2610.33701v1 Announce Type: cross Abstract: In this paper we consider optimal stopping problems with full information and rank-dependent rewards. Our focus is on the following two problems: selecting one of the r best observations (Gusein-Zade's problem with full information) and minimizing the expected rank (Robbins' problem). In both settings we provide full characterization of the optimal stopping rules and corresponding optimal values. We also present numerical experiments in which the derived dynamic programming recursions are implemented, and approximations to optimal values are computed.
Source：https://arxiv.org/abs/2610.33701PreviousAn Integrated Framework for Assessing Interpretability in Exploratory Factor AnalysisNextTask-Directed Spectral Design for Local Quantum Tomography
Related posts
Your Product Is Copyable. Your Distribution Isn't: A 24-Channel Map for Solo Builders
0dev.to
Astra can read and write weights to improve Qwen
0Hacker News
Distillation didn't help our small model until we took the labels away
0dev.to Machine Learning
462. Minimum Moves to Equal Array Elements II
0dev.to PHP
MUSBRIC: LEGO-Compatible Pneumatic Muscle Bricks for Reconfigurable Musculoskeletal Robots
0arXiv cs.RO
OpenFlyV2: An onboard vision-language-action model for aerial perception and navigation
0arXiv cs.RO