The Secretary Problem with Predictions

K Fujii, Y Yoshida - Mathematics of Operations Research, 2024 - pubsonline.informs.org
The value maximization version of the secretary problem is the problem of hiring a candidate
with the largest value from a randomly ordered sequence of candidates. In this work, we …

Toward a general theory of online selective sampling: Trading off mistakes and queries

S Hanneke, L Yang - International Conference on Artificial …, 2021 - proceedings.mlr.press
While the literature on the theory of pool-based active learning has seen much progress in
the past 15 years, and is now fairly mature, much less is known about its cousin problem …

Exploring Optimal Configurations in Active Learning for Medical Imaging

A Parise, B Mac Namee - … on Innovative Techniques and Applications of …, 2023 - Springer
Medical imaging is a critical component of clinical decision-making, patient diagnosis,
treatment planning, intervention, and therapy. However, due to the shortage of qualified …

Sequential no-substitution k-median-clustering

T Hess, S Sabato - International Conference on Artificial …, 2020 - proceedings.mlr.press
We study the sample-based k-median clustering objective under a sequential setting without
substitutions. In this setting, an iid sequence of examples is observed. An example can be …

Addressing bias in online selection with limited budget of comparisons

Z Benomar, E Chzhen, N Schreuder… - arXiv preprint arXiv …, 2023 - arxiv.org
Consider a hiring process with candidates coming from different universities. It is easy to
order candidates with the same background, yet it can be challenging to compare them …